/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/egcd-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:38:42,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:38:42,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:38:42,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:38:42,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:38:42,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:38:42,904 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:38:42,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:38:42,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:38:42,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:38:42,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:38:42,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:38:42,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:38:42,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:38:42,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:38:42,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:38:42,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:38:42,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:38:42,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:38:42,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:38:42,921 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:38:42,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:38:42,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:38:42,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:38:42,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:38:42,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:38:42,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:38:42,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:38:42,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:38:42,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:38:42,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:38:42,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:38:42,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:38:42,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:38:42,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:38:42,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:38:42,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:38:42,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:38:42,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:38:42,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:38:42,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:38:42,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:38:42,951 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 22:38:42,970 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:38:42,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:38:42,970 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:38:42,970 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:38:42,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:38:42,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:38:42,971 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:38:42,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:38:42,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:38:42,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:38:42,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:38:42,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:38:42,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:38:42,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:38:42,972 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:38:42,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:38:42,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:38:42,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:38:42,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:38:42,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:38:42,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:38:42,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:38:42,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:38:42,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:38:42,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:38:42,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:38:42,973 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:38:42,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:38:42,974 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:38:42,974 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-27 22:38:43,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:38:43,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:38:43,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:38:43,196 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:38:43,198 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:38:43,199 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/egcd-ll.c [2022-04-27 22:38:43,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb6838b1c/2afdf6a624694e84adf56c9048a6b00f/FLAGeffa3195a [2022-04-27 22:38:43,644 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:38:43,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/egcd-ll.c [2022-04-27 22:38:43,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb6838b1c/2afdf6a624694e84adf56c9048a6b00f/FLAGeffa3195a [2022-04-27 22:38:43,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb6838b1c/2afdf6a624694e84adf56c9048a6b00f [2022-04-27 22:38:43,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:38:43,668 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:38:43,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:38:43,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:38:43,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:38:43,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:38:43" (1/1) ... [2022-04-27 22:38:43,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50079a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:43, skipping insertion in model container [2022-04-27 22:38:43,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:38:43" (1/1) ... [2022-04-27 22:38:43,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:38:43,697 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:38:43,819 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/egcd-ll.c[489,502] [2022-04-27 22:38:43,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:38:43,861 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:38:43,874 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/egcd-ll.c[489,502] [2022-04-27 22:38:43,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:38:43,890 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:38:43,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:43 WrapperNode [2022-04-27 22:38:43,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:38:43,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:38:43,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:38:43,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:38:43,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:43" (1/1) ... [2022-04-27 22:38:43,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:43" (1/1) ... [2022-04-27 22:38:43,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:43" (1/1) ... [2022-04-27 22:38:43,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:43" (1/1) ... [2022-04-27 22:38:43,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:43" (1/1) ... [2022-04-27 22:38:43,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:43" (1/1) ... [2022-04-27 22:38:43,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:43" (1/1) ... [2022-04-27 22:38:43,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:38:43,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:38:43,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:38:43,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:38:43,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:43" (1/1) ... [2022-04-27 22:38:43,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:38:43,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:38:43,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 22:38:43,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 22:38:43,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:38:43,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:38:43,992 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:38:43,993 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 22:38:43,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 22:38:43,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:38:43,995 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 22:38:43,996 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:38:43,996 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:38:43,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:38:43,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 22:38:43,997 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 22:38:43,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 22:38:43,997 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:38:43,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:38:43,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:38:43,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:38:43,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:38:43,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:38:43,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:38:44,054 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:38:44,055 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:38:44,230 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:38:44,235 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:38:44,235 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 22:38:44,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:38:44 BoogieIcfgContainer [2022-04-27 22:38:44,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:38:44,240 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:38:44,240 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:38:44,241 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:38:44,243 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:38:44" (1/1) ... [2022-04-27 22:38:44,244 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:38:44,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:38:44 BasicIcfg [2022-04-27 22:38:44,269 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:38:44,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:38:44,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:38:44,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:38:44,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:38:43" (1/4) ... [2022-04-27 22:38:44,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235da16d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:38:44, skipping insertion in model container [2022-04-27 22:38:44,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:43" (2/4) ... [2022-04-27 22:38:44,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235da16d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:38:44, skipping insertion in model container [2022-04-27 22:38:44,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:38:44" (3/4) ... [2022-04-27 22:38:44,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235da16d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:38:44, skipping insertion in model container [2022-04-27 22:38:44,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:38:44" (4/4) ... [2022-04-27 22:38:44,277 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll.cqvasr [2022-04-27 22:38:44,288 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:38:44,288 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:38:44,324 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:38:44,330 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7bff62f6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3de496cc [2022-04-27 22:38:44,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:38:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 22:38:44,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 22:38:44,342 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:38:44,342 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:38:44,342 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:38:44,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:38:44,347 INFO L85 PathProgramCache]: Analyzing trace with hash 589677296, now seen corresponding path program 1 times [2022-04-27 22:38:44,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:38:44,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833302667] [2022-04-27 22:38:44,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:44,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:38:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:44,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:38:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:44,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] 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] {37#true} is VALID [2022-04-27 22:38:44,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-27 22:38:44,484 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-27 22:38:44,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 22:38:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:44,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [92] 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] {37#true} is VALID [2022-04-27 22:38:44,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [94] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 22:38:44,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 22:38:44,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {38#false} is VALID [2022-04-27 22:38:44,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 22:38:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:44,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [92] 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] {37#true} is VALID [2022-04-27 22:38:44,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [94] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 22:38:44,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 22:38:44,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {38#false} is VALID [2022-04-27 22:38:44,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:38:44,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] 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] {37#true} is VALID [2022-04-27 22:38:44,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-27 22:38:44,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-27 22:38:44,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-27 22:38:44,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_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|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, 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] {37#true} is VALID [2022-04-27 22:38:44,506 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {37#true} is VALID [2022-04-27 22:38:44,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} [92] 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] {37#true} is VALID [2022-04-27 22:38:44,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} [94] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 22:38:44,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 22:38:44,507 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {38#false} is VALID [2022-04-27 22:38:44,508 INFO L272 TraceCheckUtils]: 11: Hoare triple {38#false} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {37#true} is VALID [2022-04-27 22:38:44,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#true} [92] 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] {37#true} is VALID [2022-04-27 22:38:44,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} [94] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 22:38:44,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#false} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 22:38:44,509 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38#false} {38#false} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {38#false} is VALID [2022-04-27 22:38:44,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#false} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, 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_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {38#false} is VALID [2022-04-27 22:38:44,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {38#false} [96] L41-2-->L33-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 22:38:44,510 INFO L272 TraceCheckUtils]: 18: Hoare triple {38#false} [100] L33-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] {38#false} is VALID [2022-04-27 22:38:44,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {38#false} [103] __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] {38#false} is VALID [2022-04-27 22:38:44,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} [106] 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[] {38#false} is VALID [2022-04-27 22:38:44,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {38#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-27 22:38:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 22:38:44,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:38:44,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833302667] [2022-04-27 22:38:44,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833302667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:38:44,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:38:44,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:38:44,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290936710] [2022-04-27 22:38:44,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:38:44,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 22:38:44,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:38:44,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:38:44,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:44,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:38:44,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:38:44,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:38:44,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:38:44,568 INFO L87 Difference]: Start difference. First operand has 34 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:38:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:44,718 INFO L93 Difference]: Finished difference Result 61 states and 93 transitions. [2022-04-27 22:38:44,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:38:44,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 22:38:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:38:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:38:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-04-27 22:38:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:38:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-04-27 22:38:44,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2022-04-27 22:38:44,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:44,864 INFO L225 Difference]: With dead ends: 61 [2022-04-27 22:38:44,864 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 22:38:44,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:38:44,870 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:38:44,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 36 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:38:44,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 22:38:44,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 22:38:44,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:38:44,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 22:38:44,913 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 22:38:44,913 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 22:38:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:44,918 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-27 22:38:44,918 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-27 22:38:44,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:44,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:44,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 29 states. [2022-04-27 22:38:44,920 INFO L87 Difference]: Start difference. First operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 29 states. [2022-04-27 22:38:44,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:44,924 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-27 22:38:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-27 22:38:44,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:44,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:44,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:38:44,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:38:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 22:38:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-04-27 22:38:44,930 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 22 [2022-04-27 22:38:44,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:38:44,931 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-04-27 22:38:44,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 22:38:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-27 22:38:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 22:38:44,932 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:38:44,932 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:38:44,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 22:38:44,933 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:38:44,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:38:44,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1721458959, now seen corresponding path program 1 times [2022-04-27 22:38:44,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:38:44,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766551183] [2022-04-27 22:38:44,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:44,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:38:44,964 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:38:44,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [231142702] [2022-04-27 22:38:44,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:44,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:38:44,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:38:44,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:38:44,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 22:38:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:45,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 22:38:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:45,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:38:46,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {244#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:38:46,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#true} [86] 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] {244#true} is VALID [2022-04-27 22:38:46,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:38:46,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {244#true} {244#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:38:46,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {244#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:38:46,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_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|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, 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] {244#true} is VALID [2022-04-27 22:38:46,145 INFO L272 TraceCheckUtils]: 6: Hoare triple {244#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {244#true} is VALID [2022-04-27 22:38:46,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {244#true} [92] 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] {244#true} is VALID [2022-04-27 22:38:46,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#true} [95] 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[] {244#true} is VALID [2022-04-27 22:38:46,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {244#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:38:46,146 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {244#true} {244#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {244#true} is VALID [2022-04-27 22:38:46,146 INFO L272 TraceCheckUtils]: 11: Hoare triple {244#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {244#true} is VALID [2022-04-27 22:38:46,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {244#true} [92] 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] {244#true} is VALID [2022-04-27 22:38:46,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {244#true} [95] 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[] {244#true} is VALID [2022-04-27 22:38:46,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {244#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#true} is VALID [2022-04-27 22:38:46,147 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {244#true} {244#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {244#true} is VALID [2022-04-27 22:38:46,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {244#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, 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_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {297#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 22:38:46,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {297#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {297#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 22:38:46,153 INFO L272 TraceCheckUtils]: 18: Hoare triple {297#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [101] L34-->__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] {304#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:38:46,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {304#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {308#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:38:46,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {245#false} is VALID [2022-04-27 22:38:46,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {245#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#false} is VALID [2022-04-27 22:38:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 22:38:46,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 22:38:46,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:38:46,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766551183] [2022-04-27 22:38:46,155 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:38:46,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231142702] [2022-04-27 22:38:46,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231142702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:38:46,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:38:46,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 22:38:46,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696572617] [2022-04-27 22:38:46,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:38:46,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 22:38:46,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:38:46,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:38:46,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:46,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 22:38:46,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:38:46,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 22:38:46,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 22:38:46,176 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:38:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:46,370 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 22:38:46,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 22:38:46,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 22:38:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:38:46,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:38:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-27 22:38:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:38:46,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-27 22:38:46,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-27 22:38:46,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:46,440 INFO L225 Difference]: With dead ends: 45 [2022-04-27 22:38:46,440 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 22:38:46,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 22:38:46,441 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 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-27 22:38:46,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:38:46,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 22:38:46,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-04-27 22:38:46,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:38:46,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 22:38:46,451 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 22:38:46,451 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 22:38:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:46,454 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-04-27 22:38:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-04-27 22:38:46,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:46,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:46,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 43 states. [2022-04-27 22:38:46,456 INFO L87 Difference]: Start difference. First operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 43 states. [2022-04-27 22:38:46,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:46,459 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-04-27 22:38:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-04-27 22:38:46,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:46,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:46,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:38:46,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:38:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 22:38:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2022-04-27 22:38:46,465 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 22 [2022-04-27 22:38:46,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:38:46,465 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2022-04-27 22:38:46,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 22:38:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2022-04-27 22:38:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 22:38:46,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:38:46,466 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:38:46,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 22:38:46,691 WARN L477 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-27 22:38:46,692 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:38:46,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:38:46,693 INFO L85 PathProgramCache]: Analyzing trace with hash 491128363, now seen corresponding path program 1 times [2022-04-27 22:38:46,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:38:46,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705702642] [2022-04-27 22:38:46,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:46,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:38:46,708 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:38:46,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [702805971] [2022-04-27 22:38:46,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:46,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:38:46,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:38:46,712 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:38:46,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 22:38:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:46,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 22:38:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:46,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:38:46,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {538#true} is VALID [2022-04-27 22:38:46,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} [86] 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] {538#true} is VALID [2022-04-27 22:38:46,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {538#true} is VALID [2022-04-27 22:38:46,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {538#true} is VALID [2022-04-27 22:38:46,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {538#true} is VALID [2022-04-27 22:38:46,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_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|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, 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] {538#true} is VALID [2022-04-27 22:38:46,946 INFO L272 TraceCheckUtils]: 6: Hoare triple {538#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {538#true} is VALID [2022-04-27 22:38:46,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#true} [92] 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] {538#true} is VALID [2022-04-27 22:38:46,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#true} [95] 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[] {538#true} is VALID [2022-04-27 22:38:46,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {538#true} is VALID [2022-04-27 22:38:46,947 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {538#true} {538#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {538#true} is VALID [2022-04-27 22:38:46,947 INFO L272 TraceCheckUtils]: 11: Hoare triple {538#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {538#true} is VALID [2022-04-27 22:38:46,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {538#true} [92] 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] {579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 22:38:46,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [95] 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[] {583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 22:38:46,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {583#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 22:38:46,949 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {583#(not (= |assume_abort_if_not_#in~cond| 0))} {538#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {590#(<= 1 main_~y~0)} is VALID [2022-04-27 22:38:46,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {590#(<= 1 main_~y~0)} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, 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_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 22:38:46,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 22:38:46,951 INFO L272 TraceCheckUtils]: 18: Hoare triple {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [101] L34-->__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] {538#true} is VALID [2022-04-27 22:38:46,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {538#true} [103] __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] {538#true} is VALID [2022-04-27 22:38:46,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {538#true} [107] 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[] {538#true} is VALID [2022-04-27 22:38:46,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {538#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {538#true} is VALID [2022-04-27 22:38:46,953 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {538#true} {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [122] __VERIFIER_assertEXIT-->L34-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] {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 22:38:46,954 INFO L272 TraceCheckUtils]: 23: Hoare triple {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {616#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:38:46,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {616#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {620#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:38:46,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {620#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {539#false} is VALID [2022-04-27 22:38:46,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {539#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#false} is VALID [2022-04-27 22:38:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 22:38:46,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 22:38:46,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:38:46,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705702642] [2022-04-27 22:38:46,956 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:38:46,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702805971] [2022-04-27 22:38:46,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702805971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:38:46,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:38:46,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 22:38:46,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886143001] [2022-04-27 22:38:46,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:38:46,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 22:38:46,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:38:46,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 22:38:46,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:46,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 22:38:46,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:38:46,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 22:38:46,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 22:38:46,984 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 22:38:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:47,393 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2022-04-27 22:38:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 22:38:47,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 22:38:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:38:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 22:38:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-27 22:38:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 22:38:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-27 22:38:47,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-04-27 22:38:47,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:47,463 INFO L225 Difference]: With dead ends: 49 [2022-04-27 22:38:47,463 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 22:38:47,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 22:38:47,464 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 22:38:47,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 148 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 22:38:47,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 22:38:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-27 22:38:47,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:38:47,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 22:38:47,493 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 22:38:47,494 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 22:38:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:47,499 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-27 22:38:47,499 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-04-27 22:38:47,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:47,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:47,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-27 22:38:47,501 INFO L87 Difference]: Start difference. First operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-27 22:38:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:47,504 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-27 22:38:47,504 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-04-27 22:38:47,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:47,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:47,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:38:47,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:38:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 22:38:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-27 22:38:47,508 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 27 [2022-04-27 22:38:47,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:38:47,509 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-04-27 22:38:47,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 22:38:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-04-27 22:38:47,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 22:38:47,510 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:38:47,510 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:38:47,534 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-27 22:38:47,727 WARN L477 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-27 22:38:47,728 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:38:47,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:38:47,728 INFO L85 PathProgramCache]: Analyzing trace with hash 70646830, now seen corresponding path program 1 times [2022-04-27 22:38:47,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:38:47,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809988271] [2022-04-27 22:38:47,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:47,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:38:47,745 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:38:47,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1223368060] [2022-04-27 22:38:47,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:47,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:38:47,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:38:47,746 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:38:47,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 22:38:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:47,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 22:38:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:47,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:38:48,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {870#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870#true} is VALID [2022-04-27 22:38:48,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {870#true} [86] 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] {870#true} is VALID [2022-04-27 22:38:48,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {870#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870#true} is VALID [2022-04-27 22:38:48,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {870#true} {870#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870#true} is VALID [2022-04-27 22:38:48,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {870#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870#true} is VALID [2022-04-27 22:38:48,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {870#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_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|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, 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] {870#true} is VALID [2022-04-27 22:38:48,012 INFO L272 TraceCheckUtils]: 6: Hoare triple {870#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {870#true} is VALID [2022-04-27 22:38:48,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {870#true} [92] 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] {896#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 22:38:48,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {896#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [95] 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[] {900#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 22:38:48,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {900#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 22:38:48,015 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#(not (= |assume_abort_if_not_#in~cond| 0))} {870#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {907#(<= 1 main_~x~0)} is VALID [2022-04-27 22:38:48,015 INFO L272 TraceCheckUtils]: 11: Hoare triple {907#(<= 1 main_~x~0)} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {870#true} is VALID [2022-04-27 22:38:48,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {870#true} [92] 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] {870#true} is VALID [2022-04-27 22:38:48,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {870#true} [95] 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[] {870#true} is VALID [2022-04-27 22:38:48,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {870#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870#true} is VALID [2022-04-27 22:38:48,016 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {870#true} {907#(<= 1 main_~x~0)} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {907#(<= 1 main_~x~0)} is VALID [2022-04-27 22:38:48,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {907#(<= 1 main_~x~0)} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, 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_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 22:38:48,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 22:38:48,017 INFO L272 TraceCheckUtils]: 18: Hoare triple {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [101] L34-->__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] {870#true} is VALID [2022-04-27 22:38:48,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {870#true} [103] __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] {870#true} is VALID [2022-04-27 22:38:48,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {870#true} [107] 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[] {870#true} is VALID [2022-04-27 22:38:48,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {870#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870#true} is VALID [2022-04-27 22:38:48,021 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {870#true} {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [122] __VERIFIER_assertEXIT-->L34-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] {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 22:38:48,021 INFO L272 TraceCheckUtils]: 23: Hoare triple {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {870#true} is VALID [2022-04-27 22:38:48,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {870#true} [103] __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] {870#true} is VALID [2022-04-27 22:38:48,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {870#true} [107] 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[] {870#true} is VALID [2022-04-27 22:38:48,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {870#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870#true} is VALID [2022-04-27 22:38:48,023 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {870#true} {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 22:38:48,023 INFO L272 TraceCheckUtils]: 28: Hoare triple {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {963#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:38:48,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {963#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:38:48,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {967#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {871#false} is VALID [2022-04-27 22:38:48,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {871#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {871#false} is VALID [2022-04-27 22:38:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 22:38:48,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:38:48,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {871#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {871#false} is VALID [2022-04-27 22:38:48,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {967#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {871#false} is VALID [2022-04-27 22:38:48,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {963#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:38:48,230 INFO L272 TraceCheckUtils]: 28: Hoare triple {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {963#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:38:48,231 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {870#true} {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 22:38:48,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {870#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870#true} is VALID [2022-04-27 22:38:48,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {870#true} [107] 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[] {870#true} is VALID [2022-04-27 22:38:48,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {870#true} [103] __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] {870#true} is VALID [2022-04-27 22:38:48,232 INFO L272 TraceCheckUtils]: 23: Hoare triple {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {870#true} is VALID [2022-04-27 22:38:48,233 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {870#true} {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [122] __VERIFIER_assertEXIT-->L34-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] {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 22:38:48,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {870#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870#true} is VALID [2022-04-27 22:38:48,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {870#true} [107] 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[] {870#true} is VALID [2022-04-27 22:38:48,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {870#true} [103] __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] {870#true} is VALID [2022-04-27 22:38:48,233 INFO L272 TraceCheckUtils]: 18: Hoare triple {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [101] L34-->__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] {870#true} is VALID [2022-04-27 22:38:48,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 22:38:48,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {870#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, 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_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 22:38:48,235 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {870#true} {870#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {870#true} is VALID [2022-04-27 22:38:48,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {870#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870#true} is VALID [2022-04-27 22:38:48,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {870#true} [95] 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[] {870#true} is VALID [2022-04-27 22:38:48,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {870#true} [92] 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] {870#true} is VALID [2022-04-27 22:38:48,235 INFO L272 TraceCheckUtils]: 11: Hoare triple {870#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {870#true} is VALID [2022-04-27 22:38:48,235 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {870#true} {870#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {870#true} is VALID [2022-04-27 22:38:48,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {870#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870#true} is VALID [2022-04-27 22:38:48,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {870#true} [95] 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[] {870#true} is VALID [2022-04-27 22:38:48,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {870#true} [92] 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] {870#true} is VALID [2022-04-27 22:38:48,236 INFO L272 TraceCheckUtils]: 6: Hoare triple {870#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {870#true} is VALID [2022-04-27 22:38:48,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {870#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_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|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, 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] {870#true} is VALID [2022-04-27 22:38:48,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {870#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870#true} is VALID [2022-04-27 22:38:48,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {870#true} {870#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870#true} is VALID [2022-04-27 22:38:48,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {870#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870#true} is VALID [2022-04-27 22:38:48,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {870#true} [86] 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] {870#true} is VALID [2022-04-27 22:38:48,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {870#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {870#true} is VALID [2022-04-27 22:38:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 22:38:48,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:38:48,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809988271] [2022-04-27 22:38:48,237 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:38:48,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223368060] [2022-04-27 22:38:48,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223368060] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:38:48,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 22:38:48,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 22:38:48,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401672796] [2022-04-27 22:38:48,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:38:48,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 22:38:48,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:38:48,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 22:38:48,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:48,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 22:38:48,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:38:48,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 22:38:48,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 22:38:48,260 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 22:38:48,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:48,489 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2022-04-27 22:38:48,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 22:38:48,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 22:38:48,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:38:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 22:38:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-27 22:38:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 22:38:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-27 22:38:48,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-27 22:38:48,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:48,552 INFO L225 Difference]: With dead ends: 71 [2022-04-27 22:38:48,552 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 22:38:48,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 22:38:48,553 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:38:48,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 120 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:38:48,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 22:38:48,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-27 22:38:48,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:38:48,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 22:38:48,590 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 22:38:48,591 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 22:38:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:48,596 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-04-27 22:38:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-27 22:38:48,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:48,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:48,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 67 states. [2022-04-27 22:38:48,603 INFO L87 Difference]: Start difference. First operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 67 states. [2022-04-27 22:38:48,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:48,608 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-04-27 22:38:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-27 22:38:48,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:48,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:48,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:38:48,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:38:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 22:38:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2022-04-27 22:38:48,614 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 32 [2022-04-27 22:38:48,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:38:48,614 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2022-04-27 22:38:48,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 22:38:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-27 22:38:48,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 22:38:48,615 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:38:48,615 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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] [2022-04-27 22:38:48,640 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-27 22:38:48,828 WARN L477 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-27 22:38:48,829 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:38:48,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:38:48,829 INFO L85 PathProgramCache]: Analyzing trace with hash 399873803, now seen corresponding path program 1 times [2022-04-27 22:38:48,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:38:48,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732337852] [2022-04-27 22:38:48,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:48,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:38:48,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:38:48,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1026574501] [2022-04-27 22:38:48,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:48,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:38:48,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:38:48,846 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:38:48,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 22:38:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:48,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 22:38:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:48,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:38:49,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {1424#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1424#true} is VALID [2022-04-27 22:38:49,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {1424#true} [86] 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] {1424#true} is VALID [2022-04-27 22:38:49,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {1424#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1424#true} is VALID [2022-04-27 22:38:49,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1424#true} {1424#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1424#true} is VALID [2022-04-27 22:38:49,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {1424#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1424#true} is VALID [2022-04-27 22:38:49,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {1424#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_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|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, 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] {1424#true} is VALID [2022-04-27 22:38:49,029 INFO L272 TraceCheckUtils]: 6: Hoare triple {1424#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {1424#true} is VALID [2022-04-27 22:38:49,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {1424#true} [92] 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] {1424#true} is VALID [2022-04-27 22:38:49,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {1424#true} [95] 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[] {1424#true} is VALID [2022-04-27 22:38:49,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {1424#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1424#true} is VALID [2022-04-27 22:38:49,030 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1424#true} {1424#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {1424#true} is VALID [2022-04-27 22:38:49,030 INFO L272 TraceCheckUtils]: 11: Hoare triple {1424#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {1424#true} is VALID [2022-04-27 22:38:49,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {1424#true} [92] 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] {1424#true} is VALID [2022-04-27 22:38:49,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {1424#true} [95] 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[] {1424#true} is VALID [2022-04-27 22:38:49,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {1424#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1424#true} is VALID [2022-04-27 22:38:49,031 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1424#true} {1424#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {1424#true} is VALID [2022-04-27 22:38:49,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {1424#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, 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_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1424#true} is VALID [2022-04-27 22:38:49,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {1424#true} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1424#true} is VALID [2022-04-27 22:38:49,031 INFO L272 TraceCheckUtils]: 18: Hoare triple {1424#true} [101] L34-->__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] {1424#true} is VALID [2022-04-27 22:38:49,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {1424#true} [103] __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] {1424#true} is VALID [2022-04-27 22:38:49,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {1424#true} [107] 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[] {1424#true} is VALID [2022-04-27 22:38:49,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {1424#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1424#true} is VALID [2022-04-27 22:38:49,032 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1424#true} {1424#true} [122] __VERIFIER_assertEXIT-->L34-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] {1424#true} is VALID [2022-04-27 22:38:49,033 INFO L272 TraceCheckUtils]: 23: Hoare triple {1424#true} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {1424#true} is VALID [2022-04-27 22:38:49,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {1424#true} [103] __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] {1424#true} is VALID [2022-04-27 22:38:49,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {1424#true} [107] 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[] {1424#true} is VALID [2022-04-27 22:38:49,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {1424#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1424#true} is VALID [2022-04-27 22:38:49,033 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1424#true} {1424#true} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {1424#true} is VALID [2022-04-27 22:38:49,034 INFO L272 TraceCheckUtils]: 28: Hoare triple {1424#true} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {1424#true} is VALID [2022-04-27 22:38:49,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {1424#true} [103] __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] {1424#true} is VALID [2022-04-27 22:38:49,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {1424#true} [107] 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[] {1424#true} is VALID [2022-04-27 22:38:49,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {1424#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1424#true} is VALID [2022-04-27 22:38:49,034 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1424#true} {1424#true} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {1424#true} is VALID [2022-04-27 22:38:49,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {1424#true} [113] L36-->L33-2: Formula: (= v_main_~a~0_8 v_main_~b~0_10) InVars {main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {1528#(= main_~b~0 main_~a~0)} is VALID [2022-04-27 22:38:49,035 INFO L272 TraceCheckUtils]: 34: Hoare triple {1528#(= main_~b~0 main_~a~0)} [100] L33-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] {1532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:38:49,036 INFO L290 TraceCheckUtils]: 35: Hoare triple {1532#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {1536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:38:49,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {1536#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {1425#false} is VALID [2022-04-27 22:38:49,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {1425#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1425#false} is VALID [2022-04-27 22:38:49,037 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 22:38:49,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 22:38:49,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:38:49,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732337852] [2022-04-27 22:38:49,037 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:38:49,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026574501] [2022-04-27 22:38:49,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026574501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:38:49,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:38:49,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 22:38:49,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821330101] [2022-04-27 22:38:49,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:38:49,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2022-04-27 22:38:49,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:38:49,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 22:38:49,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:49,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 22:38:49,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:38:49,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 22:38:49,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 22:38:49,061 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 22:38:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:49,233 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2022-04-27 22:38:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 22:38:49,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2022-04-27 22:38:49,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:38:49,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 22:38:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-27 22:38:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 22:38:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-27 22:38:49,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-04-27 22:38:49,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:49,279 INFO L225 Difference]: With dead ends: 73 [2022-04-27 22:38:49,279 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 22:38:49,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 22:38:49,281 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 119 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-27 22:38:49,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 119 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:38:49,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 22:38:49,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-27 22:38:49,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:38:49,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 22:38:49,323 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 22:38:49,324 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 22:38:49,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:49,329 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2022-04-27 22:38:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-04-27 22:38:49,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:49,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:49,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 22:38:49,330 INFO L87 Difference]: Start difference. First operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 22:38:49,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:49,333 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2022-04-27 22:38:49,333 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-04-27 22:38:49,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:49,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:49,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:38:49,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:38:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 22:38:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2022-04-27 22:38:49,339 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 96 transitions. Word has length 38 [2022-04-27 22:38:49,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:38:49,340 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 96 transitions. [2022-04-27 22:38:49,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 22:38:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-04-27 22:38:49,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 22:38:49,342 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:38:49,342 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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-27 22:38:49,366 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-27 22:38:49,563 WARN L477 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-27 22:38:49,564 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:38:49,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:38:49,564 INFO L85 PathProgramCache]: Analyzing trace with hash -927531751, now seen corresponding path program 1 times [2022-04-27 22:38:49,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:38:49,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787370748] [2022-04-27 22:38:49,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:49,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:38:49,583 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:38:49,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [587976233] [2022-04-27 22:38:49,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:49,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:38:49,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:38:49,591 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:38:49,592 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-27 22:38:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:49,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 22:38:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:49,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:38:52,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {1910#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1910#true} is VALID [2022-04-27 22:38:52,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {1910#true} [86] 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] {1910#true} is VALID [2022-04-27 22:38:52,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {1910#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1910#true} is VALID [2022-04-27 22:38:52,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1910#true} {1910#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1910#true} is VALID [2022-04-27 22:38:52,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {1910#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1910#true} is VALID [2022-04-27 22:38:52,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {1910#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_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|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, 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] {1910#true} is VALID [2022-04-27 22:38:52,395 INFO L272 TraceCheckUtils]: 6: Hoare triple {1910#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {1910#true} is VALID [2022-04-27 22:38:52,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {1910#true} [92] 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] {1910#true} is VALID [2022-04-27 22:38:52,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {1910#true} [95] 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[] {1910#true} is VALID [2022-04-27 22:38:52,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {1910#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1910#true} is VALID [2022-04-27 22:38:52,395 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1910#true} {1910#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {1910#true} is VALID [2022-04-27 22:38:52,395 INFO L272 TraceCheckUtils]: 11: Hoare triple {1910#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {1910#true} is VALID [2022-04-27 22:38:52,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {1910#true} [92] 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] {1910#true} is VALID [2022-04-27 22:38:52,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {1910#true} [95] 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[] {1910#true} is VALID [2022-04-27 22:38:52,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {1910#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1910#true} is VALID [2022-04-27 22:38:52,396 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1910#true} {1910#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {1910#true} is VALID [2022-04-27 22:38:52,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {1910#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, 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_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 22:38:52,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 22:38:52,407 INFO L272 TraceCheckUtils]: 18: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [101] L34-->__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] {1910#true} is VALID [2022-04-27 22:38:52,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {1910#true} [103] __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] {1910#true} is VALID [2022-04-27 22:38:52,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {1910#true} [107] 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[] {1910#true} is VALID [2022-04-27 22:38:52,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {1910#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1910#true} is VALID [2022-04-27 22:38:52,408 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1910#true} {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [122] __VERIFIER_assertEXIT-->L34-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] {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 22:38:52,409 INFO L272 TraceCheckUtils]: 23: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {1910#true} is VALID [2022-04-27 22:38:52,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {1910#true} [103] __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] {1910#true} is VALID [2022-04-27 22:38:52,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {1910#true} [107] 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[] {1910#true} is VALID [2022-04-27 22:38:52,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {1910#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1910#true} is VALID [2022-04-27 22:38:52,410 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1910#true} {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 22:38:52,410 INFO L272 TraceCheckUtils]: 28: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {1910#true} is VALID [2022-04-27 22:38:52,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {1910#true} [103] __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] {1910#true} is VALID [2022-04-27 22:38:52,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {1910#true} [107] 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[] {1910#true} is VALID [2022-04-27 22:38:52,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {1910#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1910#true} is VALID [2022-04-27 22:38:52,411 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1910#true} {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 22:38:52,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [114] L36-->L41: Formula: (not (= 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[] {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 22:38:52,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [116] L41-->L41-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~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_1, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, 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_1} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 22:38:52,413 INFO L290 TraceCheckUtils]: 35: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 22:38:52,413 INFO L272 TraceCheckUtils]: 36: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [101] L34-->__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] {2024#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:38:52,414 INFO L290 TraceCheckUtils]: 37: Hoare triple {2024#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {2028#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:38:52,414 INFO L290 TraceCheckUtils]: 38: Hoare triple {2028#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {1911#false} is VALID [2022-04-27 22:38:52,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {1911#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1911#false} is VALID [2022-04-27 22:38:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 22:38:52,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 22:38:52,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:38:52,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787370748] [2022-04-27 22:38:52,415 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:38:52,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587976233] [2022-04-27 22:38:52,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587976233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:38:52,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:38:52,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 22:38:52,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998520448] [2022-04-27 22:38:52,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:38:52,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2022-04-27 22:38:52,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:38:52,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 22:38:52,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:52,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 22:38:52,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:38:52,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 22:38:52,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 22:38:52,459 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 22:38:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:52,638 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2022-04-27 22:38:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 22:38:52,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2022-04-27 22:38:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:38:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 22:38:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-27 22:38:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 22:38:52,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-27 22:38:52,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-04-27 22:38:52,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:38:52,696 INFO L225 Difference]: With dead ends: 81 [2022-04-27 22:38:52,696 INFO L226 Difference]: Without dead ends: 78 [2022-04-27 22:38:52,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-27 22:38:52,697 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:38:52,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 124 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:38:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-27 22:38:52,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-04-27 22:38:52,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:38:52,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 22:38:52,726 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 22:38:52,726 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 22:38:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:52,730 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-04-27 22:38:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2022-04-27 22:38:52,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:52,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:52,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 78 states. [2022-04-27 22:38:52,731 INFO L87 Difference]: Start difference. First operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 78 states. [2022-04-27 22:38:52,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:38:52,735 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-04-27 22:38:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2022-04-27 22:38:52,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:38:52,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:38:52,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:38:52,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:38:52,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 22:38:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2022-04-27 22:38:52,740 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 40 [2022-04-27 22:38:52,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:38:52,741 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2022-04-27 22:38:52,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 22:38:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-04-27 22:38:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 22:38:52,742 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:38:52,742 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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, 1] [2022-04-27 22:38:52,772 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-27 22:38:52,955 WARN L477 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-27 22:38:52,955 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:38:52,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:38:52,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2093519850, now seen corresponding path program 1 times [2022-04-27 22:38:52,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:38:52,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607461966] [2022-04-27 22:38:52,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:52,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:38:52,971 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:38:52,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1990730217] [2022-04-27 22:38:52,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:38:52,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:38:52,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:38:52,973 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-27 22:38:52,976 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-27 22:38:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:53,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 22:38:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:38:53,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:38:53,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {2430#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:38:53,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {2430#true} [86] 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] {2430#true} is VALID [2022-04-27 22:38:53,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {2430#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:38:53,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2430#true} {2430#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:38:53,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {2430#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:38:53,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {2430#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_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|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, 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] {2430#true} is VALID [2022-04-27 22:38:53,182 INFO L272 TraceCheckUtils]: 6: Hoare triple {2430#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {2430#true} is VALID [2022-04-27 22:38:53,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {2430#true} [92] 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] {2430#true} is VALID [2022-04-27 22:38:53,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {2430#true} [95] 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[] {2430#true} is VALID [2022-04-27 22:38:53,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {2430#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:38:53,182 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2430#true} {2430#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {2430#true} is VALID [2022-04-27 22:38:53,183 INFO L272 TraceCheckUtils]: 11: Hoare triple {2430#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {2430#true} is VALID [2022-04-27 22:38:53,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {2430#true} [92] 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] {2430#true} is VALID [2022-04-27 22:38:53,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {2430#true} [95] 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[] {2430#true} is VALID [2022-04-27 22:38:53,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {2430#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:38:53,183 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2430#true} {2430#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {2430#true} is VALID [2022-04-27 22:38:53,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {2430#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, 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_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2430#true} is VALID [2022-04-27 22:38:53,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {2430#true} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:38:53,183 INFO L272 TraceCheckUtils]: 18: Hoare triple {2430#true} [101] L34-->__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] {2430#true} is VALID [2022-04-27 22:38:53,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {2430#true} [103] __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] {2430#true} is VALID [2022-04-27 22:38:53,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {2430#true} [107] 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[] {2430#true} is VALID [2022-04-27 22:38:53,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {2430#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:38:53,184 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2430#true} {2430#true} [122] __VERIFIER_assertEXIT-->L34-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] {2430#true} is VALID [2022-04-27 22:38:53,184 INFO L272 TraceCheckUtils]: 23: Hoare triple {2430#true} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {2430#true} is VALID [2022-04-27 22:38:53,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {2430#true} [103] __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] {2507#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:38:53,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {2507#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [107] 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[] {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:38:53,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:38:53,187 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} {2430#true} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 22:38:53,187 INFO L272 TraceCheckUtils]: 28: Hoare triple {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {2430#true} is VALID [2022-04-27 22:38:53,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {2430#true} [103] __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] {2430#true} is VALID [2022-04-27 22:38:53,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {2430#true} [107] 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[] {2430#true} is VALID [2022-04-27 22:38:53,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {2430#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:38:53,188 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2430#true} {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 22:38:53,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [113] L36-->L33-2: Formula: (= v_main_~a~0_8 v_main_~b~0_10) InVars {main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 22:38:53,189 INFO L272 TraceCheckUtils]: 34: Hoare triple {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [100] L33-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] {2430#true} is VALID [2022-04-27 22:38:53,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {2430#true} [103] __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] {2430#true} is VALID [2022-04-27 22:38:53,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {2430#true} [107] 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[] {2430#true} is VALID [2022-04-27 22:38:53,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {2430#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:38:53,190 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2430#true} {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [125] __VERIFIER_assertEXIT-->L52: 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] {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 22:38:53,191 INFO L272 TraceCheckUtils]: 39: Hoare triple {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [102] L52-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* (- 1) v_main_~b~0_14) (* v_main_~r~0_12 v_main_~y~0_13) (* v_main_~p~0_12 v_main_~x~0_13)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_13, 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] {2556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:38:53,191 INFO L290 TraceCheckUtils]: 40: Hoare triple {2556#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {2560#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:38:53,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {2560#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {2431#false} is VALID [2022-04-27 22:38:53,192 INFO L290 TraceCheckUtils]: 42: Hoare triple {2431#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2431#false} is VALID [2022-04-27 22:38:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 22:38:53,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:39:10,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {2431#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2431#false} is VALID [2022-04-27 22:39:10,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {2560#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {2431#false} is VALID [2022-04-27 22:39:10,478 INFO L290 TraceCheckUtils]: 40: Hoare triple {2556#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {2560#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:39:10,479 INFO L272 TraceCheckUtils]: 39: Hoare triple {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [102] L52-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* (- 1) v_main_~b~0_14) (* v_main_~r~0_12 v_main_~y~0_13) (* v_main_~p~0_12 v_main_~x~0_13)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_13, 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] {2556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:39:10,480 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2430#true} {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [125] __VERIFIER_assertEXIT-->L52: 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] {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 22:39:10,480 INFO L290 TraceCheckUtils]: 37: Hoare triple {2430#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:39:10,480 INFO L290 TraceCheckUtils]: 36: Hoare triple {2430#true} [107] 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[] {2430#true} is VALID [2022-04-27 22:39:10,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {2430#true} [103] __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] {2430#true} is VALID [2022-04-27 22:39:10,480 INFO L272 TraceCheckUtils]: 34: Hoare triple {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [100] L33-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] {2430#true} is VALID [2022-04-27 22:39:10,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [113] L36-->L33-2: Formula: (= v_main_~a~0_8 v_main_~b~0_10) InVars {main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 22:39:10,481 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2430#true} {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 22:39:10,481 INFO L290 TraceCheckUtils]: 31: Hoare triple {2430#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:39:10,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {2430#true} [107] 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[] {2430#true} is VALID [2022-04-27 22:39:10,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {2430#true} [103] __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] {2430#true} is VALID [2022-04-27 22:39:10,482 INFO L272 TraceCheckUtils]: 28: Hoare triple {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {2430#true} is VALID [2022-04-27 22:39:10,483 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} {2430#true} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 22:39:10,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:39:10,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {2621#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [107] 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[] {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:39:10,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {2430#true} [103] __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] {2621#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:39:10,484 INFO L272 TraceCheckUtils]: 23: Hoare triple {2430#true} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {2430#true} is VALID [2022-04-27 22:39:10,484 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2430#true} {2430#true} [122] __VERIFIER_assertEXIT-->L34-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] {2430#true} is VALID [2022-04-27 22:39:10,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {2430#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:39:10,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {2430#true} [107] 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[] {2430#true} is VALID [2022-04-27 22:39:10,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {2430#true} [103] __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] {2430#true} is VALID [2022-04-27 22:39:10,484 INFO L272 TraceCheckUtils]: 18: Hoare triple {2430#true} [101] L34-->__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] {2430#true} is VALID [2022-04-27 22:39:10,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {2430#true} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:39:10,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {2430#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, 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_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2430#true} is VALID [2022-04-27 22:39:10,484 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2430#true} {2430#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {2430#true} is VALID [2022-04-27 22:39:10,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {2430#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:39:10,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {2430#true} [95] 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[] {2430#true} is VALID [2022-04-27 22:39:10,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {2430#true} [92] 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] {2430#true} is VALID [2022-04-27 22:39:10,485 INFO L272 TraceCheckUtils]: 11: Hoare triple {2430#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {2430#true} is VALID [2022-04-27 22:39:10,485 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2430#true} {2430#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {2430#true} is VALID [2022-04-27 22:39:10,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {2430#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:39:10,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {2430#true} [95] 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[] {2430#true} is VALID [2022-04-27 22:39:10,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {2430#true} [92] 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] {2430#true} is VALID [2022-04-27 22:39:10,486 INFO L272 TraceCheckUtils]: 6: Hoare triple {2430#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {2430#true} is VALID [2022-04-27 22:39:10,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {2430#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_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|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, 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] {2430#true} is VALID [2022-04-27 22:39:10,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {2430#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:39:10,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2430#true} {2430#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:39:10,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {2430#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:39:10,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {2430#true} [86] 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] {2430#true} is VALID [2022-04-27 22:39:10,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {2430#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2430#true} is VALID [2022-04-27 22:39:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 22:39:10,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:39:10,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607461966] [2022-04-27 22:39:10,487 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:39:10,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990730217] [2022-04-27 22:39:10,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990730217] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 22:39:10,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:39:10,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-27 22:39:10,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425636766] [2022-04-27 22:39:10,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 22:39:10,489 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2022-04-27 22:39:10,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:39:10,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 22:39:10,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:39:10,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 22:39:10,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:39:10,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 22:39:10,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-27 22:39:10,517 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 22:39:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:39:10,864 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2022-04-27 22:39:10,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 22:39:10,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2022-04-27 22:39:10,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:39:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 22:39:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 22:39:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 22:39:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 22:39:10,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-27 22:39:10,919 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-27 22:39:10,921 INFO L225 Difference]: With dead ends: 85 [2022-04-27 22:39:10,921 INFO L226 Difference]: Without dead ends: 81 [2022-04-27 22:39:10,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 22:39:10,923 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 22:39:10,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 90 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 22:39:10,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-27 22:39:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-27 22:39:10,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:39:10,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 22:39:10,949 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 22:39:10,949 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 22:39:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:39:10,952 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-27 22:39:10,952 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-27 22:39:10,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:39:10,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:39:10,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 81 states. [2022-04-27 22:39:10,953 INFO L87 Difference]: Start difference. First operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 81 states. [2022-04-27 22:39:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:39:10,956 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-27 22:39:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-27 22:39:10,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:39:10,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:39:10,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:39:10,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:39:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 22:39:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2022-04-27 22:39:10,960 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 43 [2022-04-27 22:39:10,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:39:10,961 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2022-04-27 22:39:10,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 22:39:10,961 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-27 22:39:10,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 22:39:10,961 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:39:10,961 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:39:10,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-27 22:39:11,178 WARN L477 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-27 22:39:11,178 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:39:11,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:39:11,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1560297731, now seen corresponding path program 2 times [2022-04-27 22:39:11,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:39:11,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278786925] [2022-04-27 22:39:11,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:39:11,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:39:11,204 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:39:11,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [514786314] [2022-04-27 22:39:11,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 22:39:11,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:39:11,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:39:11,205 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-27 22:39:11,225 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-27 22:39:11,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 22:39:11,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 22:39:11,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 22:39:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:39:11,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:39:11,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {3114#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {3114#true} [86] 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] {3114#true} is VALID [2022-04-27 22:39:11,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {3114#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3114#true} {3114#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {3114#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {3114#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_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|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, 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] {3114#true} is VALID [2022-04-27 22:39:11,582 INFO L272 TraceCheckUtils]: 6: Hoare triple {3114#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {3114#true} is VALID [2022-04-27 22:39:11,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {3114#true} [92] 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] {3114#true} is VALID [2022-04-27 22:39:11,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {3114#true} [95] 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[] {3114#true} is VALID [2022-04-27 22:39:11,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {3114#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,582 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3114#true} {3114#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {3114#true} is VALID [2022-04-27 22:39:11,582 INFO L272 TraceCheckUtils]: 11: Hoare triple {3114#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {3114#true} is VALID [2022-04-27 22:39:11,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {3114#true} [92] 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] {3114#true} is VALID [2022-04-27 22:39:11,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {3114#true} [95] 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[] {3114#true} is VALID [2022-04-27 22:39:11,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {3114#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,583 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3114#true} {3114#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {3114#true} is VALID [2022-04-27 22:39:11,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {3114#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, 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_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3167#(and (= main_~r~0 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-27 22:39:11,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {3167#(and (= main_~r~0 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))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3167#(and (= main_~r~0 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-27 22:39:11,584 INFO L272 TraceCheckUtils]: 18: Hoare triple {3167#(and (= main_~r~0 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))} [101] L34-->__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] {3114#true} is VALID [2022-04-27 22:39:11,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {3114#true} [103] __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] {3114#true} is VALID [2022-04-27 22:39:11,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {3114#true} [107] 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[] {3114#true} is VALID [2022-04-27 22:39:11,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {3114#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,589 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3114#true} {3167#(and (= main_~r~0 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))} [122] __VERIFIER_assertEXIT-->L34-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] {3167#(and (= main_~r~0 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-27 22:39:11,589 INFO L272 TraceCheckUtils]: 23: Hoare triple {3167#(and (= main_~r~0 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))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {3114#true} is VALID [2022-04-27 22:39:11,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {3114#true} [103] __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] {3114#true} is VALID [2022-04-27 22:39:11,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {3114#true} [107] 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[] {3114#true} is VALID [2022-04-27 22:39:11,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {3114#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,590 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3114#true} {3167#(and (= main_~r~0 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))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {3167#(and (= main_~r~0 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-27 22:39:11,590 INFO L272 TraceCheckUtils]: 28: Hoare triple {3167#(and (= main_~r~0 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))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {3114#true} is VALID [2022-04-27 22:39:11,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {3114#true} [103] __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] {3114#true} is VALID [2022-04-27 22:39:11,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {3114#true} [107] 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[] {3114#true} is VALID [2022-04-27 22:39:11,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {3114#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,592 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3114#true} {3167#(and (= main_~r~0 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] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {3167#(and (= main_~r~0 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-27 22:39:11,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {3167#(and (= main_~r~0 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-->L41: Formula: (not (= 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[] {3167#(and (= main_~r~0 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-27 22:39:11,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {3167#(and (= main_~r~0 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))} [116] L41-->L41-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~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_1, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, 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_1} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-27 22:39:11,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-27 22:39:11,593 INFO L272 TraceCheckUtils]: 36: Hoare triple {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} [101] L34-->__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] {3114#true} is VALID [2022-04-27 22:39:11,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {3114#true} [103] __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] {3114#true} is VALID [2022-04-27 22:39:11,594 INFO L290 TraceCheckUtils]: 38: Hoare triple {3114#true} [107] 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[] {3114#true} is VALID [2022-04-27 22:39:11,594 INFO L290 TraceCheckUtils]: 39: Hoare triple {3114#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,594 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3114#true} {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} [122] __VERIFIER_assertEXIT-->L34-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] {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-27 22:39:11,595 INFO L272 TraceCheckUtils]: 41: Hoare triple {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {3244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:39:11,596 INFO L290 TraceCheckUtils]: 42: Hoare triple {3244#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {3248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:39:11,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {3248#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {3115#false} is VALID [2022-04-27 22:39:11,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {3115#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3115#false} is VALID [2022-04-27 22:39:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 22:39:11,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:39:11,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {3115#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3115#false} is VALID [2022-04-27 22:39:11,789 INFO L290 TraceCheckUtils]: 43: Hoare triple {3248#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {3115#false} is VALID [2022-04-27 22:39:11,790 INFO L290 TraceCheckUtils]: 42: Hoare triple {3244#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {3248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:39:11,791 INFO L272 TraceCheckUtils]: 41: Hoare triple {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {3244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:39:11,791 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3114#true} {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [122] __VERIFIER_assertEXIT-->L34-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] {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 22:39:11,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {3114#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {3114#true} [107] 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[] {3114#true} is VALID [2022-04-27 22:39:11,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {3114#true} [103] __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] {3114#true} is VALID [2022-04-27 22:39:11,792 INFO L272 TraceCheckUtils]: 36: Hoare triple {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [101] L34-->__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] {3114#true} is VALID [2022-04-27 22:39:11,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 22:39:11,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {3286#(= (+ 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)))))} [116] L41-->L41-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~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_1, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, 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_1} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 22:39:11,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {3286#(= (+ 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)))))} [114] L36-->L41: Formula: (not (= 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[] {3286#(= (+ 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)))))} is VALID [2022-04-27 22:39:11,971 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3114#true} {3286#(= (+ 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)))))} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {3286#(= (+ 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)))))} is VALID [2022-04-27 22:39:11,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {3114#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {3114#true} [107] 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[] {3114#true} is VALID [2022-04-27 22:39:11,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {3114#true} [103] __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] {3114#true} is VALID [2022-04-27 22:39:11,971 INFO L272 TraceCheckUtils]: 28: Hoare triple {3286#(= (+ 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)))))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {3114#true} is VALID [2022-04-27 22:39:11,972 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3114#true} {3286#(= (+ 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)))))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {3286#(= (+ 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)))))} is VALID [2022-04-27 22:39:11,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {3114#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {3114#true} [107] 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[] {3114#true} is VALID [2022-04-27 22:39:11,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {3114#true} [103] __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] {3114#true} is VALID [2022-04-27 22:39:11,972 INFO L272 TraceCheckUtils]: 23: Hoare triple {3286#(= (+ 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)))))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {3114#true} is VALID [2022-04-27 22:39:11,975 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3114#true} {3286#(= (+ 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)))))} [122] __VERIFIER_assertEXIT-->L34-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] {3286#(= (+ 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)))))} is VALID [2022-04-27 22:39:11,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {3114#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {3114#true} [107] 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[] {3114#true} is VALID [2022-04-27 22:39:11,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {3114#true} [103] __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] {3114#true} is VALID [2022-04-27 22:39:11,975 INFO L272 TraceCheckUtils]: 18: Hoare triple {3286#(= (+ 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)))))} [101] L34-->__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] {3114#true} is VALID [2022-04-27 22:39:11,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {3286#(= (+ 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)))))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3286#(= (+ 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)))))} is VALID [2022-04-27 22:39:11,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {3114#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, 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_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3286#(= (+ 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)))))} is VALID [2022-04-27 22:39:11,978 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3114#true} {3114#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {3114#true} is VALID [2022-04-27 22:39:11,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {3114#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {3114#true} [95] 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[] {3114#true} is VALID [2022-04-27 22:39:11,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {3114#true} [92] 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] {3114#true} is VALID [2022-04-27 22:39:11,978 INFO L272 TraceCheckUtils]: 11: Hoare triple {3114#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {3114#true} is VALID [2022-04-27 22:39:11,979 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3114#true} {3114#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {3114#true} is VALID [2022-04-27 22:39:11,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {3114#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {3114#true} [95] 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[] {3114#true} is VALID [2022-04-27 22:39:11,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {3114#true} [92] 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] {3114#true} is VALID [2022-04-27 22:39:11,979 INFO L272 TraceCheckUtils]: 6: Hoare triple {3114#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {3114#true} is VALID [2022-04-27 22:39:11,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {3114#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_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|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, 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] {3114#true} is VALID [2022-04-27 22:39:11,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {3114#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3114#true} {3114#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {3114#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {3114#true} [86] 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] {3114#true} is VALID [2022-04-27 22:39:11,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {3114#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3114#true} is VALID [2022-04-27 22:39:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 22:39:11,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:39:11,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278786925] [2022-04-27 22:39:11,980 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:39:11,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514786314] [2022-04-27 22:39:11,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514786314] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 22:39:11,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:39:11,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 22:39:11,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718533430] [2022-04-27 22:39:11,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 22:39:11,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 45 [2022-04-27 22:39:11,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:39:11,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 22:39:12,067 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-27 22:39:12,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 22:39:12,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:39:12,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 22:39:12,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 22:39:12,068 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 22:39:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:39:14,798 INFO L93 Difference]: Finished difference Result 107 states and 136 transitions. [2022-04-27 22:39:14,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 22:39:14,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 45 [2022-04-27 22:39:14,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:39:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 22:39:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-04-27 22:39:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 22:39:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-04-27 22:39:14,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 70 transitions. [2022-04-27 22:39:15,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:39:15,079 INFO L225 Difference]: With dead ends: 107 [2022-04-27 22:39:15,079 INFO L226 Difference]: Without dead ends: 100 [2022-04-27 22:39:15,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-27 22:39:15,080 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 22:39:15,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 147 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 22:39:15,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-27 22:39:15,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2022-04-27 22:39:15,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:39:15,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 22:39:15,110 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 22:39:15,110 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 22:39:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:39:15,114 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-27 22:39:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-27 22:39:15,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:39:15,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:39:15,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 100 states. [2022-04-27 22:39:15,115 INFO L87 Difference]: Start difference. First operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 100 states. [2022-04-27 22:39:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:39:15,119 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-27 22:39:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-27 22:39:15,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:39:15,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:39:15,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:39:15,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:39:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 22:39:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2022-04-27 22:39:15,122 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 45 [2022-04-27 22:39:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:39:15,122 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2022-04-27 22:39:15,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 22:39:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2022-04-27 22:39:15,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 22:39:15,123 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:39:15,123 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:39:15,150 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-27 22:39:15,337 WARN L477 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-27 22:39:15,338 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:39:15,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:39:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1002568160, now seen corresponding path program 1 times [2022-04-27 22:39:15,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:39:15,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149644045] [2022-04-27 22:39:15,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:39:15,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:39:15,349 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 22:39:15,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [779085774] [2022-04-27 22:39:15,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:39:15,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:39:15,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:39:15,350 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-27 22:39:15,375 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-27 22:39:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:39:15,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 22:39:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:39:15,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:39:15,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {3883#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:15,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {3883#true} [86] 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] {3883#true} is VALID [2022-04-27 22:39:15,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {3883#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:15,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3883#true} {3883#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:15,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {3883#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:15,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {3883#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_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|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, 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] {3883#true} is VALID [2022-04-27 22:39:15,771 INFO L272 TraceCheckUtils]: 6: Hoare triple {3883#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {3883#true} is VALID [2022-04-27 22:39:15,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {3883#true} [92] 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] {3883#true} is VALID [2022-04-27 22:39:15,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {3883#true} [95] 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[] {3883#true} is VALID [2022-04-27 22:39:15,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {3883#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:15,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3883#true} {3883#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {3883#true} is VALID [2022-04-27 22:39:15,771 INFO L272 TraceCheckUtils]: 11: Hoare triple {3883#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {3883#true} is VALID [2022-04-27 22:39:15,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {3883#true} [92] 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] {3883#true} is VALID [2022-04-27 22:39:15,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {3883#true} [95] 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[] {3883#true} is VALID [2022-04-27 22:39:15,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {3883#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:15,772 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3883#true} {3883#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {3883#true} is VALID [2022-04-27 22:39:15,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {3883#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, 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_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 22:39:15,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 22:39:15,775 INFO L272 TraceCheckUtils]: 18: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [101] L34-->__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] {3883#true} is VALID [2022-04-27 22:39:15,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {3883#true} [103] __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] {3883#true} is VALID [2022-04-27 22:39:15,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {3883#true} [107] 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[] {3883#true} is VALID [2022-04-27 22:39:15,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {3883#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:15,776 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3883#true} {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [122] __VERIFIER_assertEXIT-->L34-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] {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 22:39:15,776 INFO L272 TraceCheckUtils]: 23: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {3883#true} is VALID [2022-04-27 22:39:15,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {3883#true} [103] __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] {3883#true} is VALID [2022-04-27 22:39:15,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {3883#true} [107] 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[] {3883#true} is VALID [2022-04-27 22:39:15,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {3883#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:15,776 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3883#true} {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 22:39:15,777 INFO L272 TraceCheckUtils]: 28: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {3883#true} is VALID [2022-04-27 22:39:15,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {3883#true} [103] __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] {3883#true} is VALID [2022-04-27 22:39:15,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {3883#true} [107] 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[] {3883#true} is VALID [2022-04-27 22:39:15,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {3883#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:15,777 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3883#true} {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 22:39:15,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [114] L36-->L41: Formula: (not (= 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[] {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 22:39:15,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [116] L41-->L41-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~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_1, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, 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_1} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 22:39:15,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 22:39:15,779 INFO L272 TraceCheckUtils]: 36: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [101] L34-->__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] {3883#true} is VALID [2022-04-27 22:39:15,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {3883#true} [103] __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] {3883#true} is VALID [2022-04-27 22:39:15,780 INFO L290 TraceCheckUtils]: 38: Hoare triple {3883#true} [107] 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[] {3883#true} is VALID [2022-04-27 22:39:15,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {3883#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:15,780 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3883#true} {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [122] __VERIFIER_assertEXIT-->L34-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] {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 22:39:15,780 INFO L272 TraceCheckUtils]: 41: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {3883#true} is VALID [2022-04-27 22:39:15,780 INFO L290 TraceCheckUtils]: 42: Hoare triple {3883#true} [103] __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] {3883#true} is VALID [2022-04-27 22:39:15,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {3883#true} [107] 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[] {3883#true} is VALID [2022-04-27 22:39:15,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {3883#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:15,781 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3883#true} {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 22:39:15,781 INFO L272 TraceCheckUtils]: 46: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {3883#true} is VALID [2022-04-27 22:39:15,781 INFO L290 TraceCheckUtils]: 47: Hoare triple {3883#true} [103] __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] {3883#true} is VALID [2022-04-27 22:39:15,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {3883#true} [107] 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[] {3883#true} is VALID [2022-04-27 22:39:15,781 INFO L290 TraceCheckUtils]: 49: Hoare triple {3883#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:15,782 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3883#true} {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 22:39:15,782 INFO L290 TraceCheckUtils]: 51: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [114] L36-->L41: Formula: (not (= 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[] {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 22:39:15,783 INFO L290 TraceCheckUtils]: 52: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [117] L41-->L41-2: Formula: (and (not (< v_main_~b~0_3 v_main_~a~0_3)) (= v_main_~b~0_2 (+ (* (- 1) v_main_~a~0_3) v_main_~b~0_3)) (= (+ 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_3, 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_3} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_2, 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_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {4046#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-27 22:39:15,784 INFO L290 TraceCheckUtils]: 53: Hoare triple {4046#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4046#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-27 22:39:15,785 INFO L272 TraceCheckUtils]: 54: Hoare triple {4046#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} [101] L34-->__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] {4053#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:39:15,785 INFO L290 TraceCheckUtils]: 55: Hoare triple {4053#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {4057#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:39:15,786 INFO L290 TraceCheckUtils]: 56: Hoare triple {4057#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {3884#false} is VALID [2022-04-27 22:39:15,786 INFO L290 TraceCheckUtils]: 57: Hoare triple {3884#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3884#false} is VALID [2022-04-27 22:39:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-27 22:39:15,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:39:16,028 INFO L290 TraceCheckUtils]: 57: Hoare triple {3884#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3884#false} is VALID [2022-04-27 22:39:16,029 INFO L290 TraceCheckUtils]: 56: Hoare triple {4057#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {3884#false} is VALID [2022-04-27 22:39:16,029 INFO L290 TraceCheckUtils]: 55: Hoare triple {4053#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {4057#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:39:16,030 INFO L272 TraceCheckUtils]: 54: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [101] L34-->__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] {4053#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:39:16,030 INFO L290 TraceCheckUtils]: 53: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 22:39:16,033 INFO L290 TraceCheckUtils]: 52: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [117] L41-->L41-2: Formula: (and (not (< v_main_~b~0_3 v_main_~a~0_3)) (= v_main_~b~0_2 (+ (* (- 1) v_main_~a~0_3) v_main_~b~0_3)) (= (+ 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_3, 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_3} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_2, 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_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 22:39:16,033 INFO L290 TraceCheckUtils]: 51: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [114] L36-->L41: Formula: (not (= 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[] {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 22:39:16,034 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 22:39:16,034 INFO L290 TraceCheckUtils]: 49: Hoare triple {3883#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:16,034 INFO L290 TraceCheckUtils]: 48: Hoare triple {3883#true} [107] 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[] {3883#true} is VALID [2022-04-27 22:39:16,034 INFO L290 TraceCheckUtils]: 47: Hoare triple {3883#true} [103] __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] {3883#true} is VALID [2022-04-27 22:39:16,034 INFO L272 TraceCheckUtils]: 46: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {3883#true} is VALID [2022-04-27 22:39:16,035 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 22:39:16,035 INFO L290 TraceCheckUtils]: 44: Hoare triple {3883#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:16,035 INFO L290 TraceCheckUtils]: 43: Hoare triple {3883#true} [107] 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[] {3883#true} is VALID [2022-04-27 22:39:16,035 INFO L290 TraceCheckUtils]: 42: Hoare triple {3883#true} [103] __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] {3883#true} is VALID [2022-04-27 22:39:16,035 INFO L272 TraceCheckUtils]: 41: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {3883#true} is VALID [2022-04-27 22:39:16,036 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [122] __VERIFIER_assertEXIT-->L34-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] {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 22:39:16,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {3883#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:16,036 INFO L290 TraceCheckUtils]: 38: Hoare triple {3883#true} [107] 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[] {3883#true} is VALID [2022-04-27 22:39:16,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {3883#true} [103] __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] {3883#true} is VALID [2022-04-27 22:39:16,036 INFO L272 TraceCheckUtils]: 36: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [101] L34-->__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] {3883#true} is VALID [2022-04-27 22:39:16,036 INFO L290 TraceCheckUtils]: 35: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 22:39:16,039 INFO L290 TraceCheckUtils]: 34: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [116] L41-->L41-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~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_1, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, 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_1} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 22:39:16,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [114] L36-->L41: Formula: (not (= 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[] {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 22:39:16,040 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 22:39:16,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {3883#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:16,040 INFO L290 TraceCheckUtils]: 30: Hoare triple {3883#true} [107] 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[] {3883#true} is VALID [2022-04-27 22:39:16,040 INFO L290 TraceCheckUtils]: 29: Hoare triple {3883#true} [103] __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] {3883#true} is VALID [2022-04-27 22:39:16,040 INFO L272 TraceCheckUtils]: 28: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, 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] {3883#true} is VALID [2022-04-27 22:39:16,041 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 22:39:16,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {3883#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:16,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {3883#true} [107] 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[] {3883#true} is VALID [2022-04-27 22:39:16,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {3883#true} [103] __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] {3883#true} is VALID [2022-04-27 22:39:16,041 INFO L272 TraceCheckUtils]: 23: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, 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] {3883#true} is VALID [2022-04-27 22:39:16,042 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [122] __VERIFIER_assertEXIT-->L34-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] {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 22:39:16,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {3883#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:16,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {3883#true} [107] 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[] {3883#true} is VALID [2022-04-27 22:39:16,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {3883#true} [103] __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] {3883#true} is VALID [2022-04-27 22:39:16,042 INFO L272 TraceCheckUtils]: 18: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [101] L34-->__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] {3883#true} is VALID [2022-04-27 22:39:16,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 22:39:16,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {3883#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, 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_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 22:39:16,043 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3883#true} {3883#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {3883#true} is VALID [2022-04-27 22:39:16,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {3883#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:16,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {3883#true} [95] 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[] {3883#true} is VALID [2022-04-27 22:39:16,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {3883#true} [92] 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] {3883#true} is VALID [2022-04-27 22:39:16,043 INFO L272 TraceCheckUtils]: 11: Hoare triple {3883#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) 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] {3883#true} is VALID [2022-04-27 22:39:16,043 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3883#true} {3883#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {3883#true} is VALID [2022-04-27 22:39:16,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {3883#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:16,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {3883#true} [95] 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[] {3883#true} is VALID [2022-04-27 22:39:16,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {3883#true} [92] 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] {3883#true} is VALID [2022-04-27 22:39:16,044 INFO L272 TraceCheckUtils]: 6: Hoare triple {3883#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {3883#true} is VALID [2022-04-27 22:39:16,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {3883#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_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|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_#t~nondet5, 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] {3883#true} is VALID [2022-04-27 22:39:16,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {3883#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:16,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3883#true} {3883#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:16,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {3883#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:16,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {3883#true} [86] 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] {3883#true} is VALID [2022-04-27 22:39:16,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {3883#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3883#true} is VALID [2022-04-27 22:39:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-04-27 22:39:16,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:39:16,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149644045] [2022-04-27 22:39:16,045 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 22:39:16,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779085774] [2022-04-27 22:39:16,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779085774] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:39:16,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 22:39:16,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-04-27 22:39:16,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047589570] [2022-04-27 22:39:16,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:39:16,046 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2022-04-27 22:39:16,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:39:16,046 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 22:39:16,079 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-27 22:39:16,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 22:39:16,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:39:16,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 22:39:16,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 22:39:16,080 INFO L87 Difference]: Start difference. First operand 85 states and 97 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 22:39:16,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:39:16,229 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2022-04-27 22:39:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 22:39:16,229 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2022-04-27 22:39:16,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:39:16,230 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 22:39:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 22:39:16,231 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 22:39:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 22:39:16,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-27 22:39:16,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:39:16,267 INFO L225 Difference]: With dead ends: 85 [2022-04-27 22:39:16,267 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 22:39:16,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 22:39:16,269 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:39:16,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:39:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 22:39:16,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 22:39:16,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:39:16,270 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-27 22:39:16,270 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-27 22:39:16,270 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-27 22:39:16,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:39:16,270 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:39:16,270 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:39:16,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:39:16,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:39:16,271 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-27 22:39:16,271 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-27 22:39:16,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:39:16,271 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:39:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:39:16,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:39:16,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:39:16,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:39:16,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:39:16,271 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-27 22:39:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 22:39:16,272 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2022-04-27 22:39:16,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:39:16,272 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 22:39:16,272 INFO L496 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 22:39:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:39:16,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:39:16,274 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 22:39:16,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 22:39:16,495 WARN L477 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-27 22:39:16,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 22:39:18,018 INFO L895 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-27 22:39:18,018 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:39:18,018 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:39:18,018 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 22:39:18,018 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 22:39:18,018 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:39:18,018 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:39:18,018 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-04-27 22:39:18,018 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-27 22:39:18,018 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2022-04-27 22:39:18,019 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2022-04-27 22:39:18,019 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 18 57) the Hoare annotation is: true [2022-04-27 22:39:18,019 INFO L902 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-27 22:39:18,019 INFO L902 garLoopResultBuilder]: At program point L23-1(line 23) the Hoare annotation is: true [2022-04-27 22:39:18,019 INFO L899 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2022-04-27 22:39:18,019 INFO L895 garLoopResultBuilder]: At program point L41-2(lines 33 50) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~a~0 (+ .cse0 .cse1)) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1)))) [2022-04-27 22:39:18,019 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 50) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (let ((.cse2 (+ .cse0 .cse1))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~b~0 .cse2) (= main_~a~0 .cse2) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))))) [2022-04-27 22:39:18,019 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~a~0 (+ .cse0 .cse1)) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1)))) [2022-04-27 22:39:18,019 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (let ((.cse2 (+ .cse0 .cse1))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~b~0 .cse2) (= main_~a~0 .cse2) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))))) [2022-04-27 22:39:18,019 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~a~0 (+ .cse0 .cse1)) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1)))) [2022-04-27 22:39:18,019 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse4 (* main_~q~0 main_~x~0)) (.cse5 (* main_~y~0 main_~s~0))) (let ((.cse0 (= main_~b~0 (+ .cse4 .cse5))) (.cse1 (= main_~s~0 1)) (.cse3 (= main_~p~0 1)) (.cse2 (<= 1 main_~y~0))) (or (and (= main_~r~0 0) .cse0 .cse1 .cse2 (= main_~a~0 main_~x~0) .cse3) (and (= main_~b~0 main_~a~0) .cse0 .cse1 (= main_~q~0 0) .cse2 .cse3) (let ((.cse6 (* main_~y~0 main_~r~0)) (.cse7 (* main_~p~0 main_~x~0))) (let ((.cse8 (+ .cse6 .cse7))) (and (= (+ .cse4 main_~a~0 .cse5) (+ .cse6 main_~b~0 .cse7)) (= main_~b~0 .cse8) (= main_~a~0 .cse8) .cse2 (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1)))))))) [2022-04-27 22:39:18,019 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~a~0 (+ .cse0 .cse1)) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1)))) [2022-04-27 22:39:18,019 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~y~0)) [2022-04-27 22:39:18,019 INFO L899 garLoopResultBuilder]: For program point L36(lines 33 50) no Hoare annotation was computed. [2022-04-27 22:39:18,020 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-04-27 22:39:18,020 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 49) no Hoare annotation was computed. [2022-04-27 22:39:18,020 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 18 57) no Hoare annotation was computed. [2022-04-27 22:39:18,020 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 18 57) no Hoare annotation was computed. [2022-04-27 22:39:18,020 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 16) the Hoare annotation is: true [2022-04-27 22:39:18,020 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2022-04-27 22:39:18,020 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2022-04-27 22:39:18,020 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2022-04-27 22:39:18,020 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-04-27 22:39:18,020 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2022-04-27 22:39:18,023 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:39:18,024 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 22:39:18,033 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:39:18,033 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 22:39:18,033 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 22:39:18,033 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:39:18,033 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 22:39:18,033 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 22:39:18,033 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 22:39:18,033 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 22:39:18,033 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 22:39:18,033 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-27 22:39:18,033 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 22:39:18,033 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 22:39:18,033 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 22:39:18,033 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 22:39:18,033 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 22:39:18,033 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:39:18,033 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:39:18,034 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:39:18,034 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:39:18,034 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:39:18,034 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:39:18,034 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:39:18,034 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 22:39:18,034 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 22:39:18,034 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 22:39:18,034 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-27 22:39:18,036 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 22:39:18,036 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 22:39:18,036 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 22:39:18,036 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 22:39:18,036 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 22:39:18,036 INFO L163 areAnnotationChecker]: CFG has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 22:39:18,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:39:18 BasicIcfg [2022-04-27 22:39:18,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 22:39:18,046 INFO L158 Benchmark]: Toolchain (without parser) took 34377.72ms. Allocated memory was 188.7MB in the beginning and 264.2MB in the end (delta: 75.5MB). Free memory was 128.0MB in the beginning and 101.8MB in the end (delta: 26.2MB). Peak memory consumption was 102.1MB. Max. memory is 8.0GB. [2022-04-27 22:39:18,046 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:39:18,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.38ms. Allocated memory was 188.7MB in the beginning and 264.2MB in the end (delta: 75.5MB). Free memory was 127.8MB in the beginning and 235.5MB in the end (delta: -107.7MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-27 22:39:18,047 INFO L158 Benchmark]: Boogie Preprocessor took 28.01ms. Allocated memory is still 264.2MB. Free memory was 235.5MB in the beginning and 233.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 22:39:18,047 INFO L158 Benchmark]: RCFGBuilder took 316.51ms. Allocated memory is still 264.2MB. Free memory was 233.9MB in the beginning and 221.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 22:39:18,047 INFO L158 Benchmark]: IcfgTransformer took 29.21ms. Allocated memory is still 264.2MB. Free memory was 221.4MB in the beginning and 219.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 22:39:18,048 INFO L158 Benchmark]: TraceAbstraction took 33773.63ms. Allocated memory is still 264.2MB. Free memory was 219.3MB in the beginning and 101.8MB in the end (delta: 117.5MB). Peak memory consumption was 119.0MB. Max. memory is 8.0GB. [2022-04-27 22:39:18,049 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.10ms. Allocated memory is still 188.7MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.38ms. Allocated memory was 188.7MB in the beginning and 264.2MB in the end (delta: 75.5MB). Free memory was 127.8MB in the beginning and 235.5MB in the end (delta: -107.7MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.01ms. Allocated memory is still 264.2MB. Free memory was 235.5MB in the beginning and 233.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 316.51ms. Allocated memory is still 264.2MB. Free memory was 233.9MB in the beginning and 221.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 29.21ms. Allocated memory is still 264.2MB. Free memory was 221.4MB in the beginning and 219.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 33773.63ms. Allocated memory is still 264.2MB. Free memory was 219.3MB in the beginning and 101.8MB in the end (delta: 117.5MB). Peak memory consumption was 119.0MB. 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, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.7s, OverallIterations: 9, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 995 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 684 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 583 IncrementalHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 311 mSDtfsCounter, 583 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 436 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=8, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 51 PreInvPairs, 84 NumberOfFragments, 378 HoareAnnotationTreeSize, 51 FomulaSimplifications, 136 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 1838 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 23.6s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 492 ConstructedInterpolants, 0 QuantifiedInterpolants, 1506 SizeOfPredicates, 16 NumberOfNonLiveVariables, 943 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 373/406 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: 33]: Loop Invariant Derived loop invariant: ((q * x + a + y * s == y * r + b + p * x && a == y * r + p * x) && 1 <= y) && p * s == q * r + 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 22:39:18,070 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...