/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 02:42:49,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 02:42:49,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 02:42:49,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 02:42:49,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 02:42:49,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 02:42:49,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 02:42:49,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 02:42:49,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 02:42:49,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 02:42:49,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 02:42:49,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 02:42:49,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 02:42:49,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 02:42:49,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 02:42:49,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 02:42:49,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 02:42:49,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 02:42:49,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 02:42:49,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 02:42:49,466 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 02:42:49,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 02:42:49,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 02:42:49,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 02:42:49,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 02:42:49,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 02:42:49,476 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 02:42:49,476 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 02:42:49,477 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 02:42:49,477 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 02:42:49,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 02:42:49,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 02:42:49,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 02:42:49,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 02:42:49,480 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 02:42:49,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 02:42:49,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 02:42:49,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 02:42:49,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 02:42:49,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 02:42:49,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 02:42:49,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 02:42:49,484 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 02:42:49,505 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 02:42:49,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 02:42:49,506 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 02:42:49,506 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 02:42:49,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 02:42:49,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 02:42:49,507 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 02:42:49,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 02:42:49,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 02:42:49,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 02:42:49,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 02:42:49,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 02:42:49,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 02:42:49,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 02:42:49,509 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 02:42:49,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 02:42:49,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 02:42:49,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 02:42:49,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 02:42:49,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 02:42:49,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 02:42:49,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 02:42:49,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 02:42:49,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 02:42:49,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 02:42:49,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 02:42:49,511 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 02:42:49,514 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 02:42:49,515 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 02:42:49,515 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-15 02:42:49,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 02:42:49,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 02:42:49,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 02:42:49,783 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 02:42:49,785 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 02:42:49,786 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound2.c [2022-04-15 02:42:49,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb61af995/5ef2f27fe44948e599372ba3907cc320/FLAGa0e825123 [2022-04-15 02:42:50,240 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 02:42:50,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound2.c [2022-04-15 02:42:50,245 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb61af995/5ef2f27fe44948e599372ba3907cc320/FLAGa0e825123 [2022-04-15 02:42:50,657 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb61af995/5ef2f27fe44948e599372ba3907cc320 [2022-04-15 02:42:50,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 02:42:50,661 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 02:42:50,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 02:42:50,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 02:42:50,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 02:42:50,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:42:50" (1/1) ... [2022-04-15 02:42:50,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63bde04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:42:50, skipping insertion in model container [2022-04-15 02:42:50,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:42:50" (1/1) ... [2022-04-15 02:42:50,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 02:42:50,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 02:42:50,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound2.c[489,502] [2022-04-15 02:42:50,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 02:42:50,863 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 02:42:50,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound2.c[489,502] [2022-04-15 02:42:50,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 02:42:50,894 INFO L208 MainTranslator]: Completed translation [2022-04-15 02:42:50,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:42:50 WrapperNode [2022-04-15 02:42:50,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 02:42:50,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 02:42:50,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 02:42:50,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 02:42:50,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:42:50" (1/1) ... [2022-04-15 02:42:50,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:42:50" (1/1) ... [2022-04-15 02:42:50,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:42:50" (1/1) ... [2022-04-15 02:42:50,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:42:50" (1/1) ... [2022-04-15 02:42:50,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:42:50" (1/1) ... [2022-04-15 02:42:50,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:42:50" (1/1) ... [2022-04-15 02:42:50,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:42:50" (1/1) ... [2022-04-15 02:42:50,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 02:42:50,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 02:42:50,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 02:42:50,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 02:42:50,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:42:50" (1/1) ... [2022-04-15 02:42:50,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 02:42:50,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:42:50,973 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-15 02:42:50,975 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-15 02:42:51,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 02:42:51,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 02:42:51,009 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 02:42:51,009 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 02:42:51,009 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 02:42:51,009 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 02:42:51,009 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 02:42:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 02:42:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 02:42:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 02:42:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 02:42:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 02:42:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 02:42:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 02:42:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 02:42:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 02:42:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 02:42:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 02:42:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 02:42:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 02:42:51,066 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 02:42:51,067 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 02:42:51,204 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 02:42:51,210 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 02:42:51,210 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 02:42:51,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:42:51 BoogieIcfgContainer [2022-04-15 02:42:51,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 02:42:51,213 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 02:42:51,213 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 02:42:51,214 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 02:42:51,217 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:42:51" (1/1) ... [2022-04-15 02:42:51,218 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 02:42:51,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 02:42:51 BasicIcfg [2022-04-15 02:42:51,264 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 02:42:51,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 02:42:51,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 02:42:51,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 02:42:51,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:42:50" (1/4) ... [2022-04-15 02:42:51,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f878567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:42:51, skipping insertion in model container [2022-04-15 02:42:51,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:42:50" (2/4) ... [2022-04-15 02:42:51,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f878567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:42:51, skipping insertion in model container [2022-04-15 02:42:51,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:42:51" (3/4) ... [2022-04-15 02:42:51,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f878567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 02:42:51, skipping insertion in model container [2022-04-15 02:42:51,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 02:42:51" (4/4) ... [2022-04-15 02:42:51,272 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound2.cqvasr [2022-04-15 02:42:51,277 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 02:42:51,278 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 02:42:51,318 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 02:42:51,325 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 02:42:51,326 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 02:42:51,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 02:42:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 02:42:51,350 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:42:51,351 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:42:51,352 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:42:51,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:42:51,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1381881312, now seen corresponding path program 1 times [2022-04-15 02:42:51,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:42:51,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534149237] [2022-04-15 02:42:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:51,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:42:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:51,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 02:42:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:51,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {40#true} is VALID [2022-04-15 02:42:51,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-15 02:42:51,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-15 02:42:51,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 02:42:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:51,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-15 02:42:51,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 02:42:51,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 02:42:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:51,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-15 02:42:51,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 02:42:51,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 02:42:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:51,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-15 02:42:51,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 02:42:51,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 02:42:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:51,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-15 02:42:51,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 02:42:51,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 02:42:51,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {40#true} is VALID [2022-04-15 02:42:51,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-15 02:42:51,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-15 02:42:51,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-15 02:42:51,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {40#true} is VALID [2022-04-15 02:42:51,663 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-15 02:42:51,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-15 02:42:51,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,666 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 02:42:51,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {41#false} is VALID [2022-04-15 02:42:51,668 INFO L272 TraceCheckUtils]: 12: Hoare triple {41#false} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-15 02:42:51,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-15 02:42:51,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,669 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41#false} {41#false} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 02:42:51,670 INFO L272 TraceCheckUtils]: 17: Hoare triple {41#false} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-15 02:42:51,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-15 02:42:51,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,672 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41#false} {41#false} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 02:42:51,673 INFO L272 TraceCheckUtils]: 22: Hoare triple {41#false} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-15 02:42:51,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-15 02:42:51,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,674 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41#false} {41#false} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 02:42:51,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {41#false} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {41#false} is VALID [2022-04-15 02:42:51,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {41#false} [107] L43-2-->L35-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,678 INFO L272 TraceCheckUtils]: 29: Hoare triple {41#false} [110] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {41#false} is VALID [2022-04-15 02:42:51,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {41#false} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {41#false} is VALID [2022-04-15 02:42:51,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {41#false} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {41#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 02:42:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 02:42:51,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:42:51,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534149237] [2022-04-15 02:42:51,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534149237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:42:51,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:42:51,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 02:42:51,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444366090] [2022-04-15 02:42:51,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:42:51,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 02:42:51,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:42:51,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 02:42:51,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:51,749 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 02:42:51,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:42:51,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 02:42:51,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 02:42:51,780 INFO L87 Difference]: Start difference. First operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 02:42:52,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:52,041 INFO L93 Difference]: Finished difference Result 67 states and 105 transitions. [2022-04-15 02:42:52,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 02:42:52,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 02:42:52,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:42:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 02:42:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-15 02:42:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 02:42:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-15 02:42:52,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2022-04-15 02:42:52,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:52,223 INFO L225 Difference]: With dead ends: 67 [2022-04-15 02:42:52,223 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 02:42:52,227 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 02:42:52,233 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 02:42:52,234 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 02:42:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 02:42:52,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 02:42:52,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:42:52,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 02:42:52,262 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 02:42:52,263 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 02:42:52,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:52,268 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-15 02:42:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 02:42:52,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:52,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:52,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-15 02:42:52,270 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-15 02:42:52,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:52,275 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-15 02:42:52,275 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 02:42:52,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:52,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:52,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:42:52,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:42:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 02:42:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-15 02:42:52,281 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 33 [2022-04-15 02:42:52,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:42:52,282 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-15 02:42:52,282 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 02:42:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 02:42:52,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 02:42:52,283 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:42:52,283 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:42:52,284 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 02:42:52,284 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:42:52,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:42:52,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1975235811, now seen corresponding path program 1 times [2022-04-15 02:42:52,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:42:52,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393595526] [2022-04-15 02:42:52,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:52,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:42:52,311 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:42:52,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528005874] [2022-04-15 02:42:52,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:52,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:42:52,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:42:52,314 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-15 02:42:52,351 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-15 02:42:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:52,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 02:42:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:52,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:42:52,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {276#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:42:52,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {276#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {276#true} is VALID [2022-04-15 02:42:52,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {276#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:42:52,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {276#true} {276#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:42:52,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {276#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:42:52,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {276#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {276#true} is VALID [2022-04-15 02:42:52,632 INFO L272 TraceCheckUtils]: 6: Hoare triple {276#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-15 02:42:52,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {276#true} is VALID [2022-04-15 02:42:52,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:42:52,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {276#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:42:52,633 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {276#true} {276#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-15 02:42:52,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {276#true} is VALID [2022-04-15 02:42:52,633 INFO L272 TraceCheckUtils]: 12: Hoare triple {276#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-15 02:42:52,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {276#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {276#true} is VALID [2022-04-15 02:42:52,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {276#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:42:52,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {276#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:42:52,634 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {276#true} {276#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-15 02:42:52,634 INFO L272 TraceCheckUtils]: 17: Hoare triple {276#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-15 02:42:52,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {276#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {276#true} is VALID [2022-04-15 02:42:52,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {276#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:42:52,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {276#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:42:52,635 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {276#true} {276#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-15 02:42:52,635 INFO L272 TraceCheckUtils]: 22: Hoare triple {276#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-15 02:42:52,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {276#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {276#true} is VALID [2022-04-15 02:42:52,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {276#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:42:52,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {276#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {276#true} is VALID [2022-04-15 02:42:52,636 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {276#true} {276#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {276#true} is VALID [2022-04-15 02:42:52,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {276#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {362#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-15 02:42:52,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {362#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {362#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-15 02:42:52,638 INFO L272 TraceCheckUtils]: 29: Hoare triple {362#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {369#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:42:52,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {369#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {373#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:42:52,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {373#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {277#false} is VALID [2022-04-15 02:42:52,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {277#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {277#false} is VALID [2022-04-15 02:42:52,640 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 02:42:52,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:42:52,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:42:52,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393595526] [2022-04-15 02:42:52,641 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:42:52,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528005874] [2022-04-15 02:42:52,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528005874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:42:52,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:42:52,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 02:42:52,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676433620] [2022-04-15 02:42:52,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:42:52,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-15 02:42:52,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:42:52,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 02:42:52,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:52,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:42:52,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:42:52,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:42:52,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:42:52,666 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 02:42:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:52,903 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-15 02:42:52,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 02:42:52,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-15 02:42:52,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:42:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 02:42:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 02:42:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 02:42:52,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 02:42:52,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-15 02:42:52,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:52,985 INFO L225 Difference]: With dead ends: 48 [2022-04-15 02:42:52,985 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 02:42:52,985 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:42:52,988 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:42:52,988 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 143 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:42:52,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 02:42:53,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-15 02:42:53,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:42:53,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 02:42:53,011 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 02:42:53,012 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 02:42:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:53,024 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-15 02:42:53,024 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-15 02:42:53,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:53,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:53,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-15 02:42:53,026 INFO L87 Difference]: Start difference. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-15 02:42:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:53,031 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-15 02:42:53,031 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-15 02:42:53,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:53,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:53,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:42:53,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:42:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 02:42:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-04-15 02:42:53,036 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 33 [2022-04-15 02:42:53,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:42:53,037 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-04-15 02:42:53,037 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 02:42:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-15 02:42:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 02:42:53,038 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:42:53,038 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:42:53,061 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-15 02:42:53,251 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:42:53,252 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:42:53,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:42:53,253 INFO L85 PathProgramCache]: Analyzing trace with hash -759782395, now seen corresponding path program 1 times [2022-04-15 02:42:53,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:42:53,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656371820] [2022-04-15 02:42:53,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:53,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:42:53,275 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:42:53,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1620855539] [2022-04-15 02:42:53,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:53,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:42:53,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:42:53,278 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-15 02:42:53,280 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-15 02:42:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:53,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 02:42:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:53,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:42:53,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {619#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-15 02:42:53,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {619#true} is VALID [2022-04-15 02:42:53,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-15 02:42:53,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {619#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-15 02:42:53,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {619#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-15 02:42:53,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {619#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {619#true} is VALID [2022-04-15 02:42:53,922 INFO L272 TraceCheckUtils]: 6: Hoare triple {619#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {619#true} is VALID [2022-04-15 02:42:53,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {619#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:42:53,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:53,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {649#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:53,925 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {649#(not (= |assume_abort_if_not_#in~cond| 0))} {619#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {656#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:42:53,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {656#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {656#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:42:53,925 INFO L272 TraceCheckUtils]: 12: Hoare triple {656#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {619#true} is VALID [2022-04-15 02:42:53,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {619#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:42:53,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:53,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {649#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:53,930 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {649#(not (= |assume_abort_if_not_#in~cond| 0))} {656#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {675#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:42:53,930 INFO L272 TraceCheckUtils]: 17: Hoare triple {675#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {619#true} is VALID [2022-04-15 02:42:53,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {619#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:42:53,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:53,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {649#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:53,934 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {649#(not (= |assume_abort_if_not_#in~cond| 0))} {675#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {691#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} is VALID [2022-04-15 02:42:53,934 INFO L272 TraceCheckUtils]: 22: Hoare triple {691#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {619#true} is VALID [2022-04-15 02:42:53,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {619#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:42:53,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:53,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {649#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:53,937 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {649#(not (= |assume_abort_if_not_#in~cond| 0))} {691#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {707#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:42:53,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {707#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (<= main_~x~0 2))} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 02:42:53,939 INFO L290 TraceCheckUtils]: 28: Hoare triple {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 02:42:53,940 INFO L272 TraceCheckUtils]: 29: Hoare triple {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {619#true} is VALID [2022-04-15 02:42:53,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {619#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {619#true} is VALID [2022-04-15 02:42:53,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {619#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-15 02:42:53,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {619#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-15 02:42:53,952 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {619#true} {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 02:42:53,955 INFO L272 TraceCheckUtils]: 34: Hoare triple {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {733#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:42:53,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {733#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {737#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:42:53,956 INFO L290 TraceCheckUtils]: 36: Hoare triple {737#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {620#false} is VALID [2022-04-15 02:42:53,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {620#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {620#false} is VALID [2022-04-15 02:42:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 02:42:53,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:42:53,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:42:53,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656371820] [2022-04-15 02:42:53,958 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:42:53,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620855539] [2022-04-15 02:42:53,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620855539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:42:53,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:42:53,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 02:42:53,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785447387] [2022-04-15 02:42:53,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:42:53,959 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2022-04-15 02:42:53,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:42:53,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 02:42:53,986 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-15 02:42:53,987 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 02:42:53,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:42:53,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 02:42:53,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-15 02:42:53,988 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 02:42:54,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:54,593 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-04-15 02:42:54,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 02:42:54,593 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2022-04-15 02:42:54,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:42:54,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 02:42:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-04-15 02:42:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 02:42:54,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-04-15 02:42:54,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 65 transitions. [2022-04-15 02:42:54,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:54,701 INFO L225 Difference]: With dead ends: 52 [2022-04-15 02:42:54,701 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 02:42:54,702 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-15 02:42:54,703 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 30 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 02:42:54,703 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 168 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 02:42:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 02:42:54,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-15 02:42:54,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:42:54,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 02:42:54,771 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 02:42:54,773 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 02:42:54,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:54,780 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-15 02:42:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-15 02:42:54,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:54,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:54,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-15 02:42:54,783 INFO L87 Difference]: Start difference. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-15 02:42:54,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:54,788 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-15 02:42:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-15 02:42:54,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:54,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:54,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:42:54,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:42:54,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 02:42:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2022-04-15 02:42:54,797 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 38 [2022-04-15 02:42:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:42:54,798 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2022-04-15 02:42:54,798 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 02:42:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-15 02:42:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 02:42:54,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:42:54,799 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:42:54,827 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-15 02:42:55,000 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 02:42:55,000 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:42:55,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:42:55,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1840397536, now seen corresponding path program 1 times [2022-04-15 02:42:55,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:42:55,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47075735] [2022-04-15 02:42:55,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:55,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:42:55,021 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:42:55,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1307843311] [2022-04-15 02:42:55,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:55,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:42:55,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:42:55,023 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-15 02:42:55,038 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-15 02:42:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:55,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 02:42:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:55,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:42:55,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {1003#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-15 02:42:55,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {1003#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1003#true} is VALID [2022-04-15 02:42:55,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {1003#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-15 02:42:55,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1003#true} {1003#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-15 02:42:55,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {1003#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-15 02:42:55,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {1003#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1003#true} is VALID [2022-04-15 02:42:55,593 INFO L272 TraceCheckUtils]: 6: Hoare triple {1003#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1003#true} is VALID [2022-04-15 02:42:55,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {1003#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:42:55,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:55,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:55,595 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} {1003#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1040#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:42:55,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {1040#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1040#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:42:55,596 INFO L272 TraceCheckUtils]: 12: Hoare triple {1040#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1003#true} is VALID [2022-04-15 02:42:55,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {1003#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:42:55,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:55,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:55,598 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} {1040#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1059#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:42:55,598 INFO L272 TraceCheckUtils]: 17: Hoare triple {1059#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1003#true} is VALID [2022-04-15 02:42:55,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {1003#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:42:55,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:55,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:55,601 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} {1059#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1075#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} is VALID [2022-04-15 02:42:55,601 INFO L272 TraceCheckUtils]: 22: Hoare triple {1075#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1003#true} is VALID [2022-04-15 02:42:55,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {1003#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:42:55,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:55,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:42:55,603 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} {1075#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1091#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:42:55,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {1091#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (<= main_~x~0 2))} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:42:55,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:42:55,604 INFO L272 TraceCheckUtils]: 29: Hoare triple {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1003#true} is VALID [2022-04-15 02:42:55,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {1003#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1003#true} is VALID [2022-04-15 02:42:55,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {1003#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-15 02:42:55,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {1003#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-15 02:42:55,607 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1003#true} {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:42:55,607 INFO L272 TraceCheckUtils]: 34: Hoare triple {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1003#true} is VALID [2022-04-15 02:42:55,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {1003#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1003#true} is VALID [2022-04-15 02:42:55,607 INFO L290 TraceCheckUtils]: 36: Hoare triple {1003#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-15 02:42:55,607 INFO L290 TraceCheckUtils]: 37: Hoare triple {1003#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1003#true} is VALID [2022-04-15 02:42:55,608 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1003#true} {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:42:55,609 INFO L272 TraceCheckUtils]: 39: Hoare triple {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1132#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:42:55,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {1132#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1136#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:42:55,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {1136#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1004#false} is VALID [2022-04-15 02:42:55,610 INFO L290 TraceCheckUtils]: 42: Hoare triple {1004#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1004#false} is VALID [2022-04-15 02:42:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 02:42:55,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:42:55,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:42:55,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47075735] [2022-04-15 02:42:55,611 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:42:55,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307843311] [2022-04-15 02:42:55,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307843311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:42:55,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:42:55,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 02:42:55,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617174546] [2022-04-15 02:42:55,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:42:55,612 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 43 [2022-04-15 02:42:55,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:42:55,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 02:42:55,639 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-15 02:42:55,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 02:42:55,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:42:55,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 02:42:55,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-15 02:42:55,640 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 02:42:56,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:56,327 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2022-04-15 02:42:56,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 02:42:56,327 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 43 [2022-04-15 02:42:56,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:42:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 02:42:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-04-15 02:42:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 02:42:56,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-04-15 02:42:56,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 65 transitions. [2022-04-15 02:42:56,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:56,413 INFO L225 Difference]: With dead ends: 74 [2022-04-15 02:42:56,413 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 02:42:56,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-15 02:42:56,415 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 02:42:56,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 194 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 02:42:56,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 02:42:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-15 02:42:56,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:42:56,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:42:56,495 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:42:56,495 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:42:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:56,502 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-15 02:42:56,503 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-15 02:42:56,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:56,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:56,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-15 02:42:56,505 INFO L87 Difference]: Start difference. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-15 02:42:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:56,512 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-15 02:42:56,512 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-15 02:42:56,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:56,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:56,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:42:56,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:42:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:42:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2022-04-15 02:42:56,518 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 43 [2022-04-15 02:42:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:42:56,519 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2022-04-15 02:42:56,520 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 02:42:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-15 02:42:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 02:42:56,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:42:56,522 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:42:56,543 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-15 02:42:56,734 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:42:56,735 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:42:56,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:42:56,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1590647429, now seen corresponding path program 1 times [2022-04-15 02:42:56,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:42:56,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899405047] [2022-04-15 02:42:56,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:56,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:42:56,754 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:42:56,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1647977595] [2022-04-15 02:42:56,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:56,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:42:56,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:42:56,755 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-15 02:42:56,786 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-15 02:42:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:56,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 02:42:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:56,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:42:56,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {1514#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {1514#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1514#true} is VALID [2022-04-15 02:42:56,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {1514#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1514#true} {1514#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {1514#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {1514#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1514#true} is VALID [2022-04-15 02:42:56,949 INFO L272 TraceCheckUtils]: 6: Hoare triple {1514#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-15 02:42:56,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {1514#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1514#true} is VALID [2022-04-15 02:42:56,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {1514#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {1514#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,950 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1514#true} {1514#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-15 02:42:56,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {1514#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1514#true} is VALID [2022-04-15 02:42:56,950 INFO L272 TraceCheckUtils]: 12: Hoare triple {1514#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-15 02:42:56,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {1514#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1514#true} is VALID [2022-04-15 02:42:56,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {1514#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {1514#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,951 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1514#true} {1514#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-15 02:42:56,951 INFO L272 TraceCheckUtils]: 17: Hoare triple {1514#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-15 02:42:56,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {1514#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1514#true} is VALID [2022-04-15 02:42:56,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {1514#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {1514#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,952 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1514#true} {1514#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-15 02:42:56,952 INFO L272 TraceCheckUtils]: 22: Hoare triple {1514#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-15 02:42:56,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {1514#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1514#true} is VALID [2022-04-15 02:42:56,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {1514#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {1514#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,952 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1514#true} {1514#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-15 02:42:56,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {1514#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1514#true} is VALID [2022-04-15 02:42:56,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {1514#true} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,953 INFO L272 TraceCheckUtils]: 29: Hoare triple {1514#true} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1514#true} is VALID [2022-04-15 02:42:56,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {1514#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1514#true} is VALID [2022-04-15 02:42:56,953 INFO L290 TraceCheckUtils]: 31: Hoare triple {1514#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,953 INFO L290 TraceCheckUtils]: 32: Hoare triple {1514#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,953 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1514#true} {1514#true} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1514#true} is VALID [2022-04-15 02:42:56,953 INFO L272 TraceCheckUtils]: 34: Hoare triple {1514#true} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1514#true} is VALID [2022-04-15 02:42:56,953 INFO L290 TraceCheckUtils]: 35: Hoare triple {1514#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1514#true} is VALID [2022-04-15 02:42:56,954 INFO L290 TraceCheckUtils]: 36: Hoare triple {1514#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,954 INFO L290 TraceCheckUtils]: 37: Hoare triple {1514#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,954 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1514#true} {1514#true} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1514#true} is VALID [2022-04-15 02:42:56,954 INFO L272 TraceCheckUtils]: 39: Hoare triple {1514#true} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1514#true} is VALID [2022-04-15 02:42:56,954 INFO L290 TraceCheckUtils]: 40: Hoare triple {1514#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1514#true} is VALID [2022-04-15 02:42:56,954 INFO L290 TraceCheckUtils]: 41: Hoare triple {1514#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,954 INFO L290 TraceCheckUtils]: 42: Hoare triple {1514#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-15 02:42:56,955 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1514#true} {1514#true} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1514#true} is VALID [2022-04-15 02:42:56,955 INFO L290 TraceCheckUtils]: 44: Hoare triple {1514#true} [123] L38-->L35-2: Formula: (= v_main_~a~0_9 v_main_~b~0_11) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {1651#(= main_~b~0 main_~a~0)} is VALID [2022-04-15 02:42:56,956 INFO L272 TraceCheckUtils]: 45: Hoare triple {1651#(= main_~b~0 main_~a~0)} [110] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {1655#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:42:56,956 INFO L290 TraceCheckUtils]: 46: Hoare triple {1655#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1659#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:42:56,958 INFO L290 TraceCheckUtils]: 47: Hoare triple {1659#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1515#false} is VALID [2022-04-15 02:42:56,958 INFO L290 TraceCheckUtils]: 48: Hoare triple {1515#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1515#false} is VALID [2022-04-15 02:42:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-15 02:42:56,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:42:56,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:42:56,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899405047] [2022-04-15 02:42:56,959 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:42:56,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647977595] [2022-04-15 02:42:56,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647977595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:42:56,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:42:56,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 02:42:56,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717991844] [2022-04-15 02:42:56,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:42:56,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-15 02:42:56,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:42:56,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-15 02:42:56,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:56,989 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:42:56,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:42:56,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:42:56,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:42:56,990 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-15 02:42:57,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:57,213 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2022-04-15 02:42:57,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 02:42:57,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-15 02:42:57,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:42:57,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-15 02:42:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 02:42:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-15 02:42:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 02:42:57,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-15 02:42:57,263 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-15 02:42:57,267 INFO L225 Difference]: With dead ends: 76 [2022-04-15 02:42:57,268 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 02:42:57,268 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:42:57,269 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:42:57,269 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:42:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 02:42:57,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-15 02:42:57,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:42:57,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:42:57,355 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:42:57,356 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:42:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:57,363 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-15 02:42:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-15 02:42:57,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:57,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:57,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-15 02:42:57,366 INFO L87 Difference]: Start difference. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-15 02:42:57,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:57,370 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-15 02:42:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-15 02:42:57,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:57,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:57,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:42:57,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:42:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 02:42:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 101 transitions. [2022-04-15 02:42:57,376 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 101 transitions. Word has length 49 [2022-04-15 02:42:57,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:42:57,377 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 101 transitions. [2022-04-15 02:42:57,379 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-15 02:42:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-15 02:42:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 02:42:57,381 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:42:57,381 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:42:57,409 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-15 02:42:57,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:42:57,604 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:42:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:42:57,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1737902154, now seen corresponding path program 1 times [2022-04-15 02:42:57,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:42:57,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199064675] [2022-04-15 02:42:57,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:57,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:42:57,624 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:42:57,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858101868] [2022-04-15 02:42:57,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:57,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:42:57,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:42:57,626 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-15 02:42:57,656 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-15 02:42:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:57,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 02:42:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:57,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:42:57,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {2049#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {2049#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2049#true} is VALID [2022-04-15 02:42:57,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {2049#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2049#true} {2049#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {2049#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {2049#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2049#true} is VALID [2022-04-15 02:42:57,937 INFO L272 TraceCheckUtils]: 6: Hoare triple {2049#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2049#true} is VALID [2022-04-15 02:42:57,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {2049#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2049#true} is VALID [2022-04-15 02:42:57,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {2049#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {2049#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,938 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2049#true} {2049#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2049#true} is VALID [2022-04-15 02:42:57,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {2049#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {2049#true} is VALID [2022-04-15 02:42:57,938 INFO L272 TraceCheckUtils]: 12: Hoare triple {2049#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2049#true} is VALID [2022-04-15 02:42:57,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {2049#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2049#true} is VALID [2022-04-15 02:42:57,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {2049#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {2049#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,939 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2049#true} {2049#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2049#true} is VALID [2022-04-15 02:42:57,939 INFO L272 TraceCheckUtils]: 17: Hoare triple {2049#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2049#true} is VALID [2022-04-15 02:42:57,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {2049#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2049#true} is VALID [2022-04-15 02:42:57,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {2049#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {2049#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,940 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2049#true} {2049#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2049#true} is VALID [2022-04-15 02:42:57,940 INFO L272 TraceCheckUtils]: 22: Hoare triple {2049#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2049#true} is VALID [2022-04-15 02:42:57,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {2049#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2049#true} is VALID [2022-04-15 02:42:57,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {2049#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {2049#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,941 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2049#true} {2049#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2049#true} is VALID [2022-04-15 02:42:57,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {2049#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:42:57,942 INFO L290 TraceCheckUtils]: 28: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:42:57,942 INFO L272 TraceCheckUtils]: 29: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2049#true} is VALID [2022-04-15 02:42:57,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {2049#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2049#true} is VALID [2022-04-15 02:42:57,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {2049#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {2049#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,943 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2049#true} {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:42:57,943 INFO L272 TraceCheckUtils]: 34: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2049#true} is VALID [2022-04-15 02:42:57,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {2049#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2049#true} is VALID [2022-04-15 02:42:57,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {2049#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {2049#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,945 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2049#true} {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:42:57,945 INFO L272 TraceCheckUtils]: 39: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2049#true} is VALID [2022-04-15 02:42:57,945 INFO L290 TraceCheckUtils]: 40: Hoare triple {2049#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2049#true} is VALID [2022-04-15 02:42:57,945 INFO L290 TraceCheckUtils]: 41: Hoare triple {2049#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {2049#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2049#true} is VALID [2022-04-15 02:42:57,946 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2049#true} {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:42:57,947 INFO L290 TraceCheckUtils]: 44: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:42:57,947 INFO L290 TraceCheckUtils]: 45: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:42:57,948 INFO L290 TraceCheckUtils]: 46: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 02:42:57,949 INFO L272 TraceCheckUtils]: 47: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2196#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:42:57,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {2196#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2200#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:42:57,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {2200#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2050#false} is VALID [2022-04-15 02:42:57,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {2050#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2050#false} is VALID [2022-04-15 02:42:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 02:42:57,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 02:42:57,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:42:57,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199064675] [2022-04-15 02:42:57,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:42:57,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858101868] [2022-04-15 02:42:57,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858101868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 02:42:57,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 02:42:57,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 02:42:57,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949629096] [2022-04-15 02:42:57,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 02:42:57,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-15 02:42:57,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:42:57,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 02:42:57,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:57,983 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 02:42:57,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:42:57,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 02:42:57,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 02:42:57,984 INFO L87 Difference]: Start difference. First operand 74 states and 101 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 02:42:58,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:58,253 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2022-04-15 02:42:58,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 02:42:58,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-15 02:42:58,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:42:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 02:42:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-15 02:42:58,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 02:42:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-15 02:42:58,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-15 02:42:58,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:42:58,314 INFO L225 Difference]: With dead ends: 84 [2022-04-15 02:42:58,314 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 02:42:58,315 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 02:42:58,315 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 02:42:58,316 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 146 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 02:42:58,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 02:42:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-04-15 02:42:58,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:42:58,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 02:42:58,384 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 02:42:58,384 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 02:42:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:58,388 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2022-04-15 02:42:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-04-15 02:42:58,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:58,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:58,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 81 states. [2022-04-15 02:42:58,389 INFO L87 Difference]: Start difference. First operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 81 states. [2022-04-15 02:42:58,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:42:58,393 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2022-04-15 02:42:58,393 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-04-15 02:42:58,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:42:58,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:42:58,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:42:58,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:42:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 02:42:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2022-04-15 02:42:58,397 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 51 [2022-04-15 02:42:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:42:58,398 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2022-04-15 02:42:58,398 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 02:42:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2022-04-15 02:42:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 02:42:58,399 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:42:58,399 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:42:58,435 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-15 02:42:58,625 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:42:58,626 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:42:58,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:42:58,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1046589490, now seen corresponding path program 1 times [2022-04-15 02:42:58,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:42:58,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836439057] [2022-04-15 02:42:58,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:58,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:42:58,642 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:42:58,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [258872090] [2022-04-15 02:42:58,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:42:58,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:42:58,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:42:58,644 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-15 02:42:58,653 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-15 02:42:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:58,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 02:42:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:42:58,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:42:58,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {2618#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {2618#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2618#true} is VALID [2022-04-15 02:42:58,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {2618#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2618#true} {2618#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {2618#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {2618#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2618#true} is VALID [2022-04-15 02:42:58,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {2618#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-15 02:42:58,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {2618#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2618#true} is VALID [2022-04-15 02:42:58,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {2618#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {2618#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,915 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2618#true} {2618#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-15 02:42:58,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {2618#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {2618#true} is VALID [2022-04-15 02:42:58,915 INFO L272 TraceCheckUtils]: 12: Hoare triple {2618#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-15 02:42:58,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {2618#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2618#true} is VALID [2022-04-15 02:42:58,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {2618#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {2618#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,916 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2618#true} {2618#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-15 02:42:58,916 INFO L272 TraceCheckUtils]: 17: Hoare triple {2618#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-15 02:42:58,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {2618#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2618#true} is VALID [2022-04-15 02:42:58,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {2618#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {2618#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,917 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2618#true} {2618#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-15 02:42:58,917 INFO L272 TraceCheckUtils]: 22: Hoare triple {2618#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-15 02:42:58,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {2618#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2618#true} is VALID [2022-04-15 02:42:58,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {2618#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {2618#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,917 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2618#true} {2618#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-15 02:42:58,917 INFO L290 TraceCheckUtils]: 27: Hoare triple {2618#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2618#true} is VALID [2022-04-15 02:42:58,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {2618#true} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,918 INFO L272 TraceCheckUtils]: 29: Hoare triple {2618#true} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2618#true} is VALID [2022-04-15 02:42:58,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {2618#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2618#true} is VALID [2022-04-15 02:42:58,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {2618#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {2618#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,918 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2618#true} {2618#true} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2618#true} is VALID [2022-04-15 02:42:58,918 INFO L272 TraceCheckUtils]: 34: Hoare triple {2618#true} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2618#true} is VALID [2022-04-15 02:42:58,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {2618#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2728#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:42:58,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {2728#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:42:58,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:42:58,922 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} {2618#true} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:42:58,922 INFO L272 TraceCheckUtils]: 39: Hoare triple {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2618#true} is VALID [2022-04-15 02:42:58,922 INFO L290 TraceCheckUtils]: 40: Hoare triple {2618#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2618#true} is VALID [2022-04-15 02:42:58,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {2618#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,922 INFO L290 TraceCheckUtils]: 42: Hoare triple {2618#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,923 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2618#true} {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:42:58,924 INFO L290 TraceCheckUtils]: 44: Hoare triple {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [123] L38-->L35-2: Formula: (= v_main_~a~0_9 v_main_~b~0_11) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:42:58,924 INFO L272 TraceCheckUtils]: 45: Hoare triple {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [110] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2618#true} is VALID [2022-04-15 02:42:58,924 INFO L290 TraceCheckUtils]: 46: Hoare triple {2618#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2618#true} is VALID [2022-04-15 02:42:58,924 INFO L290 TraceCheckUtils]: 47: Hoare triple {2618#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,924 INFO L290 TraceCheckUtils]: 48: Hoare triple {2618#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:42:58,925 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2618#true} {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [137] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:42:58,926 INFO L272 TraceCheckUtils]: 50: Hoare triple {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [112] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* (- 1) v_main_~b~0_14) (* v_main_~p~0_12 v_main_~x~0_15) (* v_main_~r~0_12 v_main_~y~0_14)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_15, main_~b~0=v_main_~b~0_14, main_~p~0=v_main_~p~0_12, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0] {2777#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:42:58,926 INFO L290 TraceCheckUtils]: 51: Hoare triple {2777#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2781#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:42:58,926 INFO L290 TraceCheckUtils]: 52: Hoare triple {2781#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2619#false} is VALID [2022-04-15 02:42:58,927 INFO L290 TraceCheckUtils]: 53: Hoare triple {2619#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2619#false} is VALID [2022-04-15 02:42:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-15 02:42:58,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:43:13,846 INFO L290 TraceCheckUtils]: 53: Hoare triple {2619#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2619#false} is VALID [2022-04-15 02:43:13,847 INFO L290 TraceCheckUtils]: 52: Hoare triple {2781#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2619#false} is VALID [2022-04-15 02:43:13,847 INFO L290 TraceCheckUtils]: 51: Hoare triple {2777#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2781#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:43:13,848 INFO L272 TraceCheckUtils]: 50: Hoare triple {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [112] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* (- 1) v_main_~b~0_14) (* v_main_~p~0_12 v_main_~x~0_15) (* v_main_~r~0_12 v_main_~y~0_14)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_15, main_~b~0=v_main_~b~0_14, main_~p~0=v_main_~p~0_12, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0] {2777#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:43:13,849 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2618#true} {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [137] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:43:13,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {2618#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,849 INFO L290 TraceCheckUtils]: 47: Hoare triple {2618#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,849 INFO L290 TraceCheckUtils]: 46: Hoare triple {2618#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2618#true} is VALID [2022-04-15 02:43:13,850 INFO L272 TraceCheckUtils]: 45: Hoare triple {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [110] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2618#true} is VALID [2022-04-15 02:43:13,851 INFO L290 TraceCheckUtils]: 44: Hoare triple {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [123] L38-->L35-2: Formula: (= v_main_~a~0_9 v_main_~b~0_11) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:43:13,852 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2618#true} {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:43:13,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {2618#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {2618#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {2618#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2618#true} is VALID [2022-04-15 02:43:13,859 INFO L272 TraceCheckUtils]: 39: Hoare triple {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2618#true} is VALID [2022-04-15 02:43:13,860 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} {2618#true} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:43:13,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:43:13,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {2842#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:43:13,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {2618#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2842#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 02:43:13,862 INFO L272 TraceCheckUtils]: 34: Hoare triple {2618#true} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2618#true} is VALID [2022-04-15 02:43:13,862 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2618#true} {2618#true} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2618#true} is VALID [2022-04-15 02:43:13,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {2618#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,862 INFO L290 TraceCheckUtils]: 31: Hoare triple {2618#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {2618#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2618#true} is VALID [2022-04-15 02:43:13,862 INFO L272 TraceCheckUtils]: 29: Hoare triple {2618#true} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2618#true} is VALID [2022-04-15 02:43:13,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {2618#true} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {2618#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2618#true} is VALID [2022-04-15 02:43:13,863 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2618#true} {2618#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-15 02:43:13,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {2618#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {2618#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {2618#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2618#true} is VALID [2022-04-15 02:43:13,863 INFO L272 TraceCheckUtils]: 22: Hoare triple {2618#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-15 02:43:13,864 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2618#true} {2618#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-15 02:43:13,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {2618#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {2618#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {2618#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2618#true} is VALID [2022-04-15 02:43:13,864 INFO L272 TraceCheckUtils]: 17: Hoare triple {2618#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-15 02:43:13,864 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2618#true} {2618#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-15 02:43:13,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {2618#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {2618#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {2618#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2618#true} is VALID [2022-04-15 02:43:13,865 INFO L272 TraceCheckUtils]: 12: Hoare triple {2618#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-15 02:43:13,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {2618#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {2618#true} is VALID [2022-04-15 02:43:13,865 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2618#true} {2618#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-15 02:43:13,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {2618#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {2618#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {2618#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2618#true} is VALID [2022-04-15 02:43:13,865 INFO L272 TraceCheckUtils]: 6: Hoare triple {2618#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2618#true} is VALID [2022-04-15 02:43:13,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {2618#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2618#true} is VALID [2022-04-15 02:43:13,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {2618#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2618#true} {2618#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {2618#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {2618#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2618#true} is VALID [2022-04-15 02:43:13,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {2618#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2618#true} is VALID [2022-04-15 02:43:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-15 02:43:13,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:43:13,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836439057] [2022-04-15 02:43:13,869 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:43:13,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258872090] [2022-04-15 02:43:13,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258872090] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:43:13,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 02:43:13,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-15 02:43:13,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206419797] [2022-04-15 02:43:13,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 02:43:13,871 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-15 02:43:13,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:43:13,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 02:43:13,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:43:13,900 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 02:43:13,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:43:13,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 02:43:13,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-15 02:43:13,901 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 02:43:14,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:43:14,549 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2022-04-15 02:43:14,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 02:43:14,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-15 02:43:14,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:43:14,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 02:43:14,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-15 02:43:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 02:43:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-15 02:43:14,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-04-15 02:43:14,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:43:14,624 INFO L225 Difference]: With dead ends: 88 [2022-04-15 02:43:14,624 INFO L226 Difference]: Without dead ends: 84 [2022-04-15 02:43:14,625 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 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-15 02:43:14,626 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 02:43:14,626 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 130 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 02:43:14,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-15 02:43:14,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-15 02:43:14,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:43:14,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-15 02:43:14,705 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-15 02:43:14,705 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-15 02:43:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:43:14,708 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-15 02:43:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-15 02:43:14,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:43:14,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:43:14,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 84 states. [2022-04-15 02:43:14,710 INFO L87 Difference]: Start difference. First operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 84 states. [2022-04-15 02:43:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:43:14,713 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-15 02:43:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-15 02:43:14,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:43:14,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:43:14,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:43:14,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:43:14,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-15 02:43:14,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2022-04-15 02:43:14,717 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 54 [2022-04-15 02:43:14,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:43:14,717 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2022-04-15 02:43:14,718 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 02:43:14,718 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-15 02:43:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 02:43:14,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:43:14,718 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:43:14,741 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-15 02:43:14,935 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:43:14,936 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:43:14,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:43:14,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2126309122, now seen corresponding path program 2 times [2022-04-15 02:43:14,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:43:14,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242000360] [2022-04-15 02:43:14,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:43:14,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:43:14,961 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:43:14,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [540974455] [2022-04-15 02:43:14,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 02:43:14,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:43:14,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:43:14,963 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-15 02:43:14,964 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-15 02:43:15,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 02:43:15,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 02:43:15,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 02:43:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:43:15,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:43:15,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {3384#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:15,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {3384#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3384#true} is VALID [2022-04-15 02:43:15,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {3384#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:15,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3384#true} {3384#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:15,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {3384#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:15,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {3384#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3384#true} is VALID [2022-04-15 02:43:15,693 INFO L272 TraceCheckUtils]: 6: Hoare triple {3384#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-15 02:43:15,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {3384#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3410#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:43:15,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {3410#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3414#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:43:15,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {3414#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3414#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:43:15,699 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3414#(not (= |assume_abort_if_not_#in~cond| 0))} {3384#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:43:15,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:43:15,699 INFO L272 TraceCheckUtils]: 12: Hoare triple {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-15 02:43:15,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {3384#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3384#true} is VALID [2022-04-15 02:43:15,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {3384#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:15,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {3384#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:15,700 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3384#true} {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:43:15,700 INFO L272 TraceCheckUtils]: 17: Hoare triple {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-15 02:43:15,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {3384#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3384#true} is VALID [2022-04-15 02:43:15,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {3384#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:15,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {3384#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:15,701 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3384#true} {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:43:15,701 INFO L272 TraceCheckUtils]: 22: Hoare triple {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-15 02:43:15,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {3384#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3410#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:43:15,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {3410#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3414#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:43:15,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {3414#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3414#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:43:15,703 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3414#(not (= |assume_abort_if_not_#in~cond| 0))} {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3470#(and (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:43:15,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {3470#(and (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 02:43:15,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 02:43:15,704 INFO L272 TraceCheckUtils]: 29: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3384#true} is VALID [2022-04-15 02:43:15,704 INFO L290 TraceCheckUtils]: 30: Hoare triple {3384#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3384#true} is VALID [2022-04-15 02:43:15,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {3384#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:15,705 INFO L290 TraceCheckUtils]: 32: Hoare triple {3384#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:15,705 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3384#true} {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 02:43:15,705 INFO L272 TraceCheckUtils]: 34: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3384#true} is VALID [2022-04-15 02:43:15,706 INFO L290 TraceCheckUtils]: 35: Hoare triple {3384#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3384#true} is VALID [2022-04-15 02:43:15,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {3384#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:15,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {3384#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:15,706 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3384#true} {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 02:43:15,707 INFO L272 TraceCheckUtils]: 39: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3384#true} is VALID [2022-04-15 02:43:15,707 INFO L290 TraceCheckUtils]: 40: Hoare triple {3384#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:43:15,707 INFO L290 TraceCheckUtils]: 41: Hoare triple {3514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:43:15,708 INFO L290 TraceCheckUtils]: 42: Hoare triple {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:43:15,708 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 02:43:15,709 INFO L290 TraceCheckUtils]: 44: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 02:43:15,710 INFO L290 TraceCheckUtils]: 45: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 02:43:15,710 INFO L290 TraceCheckUtils]: 46: Hoare triple {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 02:43:15,710 INFO L272 TraceCheckUtils]: 47: Hoare triple {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3384#true} is VALID [2022-04-15 02:43:15,710 INFO L290 TraceCheckUtils]: 48: Hoare triple {3384#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3384#true} is VALID [2022-04-15 02:43:15,711 INFO L290 TraceCheckUtils]: 49: Hoare triple {3384#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:15,711 INFO L290 TraceCheckUtils]: 50: Hoare triple {3384#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:15,711 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3384#true} {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 02:43:15,712 INFO L272 TraceCheckUtils]: 52: Hoare triple {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3553#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:43:15,712 INFO L290 TraceCheckUtils]: 53: Hoare triple {3553#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3557#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:43:15,713 INFO L290 TraceCheckUtils]: 54: Hoare triple {3557#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3385#false} is VALID [2022-04-15 02:43:15,713 INFO L290 TraceCheckUtils]: 55: Hoare triple {3385#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3385#false} is VALID [2022-04-15 02:43:15,713 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 02:43:15,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:43:34,835 INFO L290 TraceCheckUtils]: 55: Hoare triple {3385#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3385#false} is VALID [2022-04-15 02:43:34,836 INFO L290 TraceCheckUtils]: 54: Hoare triple {3557#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3385#false} is VALID [2022-04-15 02:43:34,836 INFO L290 TraceCheckUtils]: 53: Hoare triple {3553#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3557#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:43:34,837 INFO L272 TraceCheckUtils]: 52: Hoare triple {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3553#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:43:34,838 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3384#true} {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:43:34,838 INFO L290 TraceCheckUtils]: 50: Hoare triple {3384#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:34,838 INFO L290 TraceCheckUtils]: 49: Hoare triple {3384#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:34,838 INFO L290 TraceCheckUtils]: 48: Hoare triple {3384#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3384#true} is VALID [2022-04-15 02:43:34,839 INFO L272 TraceCheckUtils]: 47: Hoare triple {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3384#true} is VALID [2022-04-15 02:43:34,839 INFO L290 TraceCheckUtils]: 46: Hoare triple {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:43:35,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {3595#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 02:43:35,314 INFO L290 TraceCheckUtils]: 44: Hoare triple {3595#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {3595#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-15 02:43:35,315 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3595#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-15 02:43:35,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:43:35,316 INFO L290 TraceCheckUtils]: 41: Hoare triple {3612#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:43:35,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {3384#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3612#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 02:43:35,316 INFO L272 TraceCheckUtils]: 39: Hoare triple {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3384#true} is VALID [2022-04-15 02:43:35,317 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3384#true} {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-15 02:43:35,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {3384#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:35,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {3384#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:35,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {3384#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3384#true} is VALID [2022-04-15 02:43:35,318 INFO L272 TraceCheckUtils]: 34: Hoare triple {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3384#true} is VALID [2022-04-15 02:43:35,318 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3384#true} {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-15 02:43:35,318 INFO L290 TraceCheckUtils]: 32: Hoare triple {3384#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:35,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {3384#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:35,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {3384#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3384#true} is VALID [2022-04-15 02:43:35,319 INFO L272 TraceCheckUtils]: 29: Hoare triple {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3384#true} is VALID [2022-04-15 02:43:35,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-15 02:43:35,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {3384#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-15 02:43:35,322 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3384#true} {3384#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-15 02:43:35,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {3384#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:35,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {3384#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:35,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {3384#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3384#true} is VALID [2022-04-15 02:43:35,324 INFO L272 TraceCheckUtils]: 22: Hoare triple {3384#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-15 02:43:35,324 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3384#true} {3384#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-15 02:43:35,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {3384#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:35,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {3384#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:35,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {3384#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3384#true} is VALID [2022-04-15 02:43:35,325 INFO L272 TraceCheckUtils]: 17: Hoare triple {3384#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-15 02:43:35,325 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3384#true} {3384#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-15 02:43:35,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {3384#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:35,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {3384#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:35,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {3384#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3384#true} is VALID [2022-04-15 02:43:35,325 INFO L272 TraceCheckUtils]: 12: Hoare triple {3384#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-15 02:43:35,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {3384#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {3384#true} is VALID [2022-04-15 02:43:35,325 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3384#true} {3384#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-15 02:43:35,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {3384#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:35,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {3384#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:35,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {3384#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3384#true} is VALID [2022-04-15 02:43:35,326 INFO L272 TraceCheckUtils]: 6: Hoare triple {3384#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3384#true} is VALID [2022-04-15 02:43:35,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {3384#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3384#true} is VALID [2022-04-15 02:43:35,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {3384#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:35,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3384#true} {3384#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:35,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {3384#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:35,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {3384#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3384#true} is VALID [2022-04-15 02:43:35,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {3384#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3384#true} is VALID [2022-04-15 02:43:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-15 02:43:35,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:43:35,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242000360] [2022-04-15 02:43:35,327 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:43:35,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540974455] [2022-04-15 02:43:35,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540974455] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:43:35,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 02:43:35,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-15 02:43:35,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141464752] [2022-04-15 02:43:35,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 02:43:35,328 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) Word has length 56 [2022-04-15 02:43:35,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:43:35,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-15 02:43:35,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:43:35,440 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 02:43:35,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:43:35,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 02:43:35,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-04-15 02:43:35,441 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-15 02:43:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:43:38,978 INFO L93 Difference]: Finished difference Result 119 states and 153 transitions. [2022-04-15 02:43:38,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 02:43:38,978 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) Word has length 56 [2022-04-15 02:43:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:43:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-15 02:43:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 89 transitions. [2022-04-15 02:43:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-15 02:43:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 89 transitions. [2022-04-15 02:43:38,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 89 transitions. [2022-04-15 02:43:39,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:43:39,101 INFO L225 Difference]: With dead ends: 119 [2022-04-15 02:43:39,101 INFO L226 Difference]: Without dead ends: 117 [2022-04-15 02:43:39,102 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-04-15 02:43:39,102 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 43 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 02:43:39,103 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 156 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 02:43:39,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-15 02:43:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 96. [2022-04-15 02:43:39,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:43:39,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-15 02:43:39,210 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-15 02:43:39,210 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-15 02:43:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:43:39,214 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2022-04-15 02:43:39,215 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2022-04-15 02:43:39,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:43:39,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:43:39,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 117 states. [2022-04-15 02:43:39,227 INFO L87 Difference]: Start difference. First operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 117 states. [2022-04-15 02:43:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:43:39,232 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2022-04-15 02:43:39,232 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2022-04-15 02:43:39,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:43:39,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:43:39,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:43:39,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:43:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-15 02:43:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2022-04-15 02:43:39,238 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 56 [2022-04-15 02:43:39,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:43:39,238 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2022-04-15 02:43:39,239 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-15 02:43:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2022-04-15 02:43:39,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 02:43:39,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:43:39,239 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:43:39,271 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-15 02:43:39,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:43:39,456 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:43:39,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:43:39,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1746772058, now seen corresponding path program 1 times [2022-04-15 02:43:39,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:43:39,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668109046] [2022-04-15 02:43:39,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:43:39,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:43:39,477 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:43:39,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1956416345] [2022-04-15 02:43:39,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:43:39,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:43:39,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:43:39,487 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-15 02:43:39,489 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-15 02:43:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:43:39,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 02:43:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:43:39,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:43:40,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {4305#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {4305#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4305#true} is VALID [2022-04-15 02:43:40,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {4305#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4305#true} {4305#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {4305#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {4305#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4305#true} is VALID [2022-04-15 02:43:40,096 INFO L272 TraceCheckUtils]: 6: Hoare triple {4305#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-15 02:43:40,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {4305#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4305#true} is VALID [2022-04-15 02:43:40,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {4305#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {4305#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,096 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4305#true} {4305#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-15 02:43:40,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {4305#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {4305#true} is VALID [2022-04-15 02:43:40,097 INFO L272 TraceCheckUtils]: 12: Hoare triple {4305#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-15 02:43:40,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {4305#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4305#true} is VALID [2022-04-15 02:43:40,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {4305#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {4305#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,104 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4305#true} {4305#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-15 02:43:40,105 INFO L272 TraceCheckUtils]: 17: Hoare triple {4305#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-15 02:43:40,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {4305#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4364#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:43:40,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {4364#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4368#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:43:40,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {4368#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4368#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:43:40,106 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4368#(not (= |assume_abort_if_not_#in~cond| 0))} {4305#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4375#(<= 1 main_~x~0)} is VALID [2022-04-15 02:43:40,107 INFO L272 TraceCheckUtils]: 22: Hoare triple {4375#(<= 1 main_~x~0)} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-15 02:43:40,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {4305#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4305#true} is VALID [2022-04-15 02:43:40,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {4305#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {4305#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,107 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4305#true} {4375#(<= 1 main_~x~0)} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4375#(<= 1 main_~x~0)} is VALID [2022-04-15 02:43:40,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {4375#(<= 1 main_~x~0)} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:43:40,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:43:40,108 INFO L272 TraceCheckUtils]: 29: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4305#true} is VALID [2022-04-15 02:43:40,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4305#true} is VALID [2022-04-15 02:43:40,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {4305#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {4305#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,109 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4305#true} {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:43:40,110 INFO L272 TraceCheckUtils]: 34: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4305#true} is VALID [2022-04-15 02:43:40,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4305#true} is VALID [2022-04-15 02:43:40,110 INFO L290 TraceCheckUtils]: 36: Hoare triple {4305#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,110 INFO L290 TraceCheckUtils]: 37: Hoare triple {4305#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,110 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4305#true} {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:43:40,111 INFO L272 TraceCheckUtils]: 39: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4305#true} is VALID [2022-04-15 02:43:40,111 INFO L290 TraceCheckUtils]: 40: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4305#true} is VALID [2022-04-15 02:43:40,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {4305#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,111 INFO L290 TraceCheckUtils]: 42: Hoare triple {4305#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,112 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4305#true} {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:43:40,112 INFO L290 TraceCheckUtils]: 44: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 02:43:40,113 INFO L290 TraceCheckUtils]: 45: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [127] L43-->L43-2: Formula: (and (not (< v_main_~b~0_4 v_main_~a~0_4)) (= v_main_~b~0_3 (+ v_main_~b~0_4 (* (- 1) v_main_~a~0_4))) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-15 02:43:40,113 INFO L290 TraceCheckUtils]: 46: Hoare triple {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-15 02:43:40,114 INFO L272 TraceCheckUtils]: 47: Hoare triple {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4305#true} is VALID [2022-04-15 02:43:40,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4305#true} is VALID [2022-04-15 02:43:40,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {4305#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,114 INFO L290 TraceCheckUtils]: 50: Hoare triple {4305#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:40,114 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4305#true} {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-15 02:43:40,115 INFO L272 TraceCheckUtils]: 52: Hoare triple {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4305#true} is VALID [2022-04-15 02:43:40,115 INFO L290 TraceCheckUtils]: 53: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4474#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:43:40,115 INFO L290 TraceCheckUtils]: 54: Hoare triple {4474#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:43:40,116 INFO L290 TraceCheckUtils]: 55: Hoare triple {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:43:40,117 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4485#(and (<= 1 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ main_~q~0 1) 0))} is VALID [2022-04-15 02:43:40,118 INFO L272 TraceCheckUtils]: 57: Hoare triple {4485#(and (<= 1 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ main_~q~0 1) 0))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4489#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:43:40,118 INFO L290 TraceCheckUtils]: 58: Hoare triple {4489#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4493#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:43:40,118 INFO L290 TraceCheckUtils]: 59: Hoare triple {4493#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {4306#false} is VALID [2022-04-15 02:43:40,118 INFO L290 TraceCheckUtils]: 60: Hoare triple {4306#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4306#false} is VALID [2022-04-15 02:43:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-15 02:43:40,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:43:53,340 INFO L290 TraceCheckUtils]: 60: Hoare triple {4306#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4306#false} is VALID [2022-04-15 02:43:53,341 INFO L290 TraceCheckUtils]: 59: Hoare triple {4493#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {4306#false} is VALID [2022-04-15 02:43:53,341 INFO L290 TraceCheckUtils]: 58: Hoare triple {4489#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4493#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 02:43:53,342 INFO L272 TraceCheckUtils]: 57: Hoare triple {4509#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4489#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 02:43:53,343 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4509#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 02:43:53,344 INFO L290 TraceCheckUtils]: 55: Hoare triple {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:43:53,344 INFO L290 TraceCheckUtils]: 54: Hoare triple {4523#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 02:43:53,345 INFO L290 TraceCheckUtils]: 53: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4523#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 02:43:53,345 INFO L272 TraceCheckUtils]: 52: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4305#true} is VALID [2022-04-15 02:43:53,345 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4305#true} {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-15 02:43:53,346 INFO L290 TraceCheckUtils]: 50: Hoare triple {4305#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:53,346 INFO L290 TraceCheckUtils]: 49: Hoare triple {4305#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:53,346 INFO L290 TraceCheckUtils]: 48: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4305#true} is VALID [2022-04-15 02:43:53,346 INFO L272 TraceCheckUtils]: 47: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4305#true} is VALID [2022-04-15 02:43:53,347 INFO L290 TraceCheckUtils]: 46: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-15 02:43:54,504 INFO L290 TraceCheckUtils]: 45: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [127] L43-->L43-2: Formula: (and (not (< v_main_~b~0_4 v_main_~a~0_4)) (= v_main_~b~0_3 (+ v_main_~b~0_4 (* (- 1) v_main_~a~0_4))) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-15 02:43:54,505 INFO L290 TraceCheckUtils]: 44: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-15 02:43:54,506 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4305#true} {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-15 02:43:54,506 INFO L290 TraceCheckUtils]: 42: Hoare triple {4305#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,506 INFO L290 TraceCheckUtils]: 41: Hoare triple {4305#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4305#true} is VALID [2022-04-15 02:43:54,506 INFO L272 TraceCheckUtils]: 39: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4305#true} is VALID [2022-04-15 02:43:54,507 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4305#true} {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-15 02:43:54,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {4305#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {4305#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4305#true} is VALID [2022-04-15 02:43:54,507 INFO L272 TraceCheckUtils]: 34: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4305#true} is VALID [2022-04-15 02:43:54,508 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4305#true} {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-15 02:43:54,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {4305#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {4305#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {4305#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4305#true} is VALID [2022-04-15 02:43:54,508 INFO L272 TraceCheckUtils]: 29: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4305#true} is VALID [2022-04-15 02:43:54,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-15 02:43:54,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {4305#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-15 02:43:54,509 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4305#true} {4305#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-15 02:43:54,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {4305#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {4305#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {4305#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4305#true} is VALID [2022-04-15 02:43:54,509 INFO L272 TraceCheckUtils]: 22: Hoare triple {4305#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-15 02:43:54,510 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4305#true} {4305#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-15 02:43:54,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {4305#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {4305#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {4305#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4305#true} is VALID [2022-04-15 02:43:54,510 INFO L272 TraceCheckUtils]: 17: Hoare triple {4305#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-15 02:43:54,510 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4305#true} {4305#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-15 02:43:54,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {4305#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {4305#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {4305#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4305#true} is VALID [2022-04-15 02:43:54,510 INFO L272 TraceCheckUtils]: 12: Hoare triple {4305#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-15 02:43:54,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {4305#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {4305#true} is VALID [2022-04-15 02:43:54,510 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4305#true} {4305#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-15 02:43:54,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {4305#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {4305#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {4305#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4305#true} is VALID [2022-04-15 02:43:54,511 INFO L272 TraceCheckUtils]: 6: Hoare triple {4305#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4305#true} is VALID [2022-04-15 02:43:54,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {4305#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4305#true} is VALID [2022-04-15 02:43:54,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {4305#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4305#true} {4305#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {4305#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {4305#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4305#true} is VALID [2022-04-15 02:43:54,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {4305#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4305#true} is VALID [2022-04-15 02:43:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-15 02:43:54,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:43:54,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668109046] [2022-04-15 02:43:54,512 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:43:54,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956416345] [2022-04-15 02:43:54,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956416345] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:43:54,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 02:43:54,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-15 02:43:54,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847877993] [2022-04-15 02:43:54,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 02:43:54,513 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) Word has length 61 [2022-04-15 02:43:54,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:43:54,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-15 02:43:54,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:43:54,649 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 02:43:54,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:43:54,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 02:43:54,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-15 02:43:54,650 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-15 02:43:57,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:43:57,005 INFO L93 Difference]: Finished difference Result 133 states and 166 transitions. [2022-04-15 02:43:57,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 02:43:57,005 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) Word has length 61 [2022-04-15 02:43:57,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:43:57,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-15 02:43:57,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 98 transitions. [2022-04-15 02:43:57,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-15 02:43:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 98 transitions. [2022-04-15 02:43:57,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 98 transitions. [2022-04-15 02:43:57,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:43:57,169 INFO L225 Difference]: With dead ends: 133 [2022-04-15 02:43:57,169 INFO L226 Difference]: Without dead ends: 122 [2022-04-15 02:43:57,170 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-15 02:43:57,170 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 02:43:57,171 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 159 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 02:43:57,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-15 02:43:57,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2022-04-15 02:43:57,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:43:57,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 02:43:57,282 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 02:43:57,282 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 02:43:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:43:57,294 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2022-04-15 02:43:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2022-04-15 02:43:57,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:43:57,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:43:57,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 122 states. [2022-04-15 02:43:57,295 INFO L87 Difference]: Start difference. First operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 122 states. [2022-04-15 02:43:57,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:43:57,298 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2022-04-15 02:43:57,298 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2022-04-15 02:43:57,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:43:57,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:43:57,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:43:57,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:43:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 02:43:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2022-04-15 02:43:57,304 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 61 [2022-04-15 02:43:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:43:57,304 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2022-04-15 02:43:57,304 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-15 02:43:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-04-15 02:43:57,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 02:43:57,305 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:43:57,305 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:43:57,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 02:43:57,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-15 02:43:57,531 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:43:57,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:43:57,532 INFO L85 PathProgramCache]: Analyzing trace with hash -296466288, now seen corresponding path program 1 times [2022-04-15 02:43:57,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:43:57,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679031159] [2022-04-15 02:43:57,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:43:57,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:43:57,551 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:43:57,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [30972788] [2022-04-15 02:43:57,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:43:57,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:43:57,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:43:57,553 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:43:57,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 02:43:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:43:57,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 02:43:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:43:57,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:43:58,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {5295#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {5295#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5295#true} is VALID [2022-04-15 02:43:58,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {5295#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5295#true} {5295#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {5295#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {5295#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5295#true} is VALID [2022-04-15 02:43:58,031 INFO L272 TraceCheckUtils]: 6: Hoare triple {5295#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5295#true} is VALID [2022-04-15 02:43:58,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {5295#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5321#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:43:58,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {5321#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5325#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:43:58,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {5325#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5325#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:43:58,032 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5325#(not (= |assume_abort_if_not_#in~cond| 0))} {5295#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:43:58,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:43:58,033 INFO L272 TraceCheckUtils]: 12: Hoare triple {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5295#true} is VALID [2022-04-15 02:43:58,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {5295#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5295#true} is VALID [2022-04-15 02:43:58,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {5295#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {5295#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,034 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5295#true} {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:43:58,034 INFO L272 TraceCheckUtils]: 17: Hoare triple {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5295#true} is VALID [2022-04-15 02:43:58,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {5295#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5295#true} is VALID [2022-04-15 02:43:58,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {5295#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {5295#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,037 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5295#true} {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:43:58,037 INFO L272 TraceCheckUtils]: 22: Hoare triple {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5295#true} is VALID [2022-04-15 02:43:58,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {5295#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5295#true} is VALID [2022-04-15 02:43:58,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {5295#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {5295#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,038 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5295#true} {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 02:43:58,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5384#(<= main_~a~0 2)} is VALID [2022-04-15 02:43:58,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {5384#(<= main_~a~0 2)} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5384#(<= main_~a~0 2)} is VALID [2022-04-15 02:43:58,039 INFO L272 TraceCheckUtils]: 29: Hoare triple {5384#(<= main_~a~0 2)} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5295#true} is VALID [2022-04-15 02:43:58,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5295#true} is VALID [2022-04-15 02:43:58,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {5295#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,040 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5384#(<= main_~a~0 2)} is VALID [2022-04-15 02:43:58,040 INFO L272 TraceCheckUtils]: 34: Hoare triple {5384#(<= main_~a~0 2)} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5295#true} is VALID [2022-04-15 02:43:58,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5295#true} is VALID [2022-04-15 02:43:58,040 INFO L290 TraceCheckUtils]: 36: Hoare triple {5295#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,040 INFO L290 TraceCheckUtils]: 37: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,041 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5384#(<= main_~a~0 2)} is VALID [2022-04-15 02:43:58,041 INFO L272 TraceCheckUtils]: 39: Hoare triple {5384#(<= main_~a~0 2)} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5295#true} is VALID [2022-04-15 02:43:58,041 INFO L290 TraceCheckUtils]: 40: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5295#true} is VALID [2022-04-15 02:43:58,041 INFO L290 TraceCheckUtils]: 41: Hoare triple {5295#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,041 INFO L290 TraceCheckUtils]: 42: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,041 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5384#(<= main_~a~0 2)} is VALID [2022-04-15 02:43:58,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {5384#(<= main_~a~0 2)} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {5384#(<= main_~a~0 2)} is VALID [2022-04-15 02:43:58,044 INFO L290 TraceCheckUtils]: 45: Hoare triple {5384#(<= main_~a~0 2)} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-15 02:43:58,044 INFO L290 TraceCheckUtils]: 46: Hoare triple {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-15 02:43:58,044 INFO L272 TraceCheckUtils]: 47: Hoare triple {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5295#true} is VALID [2022-04-15 02:43:58,044 INFO L290 TraceCheckUtils]: 48: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5295#true} is VALID [2022-04-15 02:43:58,044 INFO L290 TraceCheckUtils]: 49: Hoare triple {5295#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,044 INFO L290 TraceCheckUtils]: 50: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,045 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5295#true} {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-15 02:43:58,045 INFO L272 TraceCheckUtils]: 52: Hoare triple {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5295#true} is VALID [2022-04-15 02:43:58,045 INFO L290 TraceCheckUtils]: 53: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5295#true} is VALID [2022-04-15 02:43:58,045 INFO L290 TraceCheckUtils]: 54: Hoare triple {5295#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,045 INFO L290 TraceCheckUtils]: 55: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,046 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5295#true} {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-15 02:43:58,046 INFO L272 TraceCheckUtils]: 57: Hoare triple {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5295#true} is VALID [2022-04-15 02:43:58,046 INFO L290 TraceCheckUtils]: 58: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5295#true} is VALID [2022-04-15 02:43:58,046 INFO L290 TraceCheckUtils]: 59: Hoare triple {5295#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,046 INFO L290 TraceCheckUtils]: 60: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,047 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5295#true} {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-15 02:43:58,047 INFO L290 TraceCheckUtils]: 62: Hoare triple {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {5491#(and (< 0 main_~a~0) (not (= main_~b~0 main_~a~0)) (< main_~b~0 2))} is VALID [2022-04-15 02:43:58,048 INFO L290 TraceCheckUtils]: 63: Hoare triple {5491#(and (< 0 main_~a~0) (not (= main_~b~0 main_~a~0)) (< main_~b~0 2))} [127] L43-->L43-2: Formula: (and (not (< v_main_~b~0_4 v_main_~a~0_4)) (= v_main_~b~0_3 (+ v_main_~b~0_4 (* (- 1) v_main_~a~0_4))) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {5296#false} is VALID [2022-04-15 02:43:58,048 INFO L290 TraceCheckUtils]: 64: Hoare triple {5296#false} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5296#false} is VALID [2022-04-15 02:43:58,048 INFO L272 TraceCheckUtils]: 65: Hoare triple {5296#false} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5296#false} is VALID [2022-04-15 02:43:58,048 INFO L290 TraceCheckUtils]: 66: Hoare triple {5296#false} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5296#false} is VALID [2022-04-15 02:43:58,048 INFO L290 TraceCheckUtils]: 67: Hoare triple {5296#false} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {5296#false} is VALID [2022-04-15 02:43:58,048 INFO L290 TraceCheckUtils]: 68: Hoare triple {5296#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5296#false} is VALID [2022-04-15 02:43:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-15 02:43:58,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:43:58,529 INFO L290 TraceCheckUtils]: 68: Hoare triple {5296#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5296#false} is VALID [2022-04-15 02:43:58,529 INFO L290 TraceCheckUtils]: 67: Hoare triple {5296#false} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {5296#false} is VALID [2022-04-15 02:43:58,529 INFO L290 TraceCheckUtils]: 66: Hoare triple {5296#false} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5296#false} is VALID [2022-04-15 02:43:58,529 INFO L272 TraceCheckUtils]: 65: Hoare triple {5296#false} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5296#false} is VALID [2022-04-15 02:43:58,529 INFO L290 TraceCheckUtils]: 64: Hoare triple {5296#false} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5296#false} is VALID [2022-04-15 02:43:58,530 INFO L290 TraceCheckUtils]: 63: Hoare triple {5525#(< main_~b~0 main_~a~0)} [127] L43-->L43-2: Formula: (and (not (< v_main_~b~0_4 v_main_~a~0_4)) (= v_main_~b~0_3 (+ v_main_~b~0_4 (* (- 1) v_main_~a~0_4))) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {5296#false} is VALID [2022-04-15 02:43:58,530 INFO L290 TraceCheckUtils]: 62: Hoare triple {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {5525#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 02:43:58,531 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5295#true} {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-15 02:43:58,531 INFO L290 TraceCheckUtils]: 60: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,531 INFO L290 TraceCheckUtils]: 59: Hoare triple {5295#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,531 INFO L290 TraceCheckUtils]: 58: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5295#true} is VALID [2022-04-15 02:43:58,531 INFO L272 TraceCheckUtils]: 57: Hoare triple {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5295#true} is VALID [2022-04-15 02:43:58,531 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5295#true} {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-15 02:43:58,532 INFO L290 TraceCheckUtils]: 55: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,532 INFO L290 TraceCheckUtils]: 54: Hoare triple {5295#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,532 INFO L290 TraceCheckUtils]: 53: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5295#true} is VALID [2022-04-15 02:43:58,532 INFO L272 TraceCheckUtils]: 52: Hoare triple {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5295#true} is VALID [2022-04-15 02:43:58,532 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5295#true} {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-15 02:43:58,532 INFO L290 TraceCheckUtils]: 50: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,533 INFO L290 TraceCheckUtils]: 49: Hoare triple {5295#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,533 INFO L290 TraceCheckUtils]: 48: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5295#true} is VALID [2022-04-15 02:43:58,533 INFO L272 TraceCheckUtils]: 47: Hoare triple {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5295#true} is VALID [2022-04-15 02:43:58,533 INFO L290 TraceCheckUtils]: 46: Hoare triple {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-15 02:43:58,534 INFO L290 TraceCheckUtils]: 45: Hoare triple {5384#(<= main_~a~0 2)} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-15 02:43:58,534 INFO L290 TraceCheckUtils]: 44: Hoare triple {5384#(<= main_~a~0 2)} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {5384#(<= main_~a~0 2)} is VALID [2022-04-15 02:43:58,535 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5384#(<= main_~a~0 2)} is VALID [2022-04-15 02:43:58,535 INFO L290 TraceCheckUtils]: 42: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,535 INFO L290 TraceCheckUtils]: 41: Hoare triple {5295#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,535 INFO L290 TraceCheckUtils]: 40: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5295#true} is VALID [2022-04-15 02:43:58,535 INFO L272 TraceCheckUtils]: 39: Hoare triple {5384#(<= main_~a~0 2)} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5295#true} is VALID [2022-04-15 02:43:58,547 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5384#(<= main_~a~0 2)} is VALID [2022-04-15 02:43:58,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {5295#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5295#true} is VALID [2022-04-15 02:43:58,548 INFO L272 TraceCheckUtils]: 34: Hoare triple {5384#(<= main_~a~0 2)} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5295#true} is VALID [2022-04-15 02:43:58,549 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5384#(<= main_~a~0 2)} is VALID [2022-04-15 02:43:58,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {5295#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {5295#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {5295#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5295#true} is VALID [2022-04-15 02:43:58,549 INFO L272 TraceCheckUtils]: 29: Hoare triple {5384#(<= main_~a~0 2)} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {5295#true} is VALID [2022-04-15 02:43:58,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {5384#(<= main_~a~0 2)} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5384#(<= main_~a~0 2)} is VALID [2022-04-15 02:43:58,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {5635#(<= main_~x~0 2)} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5384#(<= main_~a~0 2)} is VALID [2022-04-15 02:43:58,550 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5295#true} {5635#(<= main_~x~0 2)} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5635#(<= main_~x~0 2)} is VALID [2022-04-15 02:43:58,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {5295#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {5295#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {5295#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5295#true} is VALID [2022-04-15 02:43:58,550 INFO L272 TraceCheckUtils]: 22: Hoare triple {5635#(<= main_~x~0 2)} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5295#true} is VALID [2022-04-15 02:43:58,551 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5295#true} {5635#(<= main_~x~0 2)} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5635#(<= main_~x~0 2)} is VALID [2022-04-15 02:43:58,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {5295#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {5295#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {5295#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5295#true} is VALID [2022-04-15 02:43:58,551 INFO L272 TraceCheckUtils]: 17: Hoare triple {5635#(<= main_~x~0 2)} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5295#true} is VALID [2022-04-15 02:43:58,552 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5295#true} {5635#(<= main_~x~0 2)} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5635#(<= main_~x~0 2)} is VALID [2022-04-15 02:43:58,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {5295#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {5295#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {5295#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5295#true} is VALID [2022-04-15 02:43:58,552 INFO L272 TraceCheckUtils]: 12: Hoare triple {5635#(<= main_~x~0 2)} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5295#true} is VALID [2022-04-15 02:43:58,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {5635#(<= main_~x~0 2)} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {5635#(<= main_~x~0 2)} is VALID [2022-04-15 02:43:58,553 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5325#(not (= |assume_abort_if_not_#in~cond| 0))} {5295#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5635#(<= main_~x~0 2)} is VALID [2022-04-15 02:43:58,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {5325#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5325#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:43:58,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {5696#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5325#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:43:58,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {5295#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5696#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 02:43:58,554 INFO L272 TraceCheckUtils]: 6: Hoare triple {5295#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5295#true} is VALID [2022-04-15 02:43:58,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {5295#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5295#true} is VALID [2022-04-15 02:43:58,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {5295#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5295#true} {5295#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {5295#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {5295#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5295#true} is VALID [2022-04-15 02:43:58,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {5295#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5295#true} is VALID [2022-04-15 02:43:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-15 02:43:58,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:43:58,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679031159] [2022-04-15 02:43:58,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:43:58,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30972788] [2022-04-15 02:43:58,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30972788] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:43:58,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 02:43:58,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-15 02:43:58,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401210843] [2022-04-15 02:43:58,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 02:43:58,556 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 69 [2022-04-15 02:43:58,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:43:58,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-15 02:43:58,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:43:58,614 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 02:43:58,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:43:58,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 02:43:58,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-15 02:43:58,615 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-15 02:43:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:43:59,126 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-04-15 02:43:59,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 02:43:59,126 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 69 [2022-04-15 02:43:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:43:59,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-15 02:43:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-15 02:43:59,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-15 02:43:59,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-15 02:43:59,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 71 transitions. [2022-04-15 02:43:59,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:43:59,198 INFO L225 Difference]: With dead ends: 138 [2022-04-15 02:43:59,198 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 02:43:59,198 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-04-15 02:43:59,199 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 23 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 02:43:59,199 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 141 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 02:43:59,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 02:43:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-15 02:43:59,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:43:59,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 02:43:59,269 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 02:43:59,269 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 02:43:59,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:43:59,271 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-04-15 02:43:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-04-15 02:43:59,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:43:59,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:43:59,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 86 states. [2022-04-15 02:43:59,272 INFO L87 Difference]: Start difference. First operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 86 states. [2022-04-15 02:43:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:43:59,274 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-04-15 02:43:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-04-15 02:43:59,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:43:59,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:43:59,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:43:59,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:43:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 02:43:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-04-15 02:43:59,276 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 69 [2022-04-15 02:43:59,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:43:59,276 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-04-15 02:43:59,277 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-15 02:43:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-04-15 02:43:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 02:43:59,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 02:43:59,277 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:43:59,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 02:43:59,499 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 02:43:59,500 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 02:43:59,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 02:43:59,500 INFO L85 PathProgramCache]: Analyzing trace with hash -392102192, now seen corresponding path program 2 times [2022-04-15 02:43:59,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 02:43:59,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433569602] [2022-04-15 02:43:59,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 02:43:59,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 02:43:59,516 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 02:43:59,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1047414737] [2022-04-15 02:43:59,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 02:43:59,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 02:43:59,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 02:43:59,519 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 02:43:59,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 02:43:59,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 02:43:59,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 02:43:59,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 02:43:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 02:43:59,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 02:43:59,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {6224#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {6224#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6224#true} is VALID [2022-04-15 02:43:59,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {6224#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6224#true} {6224#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {6224#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {6224#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6224#true} is VALID [2022-04-15 02:43:59,968 INFO L272 TraceCheckUtils]: 6: Hoare triple {6224#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-15 02:43:59,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {6224#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {6224#true} is VALID [2022-04-15 02:43:59,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {6224#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {6224#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,969 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6224#true} {6224#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-15 02:43:59,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {6224#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {6224#true} is VALID [2022-04-15 02:43:59,969 INFO L272 TraceCheckUtils]: 12: Hoare triple {6224#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-15 02:43:59,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {6224#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {6268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 02:43:59,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {6268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {6272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:43:59,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {6272#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:43:59,970 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6272#(not (= |assume_abort_if_not_#in~cond| 0))} {6224#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 02:43:59,970 INFO L272 TraceCheckUtils]: 17: Hoare triple {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-15 02:43:59,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {6224#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {6224#true} is VALID [2022-04-15 02:43:59,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {6224#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {6224#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,971 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6224#true} {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 02:43:59,971 INFO L272 TraceCheckUtils]: 22: Hoare triple {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-15 02:43:59,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {6224#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {6224#true} is VALID [2022-04-15 02:43:59,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {6224#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {6224#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,972 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6224#true} {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 02:43:59,972 INFO L290 TraceCheckUtils]: 27: Hoare triple {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6313#(<= main_~b~0 2)} is VALID [2022-04-15 02:43:59,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {6313#(<= main_~b~0 2)} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6313#(<= main_~b~0 2)} is VALID [2022-04-15 02:43:59,972 INFO L272 TraceCheckUtils]: 29: Hoare triple {6313#(<= main_~b~0 2)} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6224#true} is VALID [2022-04-15 02:43:59,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6224#true} is VALID [2022-04-15 02:43:59,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {6224#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,973 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6313#(<= main_~b~0 2)} is VALID [2022-04-15 02:43:59,973 INFO L272 TraceCheckUtils]: 34: Hoare triple {6313#(<= main_~b~0 2)} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6224#true} is VALID [2022-04-15 02:43:59,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6224#true} is VALID [2022-04-15 02:43:59,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {6224#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,974 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6313#(<= main_~b~0 2)} is VALID [2022-04-15 02:43:59,974 INFO L272 TraceCheckUtils]: 39: Hoare triple {6313#(<= main_~b~0 2)} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6224#true} is VALID [2022-04-15 02:43:59,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6224#true} is VALID [2022-04-15 02:43:59,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {6224#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,975 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6313#(<= main_~b~0 2)} is VALID [2022-04-15 02:43:59,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {6313#(<= main_~b~0 2)} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {6365#(and (<= main_~b~0 2) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-15 02:43:59,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {6365#(and (<= main_~b~0 2) (not (= main_~b~0 main_~a~0)))} [127] L43-->L43-2: Formula: (and (not (< v_main_~b~0_4 v_main_~a~0_4)) (= v_main_~b~0_3 (+ v_main_~b~0_4 (* (- 1) v_main_~a~0_4))) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-15 02:43:59,979 INFO L290 TraceCheckUtils]: 46: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-15 02:43:59,980 INFO L272 TraceCheckUtils]: 47: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6224#true} is VALID [2022-04-15 02:43:59,980 INFO L290 TraceCheckUtils]: 48: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6224#true} is VALID [2022-04-15 02:43:59,980 INFO L290 TraceCheckUtils]: 49: Hoare triple {6224#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,980 INFO L290 TraceCheckUtils]: 50: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,980 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6224#true} {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-15 02:43:59,981 INFO L272 TraceCheckUtils]: 52: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6224#true} is VALID [2022-04-15 02:43:59,981 INFO L290 TraceCheckUtils]: 53: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6224#true} is VALID [2022-04-15 02:43:59,981 INFO L290 TraceCheckUtils]: 54: Hoare triple {6224#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,981 INFO L290 TraceCheckUtils]: 55: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,981 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6224#true} {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-15 02:43:59,981 INFO L272 TraceCheckUtils]: 57: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6224#true} is VALID [2022-04-15 02:43:59,981 INFO L290 TraceCheckUtils]: 58: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6224#true} is VALID [2022-04-15 02:43:59,982 INFO L290 TraceCheckUtils]: 59: Hoare triple {6224#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,982 INFO L290 TraceCheckUtils]: 60: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:43:59,982 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6224#true} {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-15 02:43:59,983 INFO L290 TraceCheckUtils]: 62: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-15 02:43:59,983 INFO L290 TraceCheckUtils]: 63: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {6225#false} is VALID [2022-04-15 02:43:59,983 INFO L290 TraceCheckUtils]: 64: Hoare triple {6225#false} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6225#false} is VALID [2022-04-15 02:43:59,983 INFO L272 TraceCheckUtils]: 65: Hoare triple {6225#false} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6225#false} is VALID [2022-04-15 02:43:59,984 INFO L290 TraceCheckUtils]: 66: Hoare triple {6225#false} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6225#false} is VALID [2022-04-15 02:43:59,984 INFO L290 TraceCheckUtils]: 67: Hoare triple {6225#false} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {6225#false} is VALID [2022-04-15 02:43:59,984 INFO L290 TraceCheckUtils]: 68: Hoare triple {6225#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6225#false} is VALID [2022-04-15 02:43:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-15 02:43:59,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 02:44:00,433 INFO L290 TraceCheckUtils]: 68: Hoare triple {6225#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6225#false} is VALID [2022-04-15 02:44:00,434 INFO L290 TraceCheckUtils]: 67: Hoare triple {6225#false} [116] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {6225#false} is VALID [2022-04-15 02:44:00,434 INFO L290 TraceCheckUtils]: 66: Hoare triple {6225#false} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6225#false} is VALID [2022-04-15 02:44:00,434 INFO L272 TraceCheckUtils]: 65: Hoare triple {6225#false} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6225#false} is VALID [2022-04-15 02:44:00,434 INFO L290 TraceCheckUtils]: 64: Hoare triple {6225#false} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6225#false} is VALID [2022-04-15 02:44:00,435 INFO L290 TraceCheckUtils]: 63: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {6225#false} is VALID [2022-04-15 02:44:00,435 INFO L290 TraceCheckUtils]: 62: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 02:44:00,436 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6224#true} {6454#(not (< main_~b~0 main_~a~0))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 02:44:00,436 INFO L290 TraceCheckUtils]: 60: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,436 INFO L290 TraceCheckUtils]: 59: Hoare triple {6224#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,436 INFO L290 TraceCheckUtils]: 58: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6224#true} is VALID [2022-04-15 02:44:00,436 INFO L272 TraceCheckUtils]: 57: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6224#true} is VALID [2022-04-15 02:44:00,437 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6224#true} {6454#(not (< main_~b~0 main_~a~0))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 02:44:00,437 INFO L290 TraceCheckUtils]: 55: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,437 INFO L290 TraceCheckUtils]: 54: Hoare triple {6224#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,437 INFO L290 TraceCheckUtils]: 53: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6224#true} is VALID [2022-04-15 02:44:00,437 INFO L272 TraceCheckUtils]: 52: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6224#true} is VALID [2022-04-15 02:44:00,438 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6224#true} {6454#(not (< main_~b~0 main_~a~0))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 02:44:00,438 INFO L290 TraceCheckUtils]: 50: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,438 INFO L290 TraceCheckUtils]: 49: Hoare triple {6224#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,438 INFO L290 TraceCheckUtils]: 48: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6224#true} is VALID [2022-04-15 02:44:00,438 INFO L272 TraceCheckUtils]: 47: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6224#true} is VALID [2022-04-15 02:44:00,439 INFO L290 TraceCheckUtils]: 46: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 02:44:00,440 INFO L290 TraceCheckUtils]: 45: Hoare triple {6509#(or (< main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0))} [127] L43-->L43-2: Formula: (and (not (< v_main_~b~0_4 v_main_~a~0_4)) (= v_main_~b~0_3 (+ v_main_~b~0_4 (* (- 1) v_main_~a~0_4))) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-15 02:44:00,440 INFO L290 TraceCheckUtils]: 44: Hoare triple {6313#(<= main_~b~0 2)} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {6509#(or (< main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0))} is VALID [2022-04-15 02:44:00,441 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6313#(<= main_~b~0 2)} is VALID [2022-04-15 02:44:00,441 INFO L290 TraceCheckUtils]: 42: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {6224#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6224#true} is VALID [2022-04-15 02:44:00,441 INFO L272 TraceCheckUtils]: 39: Hoare triple {6313#(<= main_~b~0 2)} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6224#true} is VALID [2022-04-15 02:44:00,442 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6313#(<= main_~b~0 2)} is VALID [2022-04-15 02:44:00,442 INFO L290 TraceCheckUtils]: 37: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {6224#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6224#true} is VALID [2022-04-15 02:44:00,443 INFO L272 TraceCheckUtils]: 34: Hoare triple {6313#(<= main_~b~0 2)} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6224#true} is VALID [2022-04-15 02:44:00,443 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6313#(<= main_~b~0 2)} is VALID [2022-04-15 02:44:00,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {6224#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {6224#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {6224#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6224#true} is VALID [2022-04-15 02:44:00,444 INFO L272 TraceCheckUtils]: 29: Hoare triple {6313#(<= main_~b~0 2)} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6224#true} is VALID [2022-04-15 02:44:00,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {6313#(<= main_~b~0 2)} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6313#(<= main_~b~0 2)} is VALID [2022-04-15 02:44:00,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {6564#(<= main_~y~0 2)} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6313#(<= main_~b~0 2)} is VALID [2022-04-15 02:44:00,445 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6224#true} {6564#(<= main_~y~0 2)} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6564#(<= main_~y~0 2)} is VALID [2022-04-15 02:44:00,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {6224#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {6224#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {6224#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {6224#true} is VALID [2022-04-15 02:44:00,445 INFO L272 TraceCheckUtils]: 22: Hoare triple {6564#(<= main_~y~0 2)} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-15 02:44:00,446 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6224#true} {6564#(<= main_~y~0 2)} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6564#(<= main_~y~0 2)} is VALID [2022-04-15 02:44:00,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {6224#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {6224#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {6224#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {6224#true} is VALID [2022-04-15 02:44:00,446 INFO L272 TraceCheckUtils]: 17: Hoare triple {6564#(<= main_~y~0 2)} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-15 02:44:00,447 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6272#(not (= |assume_abort_if_not_#in~cond| 0))} {6224#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6564#(<= main_~y~0 2)} is VALID [2022-04-15 02:44:00,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {6272#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:44:00,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {6607#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {6272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 02:44:00,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {6224#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {6607#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 02:44:00,448 INFO L272 TraceCheckUtils]: 12: Hoare triple {6224#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 2) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-15 02:44:00,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {6224#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {6224#true} is VALID [2022-04-15 02:44:00,448 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6224#true} {6224#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-15 02:44:00,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {6224#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {6224#true} [102] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {6224#true} [99] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {6224#true} is VALID [2022-04-15 02:44:00,448 INFO L272 TraceCheckUtils]: 6: Hoare triple {6224#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 2) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6224#true} is VALID [2022-04-15 02:44:00,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {6224#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6224#true} is VALID [2022-04-15 02:44:00,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {6224#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6224#true} {6224#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {6224#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {6224#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6224#true} is VALID [2022-04-15 02:44:00,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {6224#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#true} is VALID [2022-04-15 02:44:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-15 02:44:00,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 02:44:00,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433569602] [2022-04-15 02:44:00,450 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 02:44:00,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047414737] [2022-04-15 02:44:00,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047414737] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 02:44:00,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 02:44:00,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-15 02:44:00,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532565179] [2022-04-15 02:44:00,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 02:44:00,451 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 69 [2022-04-15 02:44:00,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 02:44:00,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-15 02:44:00,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:44:00,512 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 02:44:00,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 02:44:00,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 02:44:00,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-15 02:44:00,513 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-15 02:44:01,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:44:01,015 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2022-04-15 02:44:01,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 02:44:01,015 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 69 [2022-04-15 02:44:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 02:44:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-15 02:44:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2022-04-15 02:44:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-15 02:44:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2022-04-15 02:44:01,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 61 transitions. [2022-04-15 02:44:01,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 02:44:01,079 INFO L225 Difference]: With dead ends: 90 [2022-04-15 02:44:01,079 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 02:44:01,080 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-04-15 02:44:01,081 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 02:44:01,081 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 174 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 02:44:01,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 02:44:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 02:44:01,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 02:44:01,082 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-15 02:44:01,082 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-15 02:44:01,082 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-15 02:44:01,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:44:01,082 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 02:44:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 02:44:01,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:44:01,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:44:01,082 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-15 02:44:01,082 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-15 02:44:01,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 02:44:01,083 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 02:44:01,083 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 02:44:01,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:44:01,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 02:44:01,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 02:44:01,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 02:44:01,083 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-15 02:44:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 02:44:01,083 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2022-04-15 02:44:01,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 02:44:01,083 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 02:44:01,084 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-15 02:44:01,084 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 02:44:01,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 02:44:01,086 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 02:44:01,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 02:44:01,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 02:44:01,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 02:44:03,821 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 02:44:03,821 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 02:44:03,821 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 02:44:03,821 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 02:44:03,821 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 02:44:03,821 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 02:44:03,821 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 02:44:03,821 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-04-15 02:44:03,821 INFO L882 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-15 02:44:03,821 INFO L882 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2022-04-15 02:44:03,821 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2022-04-15 02:44:03,821 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 18 59) the Hoare annotation is: true [2022-04-15 02:44:03,821 INFO L885 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2022-04-15 02:44:03,821 INFO L882 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-04-15 02:44:03,821 INFO L878 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 2)) [2022-04-15 02:44:03,822 INFO L878 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2)) [2022-04-15 02:44:03,822 INFO L878 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2)) [2022-04-15 02:44:03,822 INFO L882 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-15 02:44:03,822 INFO L878 garLoopResultBuilder]: At program point L43-2(lines 35 52) the Hoare annotation is: (let ((.cse1 (<= main_~y~0 2)) (.cse2 (= main_~s~0 1)) (.cse7 (= main_~a~0 main_~x~0)) (.cse10 (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (.cse0 (<= 1 main_~x~0)) (.cse3 (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (.cse4 (= main_~b~0 main_~y~0)) (.cse5 (= main_~q~0 0)) (.cse6 (<= 1 main_~y~0)) (.cse8 (<= main_~x~0 2)) (.cse9 (= main_~p~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 (< main_~a~0 2) (< 0 main_~b~0) .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse3 .cse4 (< 0 main_~a~0) .cse5 .cse6 (< main_~b~0 2) .cse8 .cse9))) [2022-04-15 02:44:03,822 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 35 52) the Hoare annotation is: (let ((.cse0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (let ((.cse1 (<= 1 main_~x~0)) (.cse2 (= main_~s~0 1)) (.cse3 (= main_~a~0 .cse0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~p~0 1))) (or (and (= main_~b~0 .cse0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) .cse1 (<= main_~y~0 2) .cse2 .cse3 .cse4 (= main_~a~0 main_~x~0) .cse5) (and (= main_~b~0 main_~a~0) .cse1 .cse2 .cse3 (= main_~b~0 main_~y~0) (= main_~q~0 0) .cse4 (<= main_~x~0 2) .cse5)))) [2022-04-15 02:44:03,822 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse1 (<= main_~y~0 2)) (.cse2 (= main_~s~0 1)) (.cse7 (= main_~a~0 main_~x~0)) (.cse10 (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (.cse0 (<= 1 main_~x~0)) (.cse3 (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (.cse4 (= main_~b~0 main_~y~0)) (.cse5 (= main_~q~0 0)) (.cse6 (<= 1 main_~y~0)) (.cse8 (<= main_~x~0 2)) (.cse9 (= main_~p~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 (< main_~a~0 2) (< 0 main_~b~0) .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse3 .cse4 (< 0 main_~a~0) .cse5 .cse6 (< main_~b~0 2) .cse8 .cse9))) [2022-04-15 02:44:03,822 INFO L878 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (let ((.cse1 (<= 1 main_~x~0)) (.cse2 (= main_~s~0 1)) (.cse3 (= main_~a~0 .cse0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~p~0 1))) (or (and (= main_~b~0 .cse0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) .cse1 (<= main_~y~0 2) .cse2 .cse3 .cse4 (= main_~a~0 main_~x~0) .cse5) (and (= main_~b~0 main_~a~0) .cse1 .cse2 .cse3 (= main_~b~0 main_~y~0) (= main_~q~0 0) .cse4 (<= main_~x~0 2) .cse5)))) [2022-04-15 02:44:03,822 INFO L878 garLoopResultBuilder]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse1 (<= main_~y~0 2)) (.cse2 (= main_~s~0 1)) (.cse7 (= main_~a~0 main_~x~0)) (.cse10 (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (.cse0 (<= 1 main_~x~0)) (.cse3 (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (.cse4 (= main_~b~0 main_~y~0)) (.cse5 (= main_~q~0 0)) (.cse6 (<= 1 main_~y~0)) (.cse8 (<= main_~x~0 2)) (.cse9 (= main_~p~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 (< main_~a~0 2) (< 0 main_~b~0) .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse3 .cse4 (< 0 main_~a~0) .cse5 .cse6 (< main_~b~0 2) .cse8 .cse9))) [2022-04-15 02:44:03,822 INFO L878 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse5 (= main_~a~0 main_~x~0)) (.cse1 (<= 1 main_~x~0)) (.cse2 (<= main_~y~0 2)) (.cse3 (= main_~s~0 1)) (.cse7 (= main_~b~0 main_~y~0)) (.cse8 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse9 (<= main_~x~0 2)) (.cse6 (= main_~p~0 1))) (or (let ((.cse0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (and (= main_~b~0 .cse0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) .cse1 .cse2 .cse3 (= main_~a~0 .cse0) .cse4 .cse5 .cse6)) (and (= main_~r~0 0) .cse1 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5 .cse9 .cse6) (and (= main_~b~0 main_~a~0) .cse1 .cse2 .cse3 .cse7 .cse8 .cse4 .cse9 .cse6))) [2022-04-15 02:44:03,822 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse3 (= main_~b~0 main_~y~0)) (.cse4 (= main_~q~0 0)) (.cse6 (<= main_~x~0 2)) (.cse0 (<= 1 main_~x~0)) (.cse8 (<= main_~y~0 2)) (.cse1 (= main_~s~0 1)) (.cse2 (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (.cse5 (<= 1 main_~y~0)) (.cse9 (= main_~a~0 main_~x~0)) (.cse7 (= main_~p~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (< 0 main_~a~0) .cse4 .cse5 (< main_~b~0 2) .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) .cse0 .cse8 .cse1 .cse2 (< main_~a~0 2) (< 0 main_~b~0) .cse5 .cse9 .cse7))) [2022-04-15 02:44:03,822 INFO L878 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (let ((.cse1 (<= 1 main_~x~0)) (.cse2 (<= main_~y~0 2)) (.cse3 (<= 1 main_~y~0)) (.cse4 (<= main_~x~0 2))) (or (let ((.cse0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (and (= main_~b~0 .cse0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) .cse1 .cse2 (= main_~a~0 .cse0) .cse3 .cse4)) (and .cse1 .cse2 (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) .cse3 .cse4))) [2022-04-15 02:44:03,822 INFO L882 garLoopResultBuilder]: For program point L38(lines 35 52) no Hoare annotation was computed. [2022-04-15 02:44:03,823 INFO L882 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2022-04-15 02:44:03,823 INFO L882 garLoopResultBuilder]: For program point L43(lines 43 51) no Hoare annotation was computed. [2022-04-15 02:44:03,823 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 18 59) no Hoare annotation was computed. [2022-04-15 02:44:03,823 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 18 59) no Hoare annotation was computed. [2022-04-15 02:44:03,823 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 16) the Hoare annotation is: true [2022-04-15 02:44:03,823 INFO L882 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2022-04-15 02:44:03,823 INFO L882 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2022-04-15 02:44:03,823 INFO L882 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2022-04-15 02:44:03,824 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-04-15 02:44:03,824 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2022-04-15 02:44:03,827 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 02:44:03,832 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 02:44:03,838 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 02:44:03,839 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 02:44:03,839 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-15 02:44:03,839 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 02:44:03,839 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 02:44:03,839 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 02:44:03,839 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-15 02:44:03,839 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-15 02:44:03,839 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 02:44:03,839 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-15 02:44:03,839 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 02:44:03,839 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 02:44:03,839 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-15 02:44:03,839 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 02:44:03,839 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 02:44:03,839 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 02:44:03,839 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 02:44:03,840 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:44:03,840 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:44:03,840 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:44:03,840 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:44:03,840 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:44:03,840 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:44:03,840 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 02:44:03,840 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-04-15 02:44:03,840 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 02:44:03,840 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 02:44:03,840 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 02:44:03,840 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-15 02:44:03,847 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-15 02:44:03,847 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-15 02:44:03,847 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 02:44:03,847 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 02:44:03,847 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 02:44:03,847 INFO L163 areAnnotationChecker]: CFG has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 02:44:03,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 02:44:03 BasicIcfg [2022-04-15 02:44:03,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 02:44:03,860 INFO L158 Benchmark]: Toolchain (without parser) took 73198.22ms. Allocated memory was 212.9MB in the beginning and 272.6MB in the end (delta: 59.8MB). Free memory was 163.1MB in the beginning and 214.2MB in the end (delta: -51.1MB). Peak memory consumption was 130.9MB. Max. memory is 8.0GB. [2022-04-15 02:44:03,860 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 212.9MB. Free memory was 179.5MB in the beginning and 179.4MB in the end (delta: 79.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 02:44:03,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.78ms. Allocated memory is still 212.9MB. Free memory was 163.0MB in the beginning and 191.3MB in the end (delta: -28.3MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2022-04-15 02:44:03,860 INFO L158 Benchmark]: Boogie Preprocessor took 37.63ms. Allocated memory is still 212.9MB. Free memory was 191.3MB in the beginning and 189.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 02:44:03,860 INFO L158 Benchmark]: RCFGBuilder took 277.87ms. Allocated memory is still 212.9MB. Free memory was 189.7MB in the beginning and 177.8MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 02:44:03,861 INFO L158 Benchmark]: IcfgTransformer took 50.72ms. Allocated memory is still 212.9MB. Free memory was 177.8MB in the beginning and 176.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 02:44:03,861 INFO L158 Benchmark]: TraceAbstraction took 72593.59ms. Allocated memory was 212.9MB in the beginning and 272.6MB in the end (delta: 59.8MB). Free memory was 175.5MB in the beginning and 214.2MB in the end (delta: -38.7MB). Peak memory consumption was 143.2MB. Max. memory is 8.0GB. [2022-04-15 02:44:03,862 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.13ms. Allocated memory is still 212.9MB. Free memory was 179.5MB in the beginning and 179.4MB in the end (delta: 79.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.78ms. Allocated memory is still 212.9MB. Free memory was 163.0MB in the beginning and 191.3MB in the end (delta: -28.3MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.63ms. Allocated memory is still 212.9MB. Free memory was 191.3MB in the beginning and 189.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 277.87ms. Allocated memory is still 212.9MB. Free memory was 189.7MB in the beginning and 177.8MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 50.72ms. Allocated memory is still 212.9MB. Free memory was 177.8MB in the beginning and 176.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 72593.59ms. Allocated memory was 212.9MB in the beginning and 272.6MB in the end (delta: 59.8MB). Free memory was 175.5MB in the beginning and 214.2MB in the end (delta: -38.7MB). Peak memory consumption was 143.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.5s, OverallIterations: 11, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 280 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 1589 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1194 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1840 IncrementalHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 395 mSDtfsCounter, 1840 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 869 GetRequests, 750 SyntacticMatches, 6 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=9, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 69 PreInvPairs, 101 NumberOfFragments, 867 HoareAnnotationTreeSize, 69 FomulaSimplifications, 594 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 18 FomulaSimplificationsInter, 2458 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 54.3s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 849 ConstructedInterpolants, 0 QuantifiedInterpolants, 2635 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1423 ConjunctsInSsa, 187 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 908/1002 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((((((1 <= x && y <= 2) && s == 1) && a == y * r + p * x) && b == y) && q == 0) && 1 <= y) && a == x) && x <= 2) && p == 1) || (((((((((b == q * x + y * s && 1 <= x) && y <= 2) && s == 1) && a == y * r + p * x) && a < 2) && 0 < b) && 1 <= y) && a == x) && p == 1)) || (((((((((b == q * x + y * s && 1 <= x) && a == y * r + p * x) && b == y) && 0 < a) && q == 0) && 1 <= y) && b < 2) && x <= 2) && p == 1) RESULT: Ultimate proved your program to be correct! [2022-04-15 02:44:03,887 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...