/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/egcd3-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 23:56:02,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 23:56:02,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 23:56:02,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 23:56:02,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 23:56:02,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 23:56:02,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 23:56:02,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 23:56:02,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 23:56:02,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 23:56:02,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 23:56:02,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 23:56:02,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 23:56:02,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 23:56:02,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 23:56:02,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 23:56:02,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 23:56:02,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 23:56:02,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 23:56:02,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 23:56:02,096 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 23:56:02,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 23:56:02,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 23:56:02,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 23:56:02,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 23:56:02,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 23:56:02,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 23:56:02,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 23:56:02,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 23:56:02,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 23:56:02,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 23:56:02,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 23:56:02,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 23:56:02,110 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 23:56:02,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 23:56:02,111 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 23:56:02,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 23:56:02,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 23:56:02,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 23:56:02,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 23:56:02,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 23:56:02,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 23:56:02,115 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 23:56:02,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 23:56:02,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 23:56:02,143 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 23:56:02,143 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 23:56:02,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 23:56:02,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 23:56:02,144 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 23:56:02,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 23:56:02,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 23:56:02,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 23:56:02,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 23:56:02,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 23:56:02,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 23:56:02,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 23:56:02,146 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 23:56:02,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 23:56:02,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 23:56:02,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 23:56:02,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 23:56:02,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:56:02,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 23:56:02,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 23:56:02,147 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 23:56:02,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 23:56:02,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 23:56:02,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 23:56:02,148 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 23:56:02,148 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 23:56:02,149 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 23:56:02,149 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 23:56:02,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 23:56:02,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 23:56:02,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 23:56:02,394 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 23:56:02,394 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 23:56:02,395 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound5.c [2022-04-27 23:56:02,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4db7cf07/f5d70574f03b4d2ba948925909f13954/FLAGaa3f8eca7 [2022-04-27 23:56:02,841 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 23:56:02,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound5.c [2022-04-27 23:56:02,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4db7cf07/f5d70574f03b4d2ba948925909f13954/FLAGaa3f8eca7 [2022-04-27 23:56:02,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4db7cf07/f5d70574f03b4d2ba948925909f13954 [2022-04-27 23:56:02,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 23:56:02,867 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 23:56:02,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 23:56:02,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 23:56:02,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 23:56:02,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:56:02" (1/1) ... [2022-04-27 23:56:02,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b4c050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:02, skipping insertion in model container [2022-04-27 23:56:02,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:56:02" (1/1) ... [2022-04-27 23:56:02,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 23:56:02,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 23:56:03,084 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/egcd3-ll_unwindbound5.c[490,503] [2022-04-27 23:56:03,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:56:03,126 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 23:56:03,142 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/egcd3-ll_unwindbound5.c[490,503] [2022-04-27 23:56:03,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:56:03,175 INFO L208 MainTranslator]: Completed translation [2022-04-27 23:56:03,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:03 WrapperNode [2022-04-27 23:56:03,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 23:56:03,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 23:56:03,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 23:56:03,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 23:56:03,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:03" (1/1) ... [2022-04-27 23:56:03,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:03" (1/1) ... [2022-04-27 23:56:03,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:03" (1/1) ... [2022-04-27 23:56:03,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:03" (1/1) ... [2022-04-27 23:56:03,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:03" (1/1) ... [2022-04-27 23:56:03,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:03" (1/1) ... [2022-04-27 23:56:03,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:03" (1/1) ... [2022-04-27 23:56:03,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 23:56:03,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 23:56:03,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 23:56:03,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 23:56:03,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:03" (1/1) ... [2022-04-27 23:56:03,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:56:03,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:56:03,260 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 23:56:03,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 23:56:03,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 23:56:03,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 23:56:03,304 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 23:56:03,304 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 23:56:03,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 23:56:03,305 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 23:56:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 23:56:03,306 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 23:56:03,306 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 23:56:03,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 23:56:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 23:56:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 23:56:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 23:56:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 23:56:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 23:56:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 23:56:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 23:56:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 23:56:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 23:56:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 23:56:03,372 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 23:56:03,374 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 23:56:03,607 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 23:56:03,612 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 23:56:03,613 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 23:56:03,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:56:03 BoogieIcfgContainer [2022-04-27 23:56:03,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 23:56:03,615 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 23:56:03,615 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 23:56:03,616 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 23:56:03,618 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:56:03" (1/1) ... [2022-04-27 23:56:03,620 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 23:56:03,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:56:03 BasicIcfg [2022-04-27 23:56:03,664 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 23:56:03,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 23:56:03,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 23:56:03,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 23:56:03,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:56:02" (1/4) ... [2022-04-27 23:56:03,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436f7eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:56:03, skipping insertion in model container [2022-04-27 23:56:03,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:56:03" (2/4) ... [2022-04-27 23:56:03,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436f7eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:56:03, skipping insertion in model container [2022-04-27 23:56:03,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:56:03" (3/4) ... [2022-04-27 23:56:03,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436f7eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:56:03, skipping insertion in model container [2022-04-27 23:56:03,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:56:03" (4/4) ... [2022-04-27 23:56:03,670 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound5.cqvasr [2022-04-27 23:56:03,683 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 23:56:03,684 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 23:56:03,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 23:56:03,748 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c3bc1e5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4f1da41a [2022-04-27 23:56:03,748 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 23:56:03,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 23:56:03,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 23:56:03,764 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:56:03,765 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:56:03,765 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:56:03,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:56:03,770 INFO L85 PathProgramCache]: Analyzing trace with hash 6304412, now seen corresponding path program 1 times [2022-04-27 23:56:03,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:56:03,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544799890] [2022-04-27 23:56:03,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:03,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:56:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:03,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:56:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:03,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {43#true} is VALID [2022-04-27 23:56:03,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-27 23:56:03,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-27 23:56:03,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:56:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:03,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [119] 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] {43#true} is VALID [2022-04-27 23:56:03,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-27 23:56:03,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-27 23:56:03,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {44#false} is VALID [2022-04-27 23:56:03,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 23:56:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:03,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [119] 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] {43#true} is VALID [2022-04-27 23:56:03,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-27 23:56:03,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-27 23:56:04,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {44#false} is VALID [2022-04-27 23:56:04,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:56:04,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {43#true} is VALID [2022-04-27 23:56:04,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-27 23:56:04,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-27 23:56:04,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-27 23:56:04,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {43#true} is VALID [2022-04-27 23:56:04,003 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {43#true} is VALID [2022-04-27 23:56:04,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} [119] 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] {43#true} is VALID [2022-04-27 23:56:04,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-27 23:56:04,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-27 23:56:04,006 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {44#false} is VALID [2022-04-27 23:56:04,006 INFO L272 TraceCheckUtils]: 11: Hoare triple {44#false} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {43#true} is VALID [2022-04-27 23:56:04,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#true} [119] 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] {43#true} is VALID [2022-04-27 23:56:04,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-27 23:56:04,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-27 23:56:04,009 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44#false} {44#false} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {44#false} is VALID [2022-04-27 23:56:04,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#false} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {44#false} is VALID [2022-04-27 23:56:04,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {44#false} [123] L34-3-->L34-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-27 23:56:04,010 INFO L272 TraceCheckUtils]: 18: Hoare triple {44#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {44#false} is VALID [2022-04-27 23:56:04,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {44#false} [130] __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] {44#false} is VALID [2022-04-27 23:56:04,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} [134] 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[] {44#false} is VALID [2022-04-27 23:56:04,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {44#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-27 23:56:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:56:04,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:56:04,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544799890] [2022-04-27 23:56:04,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544799890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:56:04,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:56:04,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 23:56:04,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124740701] [2022-04-27 23:56:04,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:56:04,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 23:56:04,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:56:04,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:04,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:04,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 23:56:04,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:56:04,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 23:56:04,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:56:04,094 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:04,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:04,295 INFO L93 Difference]: Finished difference Result 74 states and 111 transitions. [2022-04-27 23:56:04,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 23:56:04,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 23:56:04,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:56:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 23:56:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 23:56:04,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-27 23:56:04,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:04,511 INFO L225 Difference]: With dead ends: 74 [2022-04-27 23:56:04,511 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 23:56:04,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:56:04,518 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:56:04,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:56:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 23:56:04,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-27 23:56:04,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:56:04,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 23:56:04,562 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 23:56:04,563 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 23:56:04,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:04,573 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-27 23:56:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-27 23:56:04,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:04,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:04,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 23:56:04,574 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 23:56:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:04,578 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-27 23:56:04,578 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-27 23:56:04,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:04,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:04,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:56:04,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:56:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 23:56:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-04-27 23:56:04,588 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 22 [2022-04-27 23:56:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:56:04,588 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-04-27 23:56:04,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-27 23:56:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 23:56:04,590 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:56:04,590 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:56:04,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 23:56:04,590 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:56:04,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:56:04,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1535904754, now seen corresponding path program 1 times [2022-04-27 23:56:04,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:56:04,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810875010] [2022-04-27 23:56:04,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:04,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:56:04,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:56:04,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [413744014] [2022-04-27 23:56:04,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:04,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:04,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:56:04,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:56:04,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 23:56:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:04,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 23:56:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:04,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:56:04,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {284#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {284#true} is VALID [2022-04-27 23:56:04,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {284#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {292#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:04,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:04,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#(<= ~counter~0 0)} {284#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:04,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {292#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:04,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {292#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:04,908 INFO L272 TraceCheckUtils]: 6: Hoare triple {292#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {292#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:04,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {292#(<= ~counter~0 0)} [119] 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] {292#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:04,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {292#(<= ~counter~0 0)} [122] 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[] {292#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:04,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {292#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:04,911 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {292#(<= ~counter~0 0)} {292#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {292#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:04,911 INFO L272 TraceCheckUtils]: 11: Hoare triple {292#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {292#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:04,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {292#(<= ~counter~0 0)} [119] 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] {292#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:04,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {292#(<= ~counter~0 0)} [122] 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[] {292#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:04,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:04,913 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {292#(<= ~counter~0 0)} {292#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {292#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:04,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {292#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {292#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:04,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {292#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {341#(<= |main_#t~post6| 0)} is VALID [2022-04-27 23:56:04,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {341#(<= |main_#t~post6| 0)} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {285#false} is VALID [2022-04-27 23:56:04,917 INFO L272 TraceCheckUtils]: 19: Hoare triple {285#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {285#false} is VALID [2022-04-27 23:56:04,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {285#false} [130] __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] {285#false} is VALID [2022-04-27 23:56:04,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {285#false} [134] 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[] {285#false} is VALID [2022-04-27 23:56:04,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {285#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {285#false} is VALID [2022-04-27 23:56:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:56:04,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:56:04,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:56:04,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810875010] [2022-04-27 23:56:04,918 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:56:04,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413744014] [2022-04-27 23:56:04,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413744014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:56:04,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:56:04,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 23:56:04,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848267649] [2022-04-27 23:56:04,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:56:04,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 23:56:04,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:56:04,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:04,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:04,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 23:56:04,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:56:04,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 23:56:04,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 23:56:04,940 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:05,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:05,025 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-27 23:56:05,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 23:56:05,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 23:56:05,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:56:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:05,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-27 23:56:05,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-27 23:56:05,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-04-27 23:56:05,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:05,075 INFO L225 Difference]: With dead ends: 44 [2022-04-27 23:56:05,076 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 23:56:05,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 23:56:05,077 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:56:05,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:56:05,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 23:56:05,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-27 23:56:05,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:56:05,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 23:56:05,087 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 23:56:05,087 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 23:56:05,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:05,090 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-27 23:56:05,090 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-27 23:56:05,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:05,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:05,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-27 23:56:05,091 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-27 23:56:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:05,094 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-27 23:56:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-27 23:56:05,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:05,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:05,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:56:05,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:56:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 23:56:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-27 23:56:05,098 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23 [2022-04-27 23:56:05,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:56:05,098 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-27 23:56:05,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:05,098 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-27 23:56:05,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 23:56:05,099 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:56:05,099 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:56:05,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 23:56:05,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:05,300 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:56:05,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:56:05,301 INFO L85 PathProgramCache]: Analyzing trace with hash 401530880, now seen corresponding path program 1 times [2022-04-27 23:56:05,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:56:05,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18919770] [2022-04-27 23:56:05,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:05,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:56:05,330 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:56:05,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2133665984] [2022-04-27 23:56:05,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:05,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:05,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:56:05,333 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:56:05,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 23:56:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:05,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:56:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:05,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:56:05,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {547#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-27 23:56:05,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {547#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {547#true} is VALID [2022-04-27 23:56:05,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {547#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-27 23:56:05,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {547#true} {547#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-27 23:56:05,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {547#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-27 23:56:05,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {547#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {547#true} is VALID [2022-04-27 23:56:05,503 INFO L272 TraceCheckUtils]: 6: Hoare triple {547#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {547#true} is VALID [2022-04-27 23:56:05,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#true} [119] 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] {547#true} is VALID [2022-04-27 23:56:05,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {547#true} [122] 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[] {547#true} is VALID [2022-04-27 23:56:05,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {547#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-27 23:56:05,504 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {547#true} {547#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {547#true} is VALID [2022-04-27 23:56:05,504 INFO L272 TraceCheckUtils]: 11: Hoare triple {547#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {547#true} is VALID [2022-04-27 23:56:05,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {547#true} [119] 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] {588#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:56:05,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] 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[] {592#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:56:05,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {592#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:56:05,507 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {592#(not (= |assume_abort_if_not_#in~cond| 0))} {547#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {599#(<= 1 main_~y~0)} is VALID [2022-04-27 23:56:05,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {599#(<= 1 main_~y~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {603#(<= 1 main_~b~0)} is VALID [2022-04-27 23:56:05,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {603#(<= 1 main_~b~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {603#(<= 1 main_~b~0)} is VALID [2022-04-27 23:56:05,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {603#(<= 1 main_~b~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {603#(<= 1 main_~b~0)} is VALID [2022-04-27 23:56:05,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {603#(<= 1 main_~b~0)} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {548#false} is VALID [2022-04-27 23:56:05,509 INFO L272 TraceCheckUtils]: 20: Hoare triple {548#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {548#false} is VALID [2022-04-27 23:56:05,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {548#false} [130] __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] {548#false} is VALID [2022-04-27 23:56:05,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {548#false} [134] 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[] {548#false} is VALID [2022-04-27 23:56:05,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {548#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {548#false} is VALID [2022-04-27 23:56:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 23:56:05,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:56:05,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:56:05,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18919770] [2022-04-27 23:56:05,510 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:56:05,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133665984] [2022-04-27 23:56:05,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133665984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:56:05,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:56:05,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 23:56:05,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554180361] [2022-04-27 23:56:05,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:56:05,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 23:56:05,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:56:05,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:56:05,531 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-27 23:56:05,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 23:56:05,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:56:05,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 23:56:05,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:56:05,532 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:56:05,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:05,818 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-04-27 23:56:05,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 23:56:05,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 23:56:05,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:56:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:56:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-27 23:56:05,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:56:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-27 23:56:05,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-27 23:56:05,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:05,903 INFO L225 Difference]: With dead ends: 57 [2022-04-27 23:56:05,904 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 23:56:05,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 23:56:05,905 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:56:05,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 148 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:56:05,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 23:56:05,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2022-04-27 23:56:05,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:56:05,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 23:56:05,923 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 23:56:05,923 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 23:56:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:05,926 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-27 23:56:05,926 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-27 23:56:05,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:05,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:05,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-27 23:56:05,928 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-27 23:56:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:05,930 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-27 23:56:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-27 23:56:05,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:05,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:05,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:56:05,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:56:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 23:56:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-04-27 23:56:05,934 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 24 [2022-04-27 23:56:05,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:56:05,934 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-04-27 23:56:05,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:56:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 23:56:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 23:56:05,935 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:56:05,935 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:56:05,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 23:56:06,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 23:56:06,158 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:56:06,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:56:06,159 INFO L85 PathProgramCache]: Analyzing trace with hash 2110136122, now seen corresponding path program 1 times [2022-04-27 23:56:06,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:56:06,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808816448] [2022-04-27 23:56:06,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:06,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:56:06,177 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:56:06,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1138076800] [2022-04-27 23:56:06,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:06,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:06,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:56:06,178 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:56:06,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 23:56:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:06,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:56:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:06,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:56:06,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {865#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {865#true} is VALID [2022-04-27 23:56:06,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {865#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {873#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:06,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:06,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {873#(<= ~counter~0 0)} {865#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:06,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {873#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:06,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {873#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:06,426 INFO L272 TraceCheckUtils]: 6: Hoare triple {873#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {873#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:06,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#(<= ~counter~0 0)} [119] 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] {873#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:06,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(<= ~counter~0 0)} [122] 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[] {873#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:06,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:06,428 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {873#(<= ~counter~0 0)} {873#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {873#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:06,428 INFO L272 TraceCheckUtils]: 11: Hoare triple {873#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {873#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:06,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#(<= ~counter~0 0)} [119] 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] {873#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:06,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#(<= ~counter~0 0)} [122] 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[] {873#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:06,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:06,430 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {873#(<= ~counter~0 0)} {873#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {873#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:06,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {873#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {873#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:06,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {873#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {922#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:06,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {922#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {922#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:06,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {922#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {922#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:06,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {922#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {932#(<= |main_#t~post7| 1)} is VALID [2022-04-27 23:56:06,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {932#(<= |main_#t~post7| 1)} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {866#false} is VALID [2022-04-27 23:56:06,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {866#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {866#false} is VALID [2022-04-27 23:56:06,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {866#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {866#false} is VALID [2022-04-27 23:56:06,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {866#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {866#false} is VALID [2022-04-27 23:56:06,434 INFO L272 TraceCheckUtils]: 25: Hoare triple {866#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {866#false} is VALID [2022-04-27 23:56:06,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {866#false} [130] __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] {866#false} is VALID [2022-04-27 23:56:06,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {866#false} [134] 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[] {866#false} is VALID [2022-04-27 23:56:06,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {866#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {866#false} is VALID [2022-04-27 23:56:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:56:06,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:56:06,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:56:06,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808816448] [2022-04-27 23:56:06,435 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:56:06,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138076800] [2022-04-27 23:56:06,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138076800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:56:06,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:56:06,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:56:06,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425323945] [2022-04-27 23:56:06,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:56:06,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-27 23:56:06,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:56:06,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:06,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:06,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:56:06,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:56:06,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:56:06,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:56:06,458 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:06,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:06,594 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-04-27 23:56:06,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:56:06,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-27 23:56:06,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:56:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-27 23:56:06,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-27 23:56:06,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2022-04-27 23:56:06,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:06,666 INFO L225 Difference]: With dead ends: 62 [2022-04-27 23:56:06,666 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 23:56:06,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:56:06,668 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:56:06,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:56:06,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 23:56:06,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-27 23:56:06,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:56:06,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 23:56:06,687 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 23:56:06,687 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 23:56:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:06,690 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 23:56:06,690 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-27 23:56:06,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:06,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:06,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-27 23:56:06,691 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-27 23:56:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:06,700 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 23:56:06,700 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-27 23:56:06,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:06,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:06,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:56:06,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:56:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 23:56:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-04-27 23:56:06,703 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 29 [2022-04-27 23:56:06,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:56:06,705 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-04-27 23:56:06,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-27 23:56:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 23:56:06,705 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:56:06,706 INFO L195 NwaCegarLoop]: trace histogram [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-27 23:56:06,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 23:56:06,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:06,920 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:56:06,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:56:06,920 INFO L85 PathProgramCache]: Analyzing trace with hash -358604865, now seen corresponding path program 1 times [2022-04-27 23:56:06,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:56:06,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715966873] [2022-04-27 23:56:06,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:06,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:56:06,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:56:06,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1721494428] [2022-04-27 23:56:06,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:06,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:06,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:56:06,950 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:56:06,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 23:56:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:07,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 23:56:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:07,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:56:07,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1183#true} is VALID [2022-04-27 23:56:07,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {1183#true} is VALID [2022-04-27 23:56:07,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {1183#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1183#true} is VALID [2022-04-27 23:56:07,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1183#true} {1183#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1183#true} is VALID [2022-04-27 23:56:07,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {1183#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1183#true} is VALID [2022-04-27 23:56:07,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {1183#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1183#true} is VALID [2022-04-27 23:56:07,385 INFO L272 TraceCheckUtils]: 6: Hoare triple {1183#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {1183#true} is VALID [2022-04-27 23:56:07,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {1183#true} [119] 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] {1183#true} is VALID [2022-04-27 23:56:07,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {1183#true} [122] 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[] {1183#true} is VALID [2022-04-27 23:56:07,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1183#true} is VALID [2022-04-27 23:56:07,386 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1183#true} {1183#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {1183#true} is VALID [2022-04-27 23:56:07,386 INFO L272 TraceCheckUtils]: 11: Hoare triple {1183#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {1183#true} is VALID [2022-04-27 23:56:07,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#true} [119] 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] {1224#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:56:07,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {1224#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] 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[] {1228#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:56:07,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {1228#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1228#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:56:07,397 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1228#(not (= |assume_abort_if_not_#in~cond| 0))} {1183#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {1235#(<= 1 main_~y~0)} is VALID [2022-04-27 23:56:07,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#(<= 1 main_~y~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:07,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:07,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:07,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:07,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:07,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:07,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:07,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:07,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:07,417 INFO L272 TraceCheckUtils]: 25: Hoare triple {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1269#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:56:07,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {1269#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {1273#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:56:07,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {1273#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {1184#false} is VALID [2022-04-27 23:56:07,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {1184#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1184#false} is VALID [2022-04-27 23:56:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 23:56:07,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:56:07,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:56:07,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715966873] [2022-04-27 23:56:07,419 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:56:07,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721494428] [2022-04-27 23:56:07,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721494428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:56:07,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:56:07,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-27 23:56:07,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443180364] [2022-04-27 23:56:07,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:56:07,421 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-27 23:56:07,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:56:07,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:56:07,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:07,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 23:56:07,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:56:07,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 23:56:07,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 23:56:07,449 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:56:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:08,174 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2022-04-27 23:56:08,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 23:56:08,175 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-27 23:56:08,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:56:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:56:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-27 23:56:08,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:56:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-27 23:56:08,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 92 transitions. [2022-04-27 23:56:08,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:08,282 INFO L225 Difference]: With dead ends: 68 [2022-04-27 23:56:08,282 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 23:56:08,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-27 23:56:08,283 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 67 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 23:56:08,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 237 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 23:56:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 23:56:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-04-27 23:56:08,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:56:08,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:56:08,321 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:56:08,322 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:56:08,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:08,324 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-27 23:56:08,325 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-27 23:56:08,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:08,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:08,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 66 states. [2022-04-27 23:56:08,326 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 66 states. [2022-04-27 23:56:08,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:08,328 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-27 23:56:08,329 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-27 23:56:08,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:08,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:08,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:56:08,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:56:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:56:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2022-04-27 23:56:08,332 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 29 [2022-04-27 23:56:08,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:56:08,332 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2022-04-27 23:56:08,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:56:08,332 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-27 23:56:08,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 23:56:08,333 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:56:08,333 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:56:08,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 23:56:08,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:08,547 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:56:08,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:56:08,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2061673945, now seen corresponding path program 1 times [2022-04-27 23:56:08,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:56:08,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728389465] [2022-04-27 23:56:08,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:08,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:56:08,567 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:56:08,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [182539541] [2022-04-27 23:56:08,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:08,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:08,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:56:08,568 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:56:08,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 23:56:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:08,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 23:56:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:08,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:56:08,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {1597#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1597#true} is VALID [2022-04-27 23:56:08,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {1597#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {1605#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:08,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {1605#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1605#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:08,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1605#(<= ~counter~0 0)} {1597#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1605#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:08,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {1605#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1605#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:08,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {1605#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1605#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:08,774 INFO L272 TraceCheckUtils]: 6: Hoare triple {1605#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {1605#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:08,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {1605#(<= ~counter~0 0)} [119] 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] {1605#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:08,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {1605#(<= ~counter~0 0)} [122] 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[] {1605#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:08,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {1605#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1605#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:08,775 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1605#(<= ~counter~0 0)} {1605#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {1605#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:08,776 INFO L272 TraceCheckUtils]: 11: Hoare triple {1605#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {1605#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:08,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {1605#(<= ~counter~0 0)} [119] 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] {1605#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:08,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {1605#(<= ~counter~0 0)} [122] 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[] {1605#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:08,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {1605#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1605#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:08,777 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1605#(<= ~counter~0 0)} {1605#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {1605#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:08,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {1605#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1605#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:08,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {1605#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1654#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:08,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {1654#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1654#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:08,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {1654#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1654#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:08,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {1654#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1664#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:08,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {1664#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1664#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:08,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {1664#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {1664#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:08,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {1664#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1664#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:08,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {1664#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1677#(<= |main_#t~post6| 2)} is VALID [2022-04-27 23:56:08,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {1677#(<= |main_#t~post6| 2)} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1598#false} is VALID [2022-04-27 23:56:08,782 INFO L272 TraceCheckUtils]: 26: Hoare triple {1598#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1598#false} is VALID [2022-04-27 23:56:08,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {1598#false} [130] __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] {1598#false} is VALID [2022-04-27 23:56:08,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {1598#false} [134] 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[] {1598#false} is VALID [2022-04-27 23:56:08,782 INFO L290 TraceCheckUtils]: 29: Hoare triple {1598#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1598#false} is VALID [2022-04-27 23:56:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:56:08,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:56:08,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {1598#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1598#false} is VALID [2022-04-27 23:56:08,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {1598#false} [134] 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[] {1598#false} is VALID [2022-04-27 23:56:08,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {1598#false} [130] __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] {1598#false} is VALID [2022-04-27 23:56:08,998 INFO L272 TraceCheckUtils]: 26: Hoare triple {1598#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1598#false} is VALID [2022-04-27 23:56:08,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {1705#(< |main_#t~post6| 5)} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1598#false} is VALID [2022-04-27 23:56:08,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {1709#(< ~counter~0 5)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1705#(< |main_#t~post6| 5)} is VALID [2022-04-27 23:56:09,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {1709#(< ~counter~0 5)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1709#(< ~counter~0 5)} is VALID [2022-04-27 23:56:09,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {1709#(< ~counter~0 5)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {1709#(< ~counter~0 5)} is VALID [2022-04-27 23:56:09,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {1709#(< ~counter~0 5)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1709#(< ~counter~0 5)} is VALID [2022-04-27 23:56:09,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {1722#(< ~counter~0 4)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1709#(< ~counter~0 5)} is VALID [2022-04-27 23:56:09,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {1722#(< ~counter~0 4)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1722#(< ~counter~0 4)} is VALID [2022-04-27 23:56:09,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {1722#(< ~counter~0 4)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1722#(< ~counter~0 4)} is VALID [2022-04-27 23:56:09,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {1664#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1722#(< ~counter~0 4)} is VALID [2022-04-27 23:56:09,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {1664#(<= ~counter~0 2)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1664#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:09,008 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1597#true} {1664#(<= ~counter~0 2)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {1664#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:09,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {1597#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1597#true} is VALID [2022-04-27 23:56:09,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {1597#true} [122] 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[] {1597#true} is VALID [2022-04-27 23:56:09,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {1597#true} [119] 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] {1597#true} is VALID [2022-04-27 23:56:09,011 INFO L272 TraceCheckUtils]: 11: Hoare triple {1664#(<= ~counter~0 2)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {1597#true} is VALID [2022-04-27 23:56:09,012 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1597#true} {1664#(<= ~counter~0 2)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {1664#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:09,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {1597#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1597#true} is VALID [2022-04-27 23:56:09,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {1597#true} [122] 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[] {1597#true} is VALID [2022-04-27 23:56:09,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {1597#true} [119] 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] {1597#true} is VALID [2022-04-27 23:56:09,012 INFO L272 TraceCheckUtils]: 6: Hoare triple {1664#(<= ~counter~0 2)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {1597#true} is VALID [2022-04-27 23:56:09,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {1664#(<= ~counter~0 2)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1664#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:09,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {1664#(<= ~counter~0 2)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1664#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:09,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1664#(<= ~counter~0 2)} {1597#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1664#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:09,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {1664#(<= ~counter~0 2)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1664#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:09,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {1597#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {1664#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:09,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {1597#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1597#true} is VALID [2022-04-27 23:56:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:56:09,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:56:09,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728389465] [2022-04-27 23:56:09,016 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:56:09,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182539541] [2022-04-27 23:56:09,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182539541] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:56:09,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:56:09,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-27 23:56:09,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397684444] [2022-04-27 23:56:09,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:56:09,017 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-04-27 23:56:09,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:56:09,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 23:56:09,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:09,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 23:56:09,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:56:09,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 23:56:09,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-27 23:56:09,055 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 23:56:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:09,484 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2022-04-27 23:56:09,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 23:56:09,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-04-27 23:56:09,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:56:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 23:56:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2022-04-27 23:56:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 23:56:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2022-04-27 23:56:09,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 114 transitions. [2022-04-27 23:56:09,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:09,587 INFO L225 Difference]: With dead ends: 116 [2022-04-27 23:56:09,587 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 23:56:09,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-27 23:56:09,588 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 81 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:56:09,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 227 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:56:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 23:56:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2022-04-27 23:56:09,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:56:09,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 23:56:09,676 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 23:56:09,676 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 23:56:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:09,680 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2022-04-27 23:56:09,680 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2022-04-27 23:56:09,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:09,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:09,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 109 states. [2022-04-27 23:56:09,681 INFO L87 Difference]: Start difference. First operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 109 states. [2022-04-27 23:56:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:09,685 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2022-04-27 23:56:09,685 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2022-04-27 23:56:09,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:09,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:09,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:56:09,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:56:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 23:56:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 132 transitions. [2022-04-27 23:56:09,689 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 132 transitions. Word has length 30 [2022-04-27 23:56:09,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:56:09,690 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 132 transitions. [2022-04-27 23:56:09,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 23:56:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 132 transitions. [2022-04-27 23:56:09,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 23:56:09,691 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:56:09,691 INFO L195 NwaCegarLoop]: trace histogram [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-27 23:56:09,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 23:56:09,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:09,913 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:56:09,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:56:09,914 INFO L85 PathProgramCache]: Analyzing trace with hash 545740907, now seen corresponding path program 1 times [2022-04-27 23:56:09,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:56:09,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111997567] [2022-04-27 23:56:09,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:09,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:56:09,930 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:56:09,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1397697707] [2022-04-27 23:56:09,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:09,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:09,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:56:09,931 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:56:09,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 23:56:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:09,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 23:56:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:09,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:56:10,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {2316#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2316#true} is VALID [2022-04-27 23:56:10,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {2316#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {2316#true} is VALID [2022-04-27 23:56:10,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {2316#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2316#true} is VALID [2022-04-27 23:56:10,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2316#true} {2316#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2316#true} is VALID [2022-04-27 23:56:10,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {2316#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2316#true} is VALID [2022-04-27 23:56:10,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {2316#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2316#true} is VALID [2022-04-27 23:56:10,159 INFO L272 TraceCheckUtils]: 6: Hoare triple {2316#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {2316#true} is VALID [2022-04-27 23:56:10,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {2316#true} [119] 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] {2342#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:56:10,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {2342#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] 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[] {2346#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:56:10,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {2346#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2346#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:56:10,164 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2346#(not (= |assume_abort_if_not_#in~cond| 0))} {2316#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {2353#(<= 1 main_~x~0)} is VALID [2022-04-27 23:56:10,164 INFO L272 TraceCheckUtils]: 11: Hoare triple {2353#(<= 1 main_~x~0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {2316#true} is VALID [2022-04-27 23:56:10,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {2316#true} [119] 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] {2316#true} is VALID [2022-04-27 23:56:10,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {2316#true} [122] 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[] {2316#true} is VALID [2022-04-27 23:56:10,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {2316#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2316#true} is VALID [2022-04-27 23:56:10,165 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2316#true} {2353#(<= 1 main_~x~0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {2353#(<= 1 main_~x~0)} is VALID [2022-04-27 23:56:10,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {2353#(<= 1 main_~x~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2372#(<= 1 main_~a~0)} is VALID [2022-04-27 23:56:10,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {2372#(<= 1 main_~a~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2372#(<= 1 main_~a~0)} is VALID [2022-04-27 23:56:10,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {2372#(<= 1 main_~a~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2372#(<= 1 main_~a~0)} is VALID [2022-04-27 23:56:10,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {2372#(<= 1 main_~a~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {2382#(<= 1 main_~c~0)} is VALID [2022-04-27 23:56:10,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {2382#(<= 1 main_~c~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2382#(<= 1 main_~c~0)} is VALID [2022-04-27 23:56:10,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {2382#(<= 1 main_~c~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2382#(<= 1 main_~c~0)} is VALID [2022-04-27 23:56:10,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {2382#(<= 1 main_~c~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {2382#(<= 1 main_~c~0)} is VALID [2022-04-27 23:56:10,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {2382#(<= 1 main_~c~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2395#(<= 1 main_~b~0)} is VALID [2022-04-27 23:56:10,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {2395#(<= 1 main_~b~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2395#(<= 1 main_~b~0)} is VALID [2022-04-27 23:56:10,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {2395#(<= 1 main_~b~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2395#(<= 1 main_~b~0)} is VALID [2022-04-27 23:56:10,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {2395#(<= 1 main_~b~0)} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {2317#false} is VALID [2022-04-27 23:56:10,170 INFO L272 TraceCheckUtils]: 27: Hoare triple {2317#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2317#false} is VALID [2022-04-27 23:56:10,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {2317#false} [130] __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] {2317#false} is VALID [2022-04-27 23:56:10,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {2317#false} [134] 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[] {2317#false} is VALID [2022-04-27 23:56:10,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {2317#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2317#false} is VALID [2022-04-27 23:56:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 23:56:10,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:56:10,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {2317#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2317#false} is VALID [2022-04-27 23:56:10,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {2317#false} [134] 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[] {2317#false} is VALID [2022-04-27 23:56:10,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {2317#false} [130] __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] {2317#false} is VALID [2022-04-27 23:56:10,391 INFO L272 TraceCheckUtils]: 27: Hoare triple {2317#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2317#false} is VALID [2022-04-27 23:56:10,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {2395#(<= 1 main_~b~0)} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {2317#false} is VALID [2022-04-27 23:56:10,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {2395#(<= 1 main_~b~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2395#(<= 1 main_~b~0)} is VALID [2022-04-27 23:56:10,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {2395#(<= 1 main_~b~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2395#(<= 1 main_~b~0)} is VALID [2022-04-27 23:56:10,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {2382#(<= 1 main_~c~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2395#(<= 1 main_~b~0)} is VALID [2022-04-27 23:56:10,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {2382#(<= 1 main_~c~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {2382#(<= 1 main_~c~0)} is VALID [2022-04-27 23:56:10,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {2382#(<= 1 main_~c~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2382#(<= 1 main_~c~0)} is VALID [2022-04-27 23:56:10,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {2382#(<= 1 main_~c~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2382#(<= 1 main_~c~0)} is VALID [2022-04-27 23:56:10,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {2372#(<= 1 main_~a~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {2382#(<= 1 main_~c~0)} is VALID [2022-04-27 23:56:10,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {2372#(<= 1 main_~a~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2372#(<= 1 main_~a~0)} is VALID [2022-04-27 23:56:10,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {2372#(<= 1 main_~a~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2372#(<= 1 main_~a~0)} is VALID [2022-04-27 23:56:10,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {2353#(<= 1 main_~x~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2372#(<= 1 main_~a~0)} is VALID [2022-04-27 23:56:10,400 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2316#true} {2353#(<= 1 main_~x~0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {2353#(<= 1 main_~x~0)} is VALID [2022-04-27 23:56:10,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {2316#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2316#true} is VALID [2022-04-27 23:56:10,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {2316#true} [122] 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[] {2316#true} is VALID [2022-04-27 23:56:10,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {2316#true} [119] 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] {2316#true} is VALID [2022-04-27 23:56:10,401 INFO L272 TraceCheckUtils]: 11: Hoare triple {2353#(<= 1 main_~x~0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {2316#true} is VALID [2022-04-27 23:56:10,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2346#(not (= |assume_abort_if_not_#in~cond| 0))} {2316#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {2353#(<= 1 main_~x~0)} is VALID [2022-04-27 23:56:10,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {2346#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2346#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:56:10,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {2486#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [122] 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[] {2346#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:56:10,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {2316#true} [119] 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] {2486#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 23:56:10,403 INFO L272 TraceCheckUtils]: 6: Hoare triple {2316#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {2316#true} is VALID [2022-04-27 23:56:10,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {2316#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2316#true} is VALID [2022-04-27 23:56:10,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {2316#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2316#true} is VALID [2022-04-27 23:56:10,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2316#true} {2316#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2316#true} is VALID [2022-04-27 23:56:10,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {2316#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2316#true} is VALID [2022-04-27 23:56:10,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {2316#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {2316#true} is VALID [2022-04-27 23:56:10,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {2316#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2316#true} is VALID [2022-04-27 23:56:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 23:56:10,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:56:10,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111997567] [2022-04-27 23:56:10,405 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:56:10,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397697707] [2022-04-27 23:56:10,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397697707] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:56:10,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:56:10,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-27 23:56:10,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113701501] [2022-04-27 23:56:10,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:56:10,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-27 23:56:10,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:56:10,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:10,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:10,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 23:56:10,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:56:10,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 23:56:10,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 23:56:10,430 INFO L87 Difference]: Start difference. First operand 100 states and 132 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:11,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:11,214 INFO L93 Difference]: Finished difference Result 186 states and 263 transitions. [2022-04-27 23:56:11,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 23:56:11,215 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-27 23:56:11,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:56:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-27 23:56:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-27 23:56:11,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 155 transitions. [2022-04-27 23:56:11,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:11,347 INFO L225 Difference]: With dead ends: 186 [2022-04-27 23:56:11,347 INFO L226 Difference]: Without dead ends: 174 [2022-04-27 23:56:11,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-27 23:56:11,348 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 117 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 23:56:11,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 252 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 23:56:11,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-27 23:56:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2022-04-27 23:56:11,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:56:11,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 23:56:11,515 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 23:56:11,515 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 23:56:11,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:11,522 INFO L93 Difference]: Finished difference Result 174 states and 249 transitions. [2022-04-27 23:56:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 249 transitions. [2022-04-27 23:56:11,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:11,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:11,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 174 states. [2022-04-27 23:56:11,524 INFO L87 Difference]: Start difference. First operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 174 states. [2022-04-27 23:56:11,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:11,531 INFO L93 Difference]: Finished difference Result 174 states and 249 transitions. [2022-04-27 23:56:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 249 transitions. [2022-04-27 23:56:11,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:11,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:11,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:56:11,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:56:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 23:56:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 178 transitions. [2022-04-27 23:56:11,537 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 178 transitions. Word has length 31 [2022-04-27 23:56:11,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:56:11,537 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 178 transitions. [2022-04-27 23:56:11,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 178 transitions. [2022-04-27 23:56:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 23:56:11,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:56:11,538 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:56:11,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 23:56:11,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:11,754 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:56:11,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:56:11,754 INFO L85 PathProgramCache]: Analyzing trace with hash 653912885, now seen corresponding path program 1 times [2022-04-27 23:56:11,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:56:11,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216982767] [2022-04-27 23:56:11,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:11,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:56:11,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:56:11,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1278661213] [2022-04-27 23:56:11,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:11,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:11,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:56:11,773 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:56:11,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 23:56:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:11,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 23:56:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:11,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:56:12,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {3328#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3328#true} is VALID [2022-04-27 23:56:12,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {3328#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {3328#true} is VALID [2022-04-27 23:56:12,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {3328#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3328#true} is VALID [2022-04-27 23:56:12,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3328#true} {3328#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3328#true} is VALID [2022-04-27 23:56:12,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {3328#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3328#true} is VALID [2022-04-27 23:56:12,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {3328#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3328#true} is VALID [2022-04-27 23:56:12,257 INFO L272 TraceCheckUtils]: 6: Hoare triple {3328#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {3328#true} is VALID [2022-04-27 23:56:12,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {3328#true} [119] 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] {3328#true} is VALID [2022-04-27 23:56:12,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {3328#true} [122] 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[] {3328#true} is VALID [2022-04-27 23:56:12,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {3328#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3328#true} is VALID [2022-04-27 23:56:12,258 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3328#true} {3328#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {3328#true} is VALID [2022-04-27 23:56:12,258 INFO L272 TraceCheckUtils]: 11: Hoare triple {3328#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {3328#true} is VALID [2022-04-27 23:56:12,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {3328#true} [119] 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] {3369#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:56:12,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {3369#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] 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[] {3373#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:56:12,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {3373#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3373#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:56:12,260 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3373#(not (= |assume_abort_if_not_#in~cond| 0))} {3328#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {3380#(<= 1 main_~y~0)} is VALID [2022-04-27 23:56:12,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {3380#(<= 1 main_~y~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3384#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:56:12,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {3384#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3384#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:56:12,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {3384#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3384#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:56:12,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {3384#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {3394#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:56:12,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {3394#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {3394#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:56:12,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {3394#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3394#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:56:12,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {3394#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:56:12,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:56:12,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:56:12,265 INFO L272 TraceCheckUtils]: 25: Hoare triple {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3328#true} is VALID [2022-04-27 23:56:12,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {3328#true} [130] __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] {3328#true} is VALID [2022-04-27 23:56:12,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {3328#true} [135] 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[] {3328#true} is VALID [2022-04-27 23:56:12,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {3328#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3328#true} is VALID [2022-04-27 23:56:12,267 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3328#true} {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 23:56:12,267 INFO L272 TraceCheckUtils]: 30: Hoare triple {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3429#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:56:12,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {3429#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {3433#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:56:12,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {3433#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {3329#false} is VALID [2022-04-27 23:56:12,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {3329#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3329#false} is VALID [2022-04-27 23:56:12,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 23:56:12,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:56:12,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:56:12,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216982767] [2022-04-27 23:56:12,269 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:56:12,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278661213] [2022-04-27 23:56:12,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278661213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:56:12,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:56:12,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-27 23:56:12,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634192426] [2022-04-27 23:56:12,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:56:12,270 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-27 23:56:12,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:56:12,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:56:12,299 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-27 23:56:12,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 23:56:12,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:56:12,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 23:56:12,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-27 23:56:12,300 INFO L87 Difference]: Start difference. First operand 131 states and 178 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:56:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:13,089 INFO L93 Difference]: Finished difference Result 156 states and 208 transitions. [2022-04-27 23:56:13,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 23:56:13,090 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-27 23:56:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:56:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:56:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2022-04-27 23:56:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:56:13,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2022-04-27 23:56:13,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 93 transitions. [2022-04-27 23:56:13,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:13,185 INFO L225 Difference]: With dead ends: 156 [2022-04-27 23:56:13,185 INFO L226 Difference]: Without dead ends: 154 [2022-04-27 23:56:13,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-27 23:56:13,186 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 80 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 23:56:13,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 241 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 23:56:13,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-04-27 23:56:13,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 143. [2022-04-27 23:56:13,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:56:13,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 23:56:13,358 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 23:56:13,358 INFO L87 Difference]: Start difference. First operand 154 states. Second operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 23:56:13,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:13,363 INFO L93 Difference]: Finished difference Result 154 states and 204 transitions. [2022-04-27 23:56:13,363 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 204 transitions. [2022-04-27 23:56:13,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:13,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:13,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 154 states. [2022-04-27 23:56:13,365 INFO L87 Difference]: Start difference. First operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 154 states. [2022-04-27 23:56:13,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:13,370 INFO L93 Difference]: Finished difference Result 154 states and 204 transitions. [2022-04-27 23:56:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 204 transitions. [2022-04-27 23:56:13,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:13,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:13,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:56:13,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:56:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 23:56:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 187 transitions. [2022-04-27 23:56:13,376 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 187 transitions. Word has length 34 [2022-04-27 23:56:13,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:56:13,376 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 187 transitions. [2022-04-27 23:56:13,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 23:56:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 187 transitions. [2022-04-27 23:56:13,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 23:56:13,377 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:56:13,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:56:13,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-27 23:56:13,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:13,600 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:56:13,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:56:13,600 INFO L85 PathProgramCache]: Analyzing trace with hash -47631820, now seen corresponding path program 1 times [2022-04-27 23:56:13,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:56:13,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747068753] [2022-04-27 23:56:13,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:13,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:56:13,614 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:56:13,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2064019243] [2022-04-27 23:56:13,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:13,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:13,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:56:13,615 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:56:13,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 23:56:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:13,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 23:56:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:13,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:56:14,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {4177#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4177#true} is VALID [2022-04-27 23:56:14,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {4177#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {4177#true} is VALID [2022-04-27 23:56:14,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {4177#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4177#true} is VALID [2022-04-27 23:56:14,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4177#true} {4177#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4177#true} is VALID [2022-04-27 23:56:14,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {4177#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4177#true} is VALID [2022-04-27 23:56:14,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {4177#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4177#true} is VALID [2022-04-27 23:56:14,029 INFO L272 TraceCheckUtils]: 6: Hoare triple {4177#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {4177#true} is VALID [2022-04-27 23:56:14,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {4177#true} [119] 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] {4203#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:56:14,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {4203#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] 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[] {4207#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:56:14,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {4207#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4207#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:56:14,030 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4207#(not (= |assume_abort_if_not_#in~cond| 0))} {4177#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {4214#(<= 1 main_~x~0)} is VALID [2022-04-27 23:56:14,030 INFO L272 TraceCheckUtils]: 11: Hoare triple {4214#(<= 1 main_~x~0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {4177#true} is VALID [2022-04-27 23:56:14,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {4177#true} [119] 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] {4177#true} is VALID [2022-04-27 23:56:14,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {4177#true} [122] 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[] {4177#true} is VALID [2022-04-27 23:56:14,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {4177#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4177#true} is VALID [2022-04-27 23:56:14,032 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4177#true} {4214#(<= 1 main_~x~0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {4214#(<= 1 main_~x~0)} is VALID [2022-04-27 23:56:14,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {4214#(<= 1 main_~x~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:56:14,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:56:14,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:56:14,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:56:14,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:56:14,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:56:14,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:56:14,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 23:56:14,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 23:56:14,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 23:56:14,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 23:56:14,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 23:56:14,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 23:56:14,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 23:56:14,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 23:56:14,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 23:56:14,041 INFO L272 TraceCheckUtils]: 32: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4283#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:56:14,041 INFO L290 TraceCheckUtils]: 33: Hoare triple {4283#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {4287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:56:14,042 INFO L290 TraceCheckUtils]: 34: Hoare triple {4287#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {4178#false} is VALID [2022-04-27 23:56:14,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {4178#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4178#false} is VALID [2022-04-27 23:56:14,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 23:56:14,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:56:14,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {4178#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4178#false} is VALID [2022-04-27 23:56:14,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {4287#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {4178#false} is VALID [2022-04-27 23:56:14,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {4283#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {4287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:56:14,270 INFO L272 TraceCheckUtils]: 32: Hoare triple {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4283#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:56:14,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:56:14,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:56:14,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:56:14,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:56:14,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:56:14,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:56:14,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:56:14,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:56:14,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:56:14,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:56:14,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:56:14,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:56:14,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:56:14,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:56:14,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:56:14,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {4177#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:56:14,278 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4177#true} {4177#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {4177#true} is VALID [2022-04-27 23:56:14,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {4177#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4177#true} is VALID [2022-04-27 23:56:14,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {4177#true} [122] 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[] {4177#true} is VALID [2022-04-27 23:56:14,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {4177#true} [119] 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] {4177#true} is VALID [2022-04-27 23:56:14,278 INFO L272 TraceCheckUtils]: 11: Hoare triple {4177#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {4177#true} is VALID [2022-04-27 23:56:14,278 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4177#true} {4177#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {4177#true} is VALID [2022-04-27 23:56:14,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {4177#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4177#true} is VALID [2022-04-27 23:56:14,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {4177#true} [122] 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[] {4177#true} is VALID [2022-04-27 23:56:14,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {4177#true} [119] 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] {4177#true} is VALID [2022-04-27 23:56:14,279 INFO L272 TraceCheckUtils]: 6: Hoare triple {4177#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {4177#true} is VALID [2022-04-27 23:56:14,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {4177#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4177#true} is VALID [2022-04-27 23:56:14,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {4177#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4177#true} is VALID [2022-04-27 23:56:14,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4177#true} {4177#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4177#true} is VALID [2022-04-27 23:56:14,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {4177#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4177#true} is VALID [2022-04-27 23:56:14,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {4177#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {4177#true} is VALID [2022-04-27 23:56:14,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {4177#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4177#true} is VALID [2022-04-27 23:56:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:56:14,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:56:14,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747068753] [2022-04-27 23:56:14,280 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:56:14,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064019243] [2022-04-27 23:56:14,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064019243] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:56:14,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:56:14,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-04-27 23:56:14,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470297275] [2022-04-27 23:56:14,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:56:14,281 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 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 36 [2022-04-27 23:56:14,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:56:14,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 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-27 23:56:14,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:14,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 23:56:14,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:56:14,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 23:56:14,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 23:56:14,330 INFO L87 Difference]: Start difference. First operand 143 states and 187 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 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-27 23:56:15,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:15,256 INFO L93 Difference]: Finished difference Result 178 states and 239 transitions. [2022-04-27 23:56:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 23:56:15,256 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 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 36 [2022-04-27 23:56:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:56:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 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-27 23:56:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-27 23:56:15,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 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-27 23:56:15,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-27 23:56:15,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 99 transitions. [2022-04-27 23:56:15,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:15,364 INFO L225 Difference]: With dead ends: 178 [2022-04-27 23:56:15,364 INFO L226 Difference]: Without dead ends: 176 [2022-04-27 23:56:15,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-27 23:56:15,365 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 61 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 23:56:15,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 357 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 23:56:15,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-04-27 23:56:15,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2022-04-27 23:56:15,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:56:15,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 23:56:15,543 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 23:56:15,543 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 23:56:15,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:15,549 INFO L93 Difference]: Finished difference Result 176 states and 237 transitions. [2022-04-27 23:56:15,549 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 237 transitions. [2022-04-27 23:56:15,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:15,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:15,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 176 states. [2022-04-27 23:56:15,551 INFO L87 Difference]: Start difference. First operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 176 states. [2022-04-27 23:56:15,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:15,556 INFO L93 Difference]: Finished difference Result 176 states and 237 transitions. [2022-04-27 23:56:15,556 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 237 transitions. [2022-04-27 23:56:15,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:15,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:15,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:56:15,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:56:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 23:56:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 234 transitions. [2022-04-27 23:56:15,563 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 234 transitions. Word has length 36 [2022-04-27 23:56:15,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:56:15,563 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 234 transitions. [2022-04-27 23:56:15,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 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-27 23:56:15,564 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 234 transitions. [2022-04-27 23:56:15,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 23:56:15,564 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:56:15,564 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-04-27 23:56:15,591 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-27 23:56:15,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 23:56:15,780 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:56:15,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:56:15,780 INFO L85 PathProgramCache]: Analyzing trace with hash -375710268, now seen corresponding path program 1 times [2022-04-27 23:56:15,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:56:15,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795025427] [2022-04-27 23:56:15,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:15,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:56:15,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:56:15,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023810594] [2022-04-27 23:56:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:15,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:15,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:56:15,795 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-27 23:56:15,801 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-27 23:56:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:15,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 23:56:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:15,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:56:16,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {5257#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5257#true} is VALID [2022-04-27 23:56:16,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {5257#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {5265#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:16,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {5265#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5265#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:16,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5265#(<= ~counter~0 0)} {5257#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5265#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:16,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {5265#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5265#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:16,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {5265#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5265#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:16,053 INFO L272 TraceCheckUtils]: 6: Hoare triple {5265#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {5265#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:16,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {5265#(<= ~counter~0 0)} [119] 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] {5265#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:16,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {5265#(<= ~counter~0 0)} [122] 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[] {5265#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:16,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {5265#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5265#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:16,059 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5265#(<= ~counter~0 0)} {5265#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {5265#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:16,060 INFO L272 TraceCheckUtils]: 11: Hoare triple {5265#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {5265#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:16,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {5265#(<= ~counter~0 0)} [119] 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] {5265#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:16,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {5265#(<= ~counter~0 0)} [122] 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[] {5265#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:16,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {5265#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5265#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:16,062 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5265#(<= ~counter~0 0)} {5265#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {5265#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:16,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {5265#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5265#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:16,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {5265#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {5314#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:16,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {5314#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5314#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:16,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {5314#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {5314#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:16,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {5314#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {5324#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:16,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {5324#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {5324#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:16,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {5324#(<= ~counter~0 2)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {5324#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:16,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {5324#(<= ~counter~0 2)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {5334#(<= |main_#t~post8| 2)} is VALID [2022-04-27 23:56:16,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {5334#(<= |main_#t~post8| 2)} [154] L48-1-->L48-4: Formula: (not (< |v_main_#t~post8_3| 5)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {5258#false} is VALID [2022-04-27 23:56:16,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {5258#false} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {5258#false} is VALID [2022-04-27 23:56:16,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {5258#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {5258#false} is VALID [2022-04-27 23:56:16,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {5258#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {5258#false} is VALID [2022-04-27 23:56:16,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {5258#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5258#false} is VALID [2022-04-27 23:56:16,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {5258#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {5258#false} is VALID [2022-04-27 23:56:16,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {5258#false} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5258#false} is VALID [2022-04-27 23:56:16,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {5258#false} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {5258#false} is VALID [2022-04-27 23:56:16,067 INFO L272 TraceCheckUtils]: 32: Hoare triple {5258#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5258#false} is VALID [2022-04-27 23:56:16,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {5258#false} [130] __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] {5258#false} is VALID [2022-04-27 23:56:16,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {5258#false} [134] 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[] {5258#false} is VALID [2022-04-27 23:56:16,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {5258#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5258#false} is VALID [2022-04-27 23:56:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:56:16,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:56:16,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:56:16,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795025427] [2022-04-27 23:56:16,068 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:56:16,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023810594] [2022-04-27 23:56:16,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023810594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:56:16,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:56:16,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 23:56:16,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069213224] [2022-04-27 23:56:16,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:56:16,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-27 23:56:16,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:56:16,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:16,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:16,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 23:56:16,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:56:16,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 23:56:16,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:56:16,092 INFO L87 Difference]: Start difference. First operand 173 states and 234 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:16,388 INFO L93 Difference]: Finished difference Result 240 states and 327 transitions. [2022-04-27 23:56:16,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 23:56:16,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-27 23:56:16,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:56:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-27 23:56:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-27 23:56:16,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2022-04-27 23:56:16,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:16,460 INFO L225 Difference]: With dead ends: 240 [2022-04-27 23:56:16,460 INFO L226 Difference]: Without dead ends: 173 [2022-04-27 23:56:16,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:56:16,462 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:56:16,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 115 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:56:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-27 23:56:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-27 23:56:16,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:56:16,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 23:56:16,634 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 23:56:16,634 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 23:56:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:16,639 INFO L93 Difference]: Finished difference Result 173 states and 233 transitions. [2022-04-27 23:56:16,639 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2022-04-27 23:56:16,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:16,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:16,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 173 states. [2022-04-27 23:56:16,640 INFO L87 Difference]: Start difference. First operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 173 states. [2022-04-27 23:56:16,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:16,644 INFO L93 Difference]: Finished difference Result 173 states and 233 transitions. [2022-04-27 23:56:16,644 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2022-04-27 23:56:16,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:16,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:16,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:56:16,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:56:16,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 23:56:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 233 transitions. [2022-04-27 23:56:16,650 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 233 transitions. Word has length 36 [2022-04-27 23:56:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:56:16,650 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 233 transitions. [2022-04-27 23:56:16,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:56:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2022-04-27 23:56:16,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 23:56:16,651 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:56:16,651 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:56:16,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-27 23:56:16,863 WARN L477 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-27 23:56:16,863 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:56:16,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:56:16,864 INFO L85 PathProgramCache]: Analyzing trace with hash -344890017, now seen corresponding path program 1 times [2022-04-27 23:56:16,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:56:16,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837513732] [2022-04-27 23:56:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:16,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:56:16,878 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:56:16,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1422069700] [2022-04-27 23:56:16,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:16,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:16,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:56:16,885 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-27 23:56:16,891 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-27 23:56:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:16,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:56:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:16,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:56:19,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {6300#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-27 23:56:19,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {6300#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {6300#true} is VALID [2022-04-27 23:56:19,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {6300#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-27 23:56:19,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6300#true} {6300#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-27 23:56:19,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {6300#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-27 23:56:19,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {6300#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6300#true} is VALID [2022-04-27 23:56:19,427 INFO L272 TraceCheckUtils]: 6: Hoare triple {6300#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {6300#true} is VALID [2022-04-27 23:56:19,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {6300#true} [119] 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] {6300#true} is VALID [2022-04-27 23:56:19,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {6300#true} [122] 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[] {6300#true} is VALID [2022-04-27 23:56:19,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {6300#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-27 23:56:19,427 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6300#true} {6300#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {6300#true} is VALID [2022-04-27 23:56:19,427 INFO L272 TraceCheckUtils]: 11: Hoare triple {6300#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {6300#true} is VALID [2022-04-27 23:56:19,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {6300#true} [119] 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] {6300#true} is VALID [2022-04-27 23:56:19,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {6300#true} [122] 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[] {6300#true} is VALID [2022-04-27 23:56:19,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {6300#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-27 23:56:19,436 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6300#true} {6300#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {6300#true} is VALID [2022-04-27 23:56:19,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {6300#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6300#true} is VALID [2022-04-27 23:56:19,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {6300#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {6300#true} is VALID [2022-04-27 23:56:19,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {6300#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6300#true} is VALID [2022-04-27 23:56:19,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {6300#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 23:56:19,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 23:56:19,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 23:56:19,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 23:56:19,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 23:56:19,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 23:56:19,439 INFO L272 TraceCheckUtils]: 25: Hoare triple {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6300#true} is VALID [2022-04-27 23:56:19,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {6300#true} [130] __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] {6300#true} is VALID [2022-04-27 23:56:19,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {6300#true} [135] 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[] {6300#true} is VALID [2022-04-27 23:56:19,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {6300#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-27 23:56:19,441 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6300#true} {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 23:56:19,441 INFO L272 TraceCheckUtils]: 30: Hoare triple {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6300#true} is VALID [2022-04-27 23:56:19,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {6300#true} [130] __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] {6300#true} is VALID [2022-04-27 23:56:19,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {6300#true} [135] 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[] {6300#true} is VALID [2022-04-27 23:56:19,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {6300#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-27 23:56:19,442 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6300#true} {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 23:56:19,443 INFO L272 TraceCheckUtils]: 35: Hoare triple {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {6411#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:56:19,443 INFO L290 TraceCheckUtils]: 36: Hoare triple {6411#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {6415#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:56:19,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {6415#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {6301#false} is VALID [2022-04-27 23:56:19,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {6301#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6301#false} is VALID [2022-04-27 23:56:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 23:56:19,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:56:19,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:56:19,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837513732] [2022-04-27 23:56:19,444 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:56:19,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422069700] [2022-04-27 23:56:19,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422069700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:56:19,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:56:19,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:56:19,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425772727] [2022-04-27 23:56:19,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:56:19,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-27 23:56:19,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:56:19,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:56:19,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:19,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:56:19,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:56:19,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:56:19,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:56:19,473 INFO L87 Difference]: Start difference. First operand 173 states and 233 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:56:19,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:19,942 INFO L93 Difference]: Finished difference Result 238 states and 333 transitions. [2022-04-27 23:56:19,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:56:19,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-27 23:56:19,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:56:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:56:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 23:56:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:56:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 23:56:19,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-27 23:56:20,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:20,018 INFO L225 Difference]: With dead ends: 238 [2022-04-27 23:56:20,018 INFO L226 Difference]: Without dead ends: 236 [2022-04-27 23:56:20,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:56:20,019 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:56:20,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 150 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:56:20,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-04-27 23:56:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 229. [2022-04-27 23:56:20,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:56:20,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 23:56:20,358 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 23:56:20,358 INFO L87 Difference]: Start difference. First operand 236 states. Second operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 23:56:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:20,366 INFO L93 Difference]: Finished difference Result 236 states and 329 transitions. [2022-04-27 23:56:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 329 transitions. [2022-04-27 23:56:20,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:20,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:20,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 236 states. [2022-04-27 23:56:20,367 INFO L87 Difference]: Start difference. First operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 236 states. [2022-04-27 23:56:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:20,374 INFO L93 Difference]: Finished difference Result 236 states and 329 transitions. [2022-04-27 23:56:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 329 transitions. [2022-04-27 23:56:20,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:20,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:20,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:56:20,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:56:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 23:56:20,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 322 transitions. [2022-04-27 23:56:20,383 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 322 transitions. Word has length 39 [2022-04-27 23:56:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:56:20,383 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 322 transitions. [2022-04-27 23:56:20,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:56:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 322 transitions. [2022-04-27 23:56:20,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 23:56:20,384 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:56:20,384 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:56:20,406 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-27 23:56:20,599 WARN L477 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-27 23:56:20,599 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:56:20,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:56:20,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1057809952, now seen corresponding path program 1 times [2022-04-27 23:56:20,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:56:20,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54372614] [2022-04-27 23:56:20,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:20,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:56:20,613 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:56:20,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1851707642] [2022-04-27 23:56:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:20,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:20,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:56:20,614 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:56:20,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 23:56:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:20,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-27 23:56:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:20,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:56:21,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {7568#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7568#true} is VALID [2022-04-27 23:56:21,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {7568#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {7568#true} is VALID [2022-04-27 23:56:21,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {7568#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7568#true} is VALID [2022-04-27 23:56:21,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7568#true} {7568#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7568#true} is VALID [2022-04-27 23:56:21,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {7568#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7568#true} is VALID [2022-04-27 23:56:21,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {7568#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {7568#true} is VALID [2022-04-27 23:56:21,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {7568#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {7568#true} is VALID [2022-04-27 23:56:21,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {7568#true} [119] 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] {7568#true} is VALID [2022-04-27 23:56:21,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {7568#true} [122] 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[] {7568#true} is VALID [2022-04-27 23:56:21,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {7568#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7568#true} is VALID [2022-04-27 23:56:21,625 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7568#true} {7568#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {7568#true} is VALID [2022-04-27 23:56:21,625 INFO L272 TraceCheckUtils]: 11: Hoare triple {7568#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {7568#true} is VALID [2022-04-27 23:56:21,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {7568#true} [119] 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] {7568#true} is VALID [2022-04-27 23:56:21,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {7568#true} [122] 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[] {7568#true} is VALID [2022-04-27 23:56:21,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {7568#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7568#true} is VALID [2022-04-27 23:56:21,626 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7568#true} {7568#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {7568#true} is VALID [2022-04-27 23:56:21,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {7568#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {7621#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:21,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {7621#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {7621#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:21,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {7621#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {7621#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:21,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {7621#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {7631#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:21,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {7631#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {7631#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:21,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {7631#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {7631#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:21,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {7631#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {7631#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:21,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {7631#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 23:56:21,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 23:56:21,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 23:56:21,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 23:56:21,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 23:56:21,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 23:56:21,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 23:56:21,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 23:56:21,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 23:56:21,633 INFO L272 TraceCheckUtils]: 32: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {7568#true} is VALID [2022-04-27 23:56:21,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {7568#true} [130] __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] {7568#true} is VALID [2022-04-27 23:56:21,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {7568#true} [135] 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[] {7568#true} is VALID [2022-04-27 23:56:21,633 INFO L290 TraceCheckUtils]: 35: Hoare triple {7568#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7568#true} is VALID [2022-04-27 23:56:21,634 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7568#true} {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 23:56:21,640 INFO L272 TraceCheckUtils]: 37: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {7687#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:56:21,640 INFO L290 TraceCheckUtils]: 38: Hoare triple {7687#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {7691#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:56:21,640 INFO L290 TraceCheckUtils]: 39: Hoare triple {7691#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {7569#false} is VALID [2022-04-27 23:56:21,641 INFO L290 TraceCheckUtils]: 40: Hoare triple {7569#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7569#false} is VALID [2022-04-27 23:56:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:56:21,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:56:21,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {7569#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7569#false} is VALID [2022-04-27 23:56:21,867 INFO L290 TraceCheckUtils]: 39: Hoare triple {7691#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {7569#false} is VALID [2022-04-27 23:56:21,867 INFO L290 TraceCheckUtils]: 38: Hoare triple {7687#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {7691#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:56:21,868 INFO L272 TraceCheckUtils]: 37: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {7687#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:56:21,869 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7568#true} {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:56:21,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {7568#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7568#true} is VALID [2022-04-27 23:56:21,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {7568#true} [135] 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[] {7568#true} is VALID [2022-04-27 23:56:21,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {7568#true} [130] __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] {7568#true} is VALID [2022-04-27 23:56:21,870 INFO L272 TraceCheckUtils]: 32: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {7568#true} is VALID [2022-04-27 23:56:21,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:56:21,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:56:21,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:56:21,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:56:21,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:56:21,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:56:21,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:56:21,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:56:23,875 WARN L290 TraceCheckUtils]: 23: Hoare triple {7750#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-27 23:56:23,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {7750#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {7750#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-27 23:56:23,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {7750#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {7750#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-27 23:56:23,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {7750#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {7750#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-27 23:56:23,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {7763#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {7750#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-27 23:56:23,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {7763#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {7763#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:56:23,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {7763#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {7763#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:56:23,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {7568#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {7763#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:56:23,878 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7568#true} {7568#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {7568#true} is VALID [2022-04-27 23:56:23,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {7568#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7568#true} is VALID [2022-04-27 23:56:23,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {7568#true} [122] 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[] {7568#true} is VALID [2022-04-27 23:56:23,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {7568#true} [119] 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] {7568#true} is VALID [2022-04-27 23:56:23,879 INFO L272 TraceCheckUtils]: 11: Hoare triple {7568#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {7568#true} is VALID [2022-04-27 23:56:23,879 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7568#true} {7568#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {7568#true} is VALID [2022-04-27 23:56:23,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {7568#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7568#true} is VALID [2022-04-27 23:56:23,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {7568#true} [122] 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[] {7568#true} is VALID [2022-04-27 23:56:23,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {7568#true} [119] 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] {7568#true} is VALID [2022-04-27 23:56:23,879 INFO L272 TraceCheckUtils]: 6: Hoare triple {7568#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {7568#true} is VALID [2022-04-27 23:56:23,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {7568#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {7568#true} is VALID [2022-04-27 23:56:23,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {7568#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7568#true} is VALID [2022-04-27 23:56:23,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7568#true} {7568#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7568#true} is VALID [2022-04-27 23:56:23,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {7568#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7568#true} is VALID [2022-04-27 23:56:23,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {7568#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {7568#true} is VALID [2022-04-27 23:56:23,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {7568#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7568#true} is VALID [2022-04-27 23:56:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:56:23,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:56:23,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54372614] [2022-04-27 23:56:23,880 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:56:23,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851707642] [2022-04-27 23:56:23,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851707642] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:56:23,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:56:23,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 23:56:23,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537018932] [2022-04-27 23:56:23,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:56:23,881 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-27 23:56:23,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:56:23,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 23:56:24,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:24,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 23:56:24,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:56:24,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 23:56:24,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-27 23:56:24,043 INFO L87 Difference]: Start difference. First operand 229 states and 322 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 23:56:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:26,340 INFO L93 Difference]: Finished difference Result 391 states and 576 transitions. [2022-04-27 23:56:26,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 23:56:26,340 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-27 23:56:26,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:56:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 23:56:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 252 transitions. [2022-04-27 23:56:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 23:56:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 252 transitions. [2022-04-27 23:56:26,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 252 transitions. [2022-04-27 23:56:26,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:26,794 INFO L225 Difference]: With dead ends: 391 [2022-04-27 23:56:26,794 INFO L226 Difference]: Without dead ends: 389 [2022-04-27 23:56:26,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-27 23:56:26,795 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 162 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 23:56:26,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 318 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 23:56:26,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-04-27 23:56:27,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 376. [2022-04-27 23:56:27,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:56:27,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 389 states. Second operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-27 23:56:27,192 INFO L74 IsIncluded]: Start isIncluded. First operand 389 states. Second operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-27 23:56:27,193 INFO L87 Difference]: Start difference. First operand 389 states. Second operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-27 23:56:27,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:27,207 INFO L93 Difference]: Finished difference Result 389 states and 574 transitions. [2022-04-27 23:56:27,207 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 574 transitions. [2022-04-27 23:56:27,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:27,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:27,209 INFO L74 IsIncluded]: Start isIncluded. First operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) Second operand 389 states. [2022-04-27 23:56:27,210 INFO L87 Difference]: Start difference. First operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) Second operand 389 states. [2022-04-27 23:56:27,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:27,223 INFO L93 Difference]: Finished difference Result 389 states and 574 transitions. [2022-04-27 23:56:27,223 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 574 transitions. [2022-04-27 23:56:27,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:27,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:27,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:56:27,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:56:27,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-27 23:56:27,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 561 transitions. [2022-04-27 23:56:27,240 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 561 transitions. Word has length 41 [2022-04-27 23:56:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:56:27,240 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 561 transitions. [2022-04-27 23:56:27,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 23:56:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 561 transitions. [2022-04-27 23:56:27,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 23:56:27,241 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:56:27,241 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:56:27,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 23:56:27,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 23:56:27,464 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:56:27,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:56:27,464 INFO L85 PathProgramCache]: Analyzing trace with hash -800046763, now seen corresponding path program 1 times [2022-04-27 23:56:27,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:56:27,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833109578] [2022-04-27 23:56:27,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:27,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:56:27,476 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:56:27,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2101680463] [2022-04-27 23:56:27,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:27,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:27,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:56:27,478 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:56:27,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 23:56:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:27,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:56:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:27,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:56:27,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {9735#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9735#true} is VALID [2022-04-27 23:56:27,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {9735#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {9735#true} is VALID [2022-04-27 23:56:27,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {9735#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9735#true} is VALID [2022-04-27 23:56:27,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9735#true} {9735#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9735#true} is VALID [2022-04-27 23:56:27,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {9735#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9735#true} is VALID [2022-04-27 23:56:27,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {9735#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {9735#true} is VALID [2022-04-27 23:56:27,652 INFO L272 TraceCheckUtils]: 6: Hoare triple {9735#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {9735#true} is VALID [2022-04-27 23:56:27,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {9735#true} [119] 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] {9735#true} is VALID [2022-04-27 23:56:27,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {9735#true} [122] 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[] {9735#true} is VALID [2022-04-27 23:56:27,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {9735#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9735#true} is VALID [2022-04-27 23:56:27,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9735#true} {9735#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {9735#true} is VALID [2022-04-27 23:56:27,652 INFO L272 TraceCheckUtils]: 11: Hoare triple {9735#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {9735#true} is VALID [2022-04-27 23:56:27,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {9735#true} [119] 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] {9735#true} is VALID [2022-04-27 23:56:27,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {9735#true} [122] 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[] {9735#true} is VALID [2022-04-27 23:56:27,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {9735#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9735#true} is VALID [2022-04-27 23:56:27,653 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9735#true} {9735#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {9735#true} is VALID [2022-04-27 23:56:27,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {9735#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {9735#true} is VALID [2022-04-27 23:56:27,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {9735#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {9735#true} is VALID [2022-04-27 23:56:27,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {9735#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {9735#true} is VALID [2022-04-27 23:56:27,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {9735#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {9735#true} is VALID [2022-04-27 23:56:27,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {9735#true} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {9735#true} is VALID [2022-04-27 23:56:27,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {9735#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {9735#true} is VALID [2022-04-27 23:56:27,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {9735#true} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 23:56:27,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 23:56:27,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 23:56:27,660 INFO L272 TraceCheckUtils]: 25: Hoare triple {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {9735#true} is VALID [2022-04-27 23:56:27,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {9735#true} [130] __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] {9735#true} is VALID [2022-04-27 23:56:27,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {9735#true} [135] 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[] {9735#true} is VALID [2022-04-27 23:56:27,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {9735#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9735#true} is VALID [2022-04-27 23:56:27,661 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {9735#true} {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 23:56:27,662 INFO L272 TraceCheckUtils]: 30: Hoare triple {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {9735#true} is VALID [2022-04-27 23:56:27,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {9735#true} [130] __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] {9735#true} is VALID [2022-04-27 23:56:27,662 INFO L290 TraceCheckUtils]: 32: Hoare triple {9735#true} [135] 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[] {9735#true} is VALID [2022-04-27 23:56:27,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {9735#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9735#true} is VALID [2022-04-27 23:56:27,663 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9735#true} {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 23:56:27,663 INFO L272 TraceCheckUtils]: 35: Hoare triple {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {9735#true} is VALID [2022-04-27 23:56:27,663 INFO L290 TraceCheckUtils]: 36: Hoare triple {9735#true} [130] __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] {9735#true} is VALID [2022-04-27 23:56:27,663 INFO L290 TraceCheckUtils]: 37: Hoare triple {9735#true} [135] 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[] {9735#true} is VALID [2022-04-27 23:56:27,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {9735#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9735#true} is VALID [2022-04-27 23:56:27,664 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9735#true} {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 23:56:27,664 INFO L272 TraceCheckUtils]: 40: Hoare triple {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {9861#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:56:27,665 INFO L290 TraceCheckUtils]: 41: Hoare triple {9861#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {9865#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:56:27,665 INFO L290 TraceCheckUtils]: 42: Hoare triple {9865#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {9736#false} is VALID [2022-04-27 23:56:27,665 INFO L290 TraceCheckUtils]: 43: Hoare triple {9736#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9736#false} is VALID [2022-04-27 23:56:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 23:56:27,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:56:27,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:56:27,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833109578] [2022-04-27 23:56:27,666 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:56:27,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101680463] [2022-04-27 23:56:27,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101680463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:56:27,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:56:27,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:56:27,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707996359] [2022-04-27 23:56:27,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:56:27,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-04-27 23:56:27,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:56:27,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 23:56:27,690 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-27 23:56:27,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:56:27,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:56:27,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:56:27,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:56:27,691 INFO L87 Difference]: Start difference. First operand 376 states and 561 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 23:56:28,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:28,552 INFO L93 Difference]: Finished difference Result 560 states and 878 transitions. [2022-04-27 23:56:28,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:56:28,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-04-27 23:56:28,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:56:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 23:56:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 23:56:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 23:56:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 23:56:28,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-27 23:56:28,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:28,633 INFO L225 Difference]: With dead ends: 560 [2022-04-27 23:56:28,634 INFO L226 Difference]: Without dead ends: 558 [2022-04-27 23:56:28,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:56:28,637 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:56:28,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:56:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-04-27 23:56:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 494. [2022-04-27 23:56:29,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:56:29,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 558 states. Second operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 23:56:29,297 INFO L74 IsIncluded]: Start isIncluded. First operand 558 states. Second operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 23:56:29,298 INFO L87 Difference]: Start difference. First operand 558 states. Second operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 23:56:29,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:29,323 INFO L93 Difference]: Finished difference Result 558 states and 875 transitions. [2022-04-27 23:56:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 875 transitions. [2022-04-27 23:56:29,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:29,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:29,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) Second operand 558 states. [2022-04-27 23:56:29,328 INFO L87 Difference]: Start difference. First operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) Second operand 558 states. [2022-04-27 23:56:29,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:29,362 INFO L93 Difference]: Finished difference Result 558 states and 875 transitions. [2022-04-27 23:56:29,362 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 875 transitions. [2022-04-27 23:56:29,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:29,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:29,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:56:29,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:56:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 23:56:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 772 transitions. [2022-04-27 23:56:29,394 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 772 transitions. Word has length 44 [2022-04-27 23:56:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:56:29,394 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 772 transitions. [2022-04-27 23:56:29,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 23:56:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 772 transitions. [2022-04-27 23:56:29,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 23:56:29,396 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:56:29,396 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:56:29,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 23:56:29,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 23:56:29,619 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:56:29,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:56:29,620 INFO L85 PathProgramCache]: Analyzing trace with hash 684933943, now seen corresponding path program 1 times [2022-04-27 23:56:29,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:56:29,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157389600] [2022-04-27 23:56:29,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:29,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:56:29,639 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:56:29,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1851237877] [2022-04-27 23:56:29,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:29,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:29,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:56:29,647 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:56:29,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 23:56:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:29,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 23:56:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:29,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:56:29,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {12593#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12593#true} is VALID [2022-04-27 23:56:29,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {12593#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {12601#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:29,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {12601#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12601#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:29,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12601#(<= ~counter~0 0)} {12593#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12601#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:29,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {12601#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12601#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:29,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {12601#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12601#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:29,918 INFO L272 TraceCheckUtils]: 6: Hoare triple {12601#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {12601#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:29,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {12601#(<= ~counter~0 0)} [119] 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] {12601#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:29,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {12601#(<= ~counter~0 0)} [122] 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[] {12601#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:29,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {12601#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12601#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:29,919 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12601#(<= ~counter~0 0)} {12601#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {12601#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:29,920 INFO L272 TraceCheckUtils]: 11: Hoare triple {12601#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {12601#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:29,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {12601#(<= ~counter~0 0)} [119] 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] {12601#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:29,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {12601#(<= ~counter~0 0)} [122] 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[] {12601#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:29,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {12601#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12601#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:29,921 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12601#(<= ~counter~0 0)} {12601#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {12601#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:29,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {12601#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12601#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:29,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {12601#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12650#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:29,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {12650#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12650#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:29,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {12650#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12650#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:29,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {12650#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {12660#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:29,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {12660#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12660#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:29,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {12660#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {12660#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:29,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {12660#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12660#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:29,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {12660#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12673#(<= ~counter~0 3)} is VALID [2022-04-27 23:56:29,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {12673#(<= ~counter~0 3)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12673#(<= ~counter~0 3)} is VALID [2022-04-27 23:56:29,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {12673#(<= ~counter~0 3)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12673#(<= ~counter~0 3)} is VALID [2022-04-27 23:56:29,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {12673#(<= ~counter~0 3)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {12683#(<= |main_#t~post7| 3)} is VALID [2022-04-27 23:56:29,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {12683#(<= |main_#t~post7| 3)} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12594#false} is VALID [2022-04-27 23:56:29,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {12594#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12594#false} is VALID [2022-04-27 23:56:29,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {12594#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12594#false} is VALID [2022-04-27 23:56:29,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {12594#false} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12594#false} is VALID [2022-04-27 23:56:29,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {12594#false} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12594#false} is VALID [2022-04-27 23:56:29,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {12594#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {12594#false} is VALID [2022-04-27 23:56:29,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {12594#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12594#false} is VALID [2022-04-27 23:56:29,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {12594#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12594#false} is VALID [2022-04-27 23:56:29,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {12594#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12594#false} is VALID [2022-04-27 23:56:29,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {12594#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12594#false} is VALID [2022-04-27 23:56:29,928 INFO L272 TraceCheckUtils]: 38: Hoare triple {12594#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12594#false} is VALID [2022-04-27 23:56:29,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {12594#false} [130] __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] {12594#false} is VALID [2022-04-27 23:56:29,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {12594#false} [134] 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[] {12594#false} is VALID [2022-04-27 23:56:29,929 INFO L290 TraceCheckUtils]: 41: Hoare triple {12594#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12594#false} is VALID [2022-04-27 23:56:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 23:56:29,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:56:30,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {12594#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12594#false} is VALID [2022-04-27 23:56:30,191 INFO L290 TraceCheckUtils]: 40: Hoare triple {12594#false} [134] 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[] {12594#false} is VALID [2022-04-27 23:56:30,191 INFO L290 TraceCheckUtils]: 39: Hoare triple {12594#false} [130] __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] {12594#false} is VALID [2022-04-27 23:56:30,191 INFO L272 TraceCheckUtils]: 38: Hoare triple {12594#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12594#false} is VALID [2022-04-27 23:56:30,191 INFO L290 TraceCheckUtils]: 37: Hoare triple {12594#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12594#false} is VALID [2022-04-27 23:56:30,192 INFO L290 TraceCheckUtils]: 36: Hoare triple {12594#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12594#false} is VALID [2022-04-27 23:56:30,192 INFO L290 TraceCheckUtils]: 35: Hoare triple {12594#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12594#false} is VALID [2022-04-27 23:56:30,192 INFO L290 TraceCheckUtils]: 34: Hoare triple {12594#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12594#false} is VALID [2022-04-27 23:56:30,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {12594#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {12594#false} is VALID [2022-04-27 23:56:30,192 INFO L290 TraceCheckUtils]: 32: Hoare triple {12594#false} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12594#false} is VALID [2022-04-27 23:56:30,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {12594#false} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12594#false} is VALID [2022-04-27 23:56:30,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {12594#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12594#false} is VALID [2022-04-27 23:56:30,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {12594#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12594#false} is VALID [2022-04-27 23:56:30,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {12765#(< |main_#t~post7| 5)} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12594#false} is VALID [2022-04-27 23:56:30,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {12769#(< ~counter~0 5)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {12765#(< |main_#t~post7| 5)} is VALID [2022-04-27 23:56:30,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {12769#(< ~counter~0 5)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12769#(< ~counter~0 5)} is VALID [2022-04-27 23:56:30,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {12769#(< ~counter~0 5)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12769#(< ~counter~0 5)} is VALID [2022-04-27 23:56:30,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {12673#(<= ~counter~0 3)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12769#(< ~counter~0 5)} is VALID [2022-04-27 23:56:30,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {12673#(<= ~counter~0 3)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12673#(<= ~counter~0 3)} is VALID [2022-04-27 23:56:30,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {12673#(<= ~counter~0 3)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {12673#(<= ~counter~0 3)} is VALID [2022-04-27 23:56:30,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {12673#(<= ~counter~0 3)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12673#(<= ~counter~0 3)} is VALID [2022-04-27 23:56:30,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {12660#(<= ~counter~0 2)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {12673#(<= ~counter~0 3)} is VALID [2022-04-27 23:56:30,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {12660#(<= ~counter~0 2)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12660#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:30,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {12660#(<= ~counter~0 2)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12660#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:30,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {12650#(<= ~counter~0 1)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12660#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:30,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {12650#(<= ~counter~0 1)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12650#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:30,198 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12593#true} {12650#(<= ~counter~0 1)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {12650#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:30,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {12593#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12593#true} is VALID [2022-04-27 23:56:30,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {12593#true} [122] 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[] {12593#true} is VALID [2022-04-27 23:56:30,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {12593#true} [119] 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] {12593#true} is VALID [2022-04-27 23:56:30,199 INFO L272 TraceCheckUtils]: 11: Hoare triple {12650#(<= ~counter~0 1)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {12593#true} is VALID [2022-04-27 23:56:30,199 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12593#true} {12650#(<= ~counter~0 1)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {12650#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:30,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {12593#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12593#true} is VALID [2022-04-27 23:56:30,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {12593#true} [122] 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[] {12593#true} is VALID [2022-04-27 23:56:30,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {12593#true} [119] 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] {12593#true} is VALID [2022-04-27 23:56:30,200 INFO L272 TraceCheckUtils]: 6: Hoare triple {12650#(<= ~counter~0 1)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {12593#true} is VALID [2022-04-27 23:56:30,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {12650#(<= ~counter~0 1)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12650#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:30,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {12650#(<= ~counter~0 1)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12650#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:30,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12650#(<= ~counter~0 1)} {12593#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12650#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:30,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {12650#(<= ~counter~0 1)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12650#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:30,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {12593#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {12650#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:30,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {12593#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12593#true} is VALID [2022-04-27 23:56:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 23:56:30,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:56:30,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157389600] [2022-04-27 23:56:30,202 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:56:30,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851237877] [2022-04-27 23:56:30,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851237877] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:56:30,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:56:30,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-27 23:56:30,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459144074] [2022-04-27 23:56:30,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:56:30,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-27 23:56:30,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:56:30,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 23:56:30,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:30,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 23:56:30,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:56:30,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 23:56:30,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-27 23:56:30,256 INFO L87 Difference]: Start difference. First operand 494 states and 772 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 23:56:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:31,383 INFO L93 Difference]: Finished difference Result 859 states and 1366 transitions. [2022-04-27 23:56:31,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 23:56:31,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-27 23:56:31,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:56:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 23:56:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-04-27 23:56:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 23:56:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-04-27 23:56:31,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 133 transitions. [2022-04-27 23:56:31,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:31,509 INFO L225 Difference]: With dead ends: 859 [2022-04-27 23:56:31,509 INFO L226 Difference]: Without dead ends: 502 [2022-04-27 23:56:31,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-04-27 23:56:31,512 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 49 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:56:31,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 211 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:56:31,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-04-27 23:56:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 498. [2022-04-27 23:56:32,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:56:32,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 502 states. Second operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 23:56:32,167 INFO L74 IsIncluded]: Start isIncluded. First operand 502 states. Second operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 23:56:32,168 INFO L87 Difference]: Start difference. First operand 502 states. Second operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 23:56:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:32,191 INFO L93 Difference]: Finished difference Result 502 states and 778 transitions. [2022-04-27 23:56:32,191 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 778 transitions. [2022-04-27 23:56:32,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:32,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:32,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 502 states. [2022-04-27 23:56:32,195 INFO L87 Difference]: Start difference. First operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 502 states. [2022-04-27 23:56:32,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:32,218 INFO L93 Difference]: Finished difference Result 502 states and 778 transitions. [2022-04-27 23:56:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 778 transitions. [2022-04-27 23:56:32,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:32,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:32,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:56:32,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:56:32,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 23:56:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 775 transitions. [2022-04-27 23:56:32,246 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 775 transitions. Word has length 42 [2022-04-27 23:56:32,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:56:32,246 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 775 transitions. [2022-04-27 23:56:32,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 23:56:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 775 transitions. [2022-04-27 23:56:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 23:56:32,247 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:56:32,247 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:56:32,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 23:56:32,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 23:56:32,467 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:56:32,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:56:32,468 INFO L85 PathProgramCache]: Analyzing trace with hash -982799261, now seen corresponding path program 1 times [2022-04-27 23:56:32,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:56:32,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324561074] [2022-04-27 23:56:32,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:32,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:56:32,487 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:56:32,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894595291] [2022-04-27 23:56:32,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:32,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:32,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:56:32,490 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:56:32,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 23:56:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:32,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 23:56:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:32,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:56:32,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {15963#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15963#true} is VALID [2022-04-27 23:56:32,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {15963#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:32,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {15971#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:32,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15971#(<= ~counter~0 0)} {15963#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:32,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {15971#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:32,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {15971#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:32,802 INFO L272 TraceCheckUtils]: 6: Hoare triple {15971#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:32,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {15971#(<= ~counter~0 0)} [119] 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] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:32,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {15971#(<= ~counter~0 0)} [122] 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[] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:32,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {15971#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:32,803 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15971#(<= ~counter~0 0)} {15971#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:32,804 INFO L272 TraceCheckUtils]: 11: Hoare triple {15971#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:32,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {15971#(<= ~counter~0 0)} [119] 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] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:32,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {15971#(<= ~counter~0 0)} [122] 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[] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:32,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {15971#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:32,806 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15971#(<= ~counter~0 0)} {15971#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:32,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {15971#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:32,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {15971#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {16020#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:32,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {16020#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {16020#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:32,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {16020#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {16020#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:32,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {16020#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {16030#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:32,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {16030#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {16030#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:32,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {16030#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {16030#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:32,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {16030#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {16030#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:32,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {16030#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {16043#(<= ~counter~0 3)} is VALID [2022-04-27 23:56:32,810 INFO L290 TraceCheckUtils]: 25: Hoare triple {16043#(<= ~counter~0 3)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {16043#(<= ~counter~0 3)} is VALID [2022-04-27 23:56:32,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {16043#(<= ~counter~0 3)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {16043#(<= ~counter~0 3)} is VALID [2022-04-27 23:56:32,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {16043#(<= ~counter~0 3)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {16053#(<= ~counter~0 4)} is VALID [2022-04-27 23:56:32,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {16053#(<= ~counter~0 4)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {16053#(<= ~counter~0 4)} is VALID [2022-04-27 23:56:32,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {16053#(<= ~counter~0 4)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {16053#(<= ~counter~0 4)} is VALID [2022-04-27 23:56:32,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {16053#(<= ~counter~0 4)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {16063#(<= |main_#t~post8| 4)} is VALID [2022-04-27 23:56:32,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {16063#(<= |main_#t~post8| 4)} [154] L48-1-->L48-4: Formula: (not (< |v_main_#t~post8_3| 5)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {15964#false} is VALID [2022-04-27 23:56:32,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {15964#false} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {15964#false} is VALID [2022-04-27 23:56:32,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {15964#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {15964#false} is VALID [2022-04-27 23:56:32,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {15964#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {15964#false} is VALID [2022-04-27 23:56:32,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {15964#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {15964#false} is VALID [2022-04-27 23:56:32,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {15964#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {15964#false} is VALID [2022-04-27 23:56:32,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {15964#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {15964#false} is VALID [2022-04-27 23:56:32,813 INFO L272 TraceCheckUtils]: 38: Hoare triple {15964#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {15964#false} is VALID [2022-04-27 23:56:32,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {15964#false} [130] __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] {15964#false} is VALID [2022-04-27 23:56:32,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {15964#false} [134] 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[] {15964#false} is VALID [2022-04-27 23:56:32,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {15964#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15964#false} is VALID [2022-04-27 23:56:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:56:32,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:56:33,023 INFO L290 TraceCheckUtils]: 41: Hoare triple {15964#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15964#false} is VALID [2022-04-27 23:56:33,023 INFO L290 TraceCheckUtils]: 40: Hoare triple {15964#false} [134] 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[] {15964#false} is VALID [2022-04-27 23:56:33,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {15964#false} [130] __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] {15964#false} is VALID [2022-04-27 23:56:33,023 INFO L272 TraceCheckUtils]: 38: Hoare triple {15964#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {15964#false} is VALID [2022-04-27 23:56:33,023 INFO L290 TraceCheckUtils]: 37: Hoare triple {15964#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {15964#false} is VALID [2022-04-27 23:56:33,023 INFO L290 TraceCheckUtils]: 36: Hoare triple {15964#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {15964#false} is VALID [2022-04-27 23:56:33,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {15964#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {15964#false} is VALID [2022-04-27 23:56:33,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {15964#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {15964#false} is VALID [2022-04-27 23:56:33,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {15964#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {15964#false} is VALID [2022-04-27 23:56:33,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {15964#false} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {15964#false} is VALID [2022-04-27 23:56:33,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {16063#(<= |main_#t~post8| 4)} [154] L48-1-->L48-4: Formula: (not (< |v_main_#t~post8_3| 5)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {15964#false} is VALID [2022-04-27 23:56:33,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {16053#(<= ~counter~0 4)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {16063#(<= |main_#t~post8| 4)} is VALID [2022-04-27 23:56:33,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {16053#(<= ~counter~0 4)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {16053#(<= ~counter~0 4)} is VALID [2022-04-27 23:56:33,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {16053#(<= ~counter~0 4)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {16053#(<= ~counter~0 4)} is VALID [2022-04-27 23:56:33,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {16043#(<= ~counter~0 3)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {16053#(<= ~counter~0 4)} is VALID [2022-04-27 23:56:33,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {16043#(<= ~counter~0 3)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {16043#(<= ~counter~0 3)} is VALID [2022-04-27 23:56:33,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {16043#(<= ~counter~0 3)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {16043#(<= ~counter~0 3)} is VALID [2022-04-27 23:56:33,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {16030#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {16043#(<= ~counter~0 3)} is VALID [2022-04-27 23:56:33,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {16030#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {16030#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:33,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {16030#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {16030#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:33,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {16030#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {16030#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:33,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {16020#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {16030#(<= ~counter~0 2)} is VALID [2022-04-27 23:56:33,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {16020#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {16020#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:33,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {16020#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {16020#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:33,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {15971#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {16020#(<= ~counter~0 1)} is VALID [2022-04-27 23:56:33,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {15971#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:33,030 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15963#true} {15971#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:33,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {15963#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15963#true} is VALID [2022-04-27 23:56:33,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {15963#true} [122] 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[] {15963#true} is VALID [2022-04-27 23:56:33,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {15963#true} [119] 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] {15963#true} is VALID [2022-04-27 23:56:33,030 INFO L272 TraceCheckUtils]: 11: Hoare triple {15971#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {15963#true} is VALID [2022-04-27 23:56:33,030 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15963#true} {15971#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:33,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {15963#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15963#true} is VALID [2022-04-27 23:56:33,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {15963#true} [122] 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[] {15963#true} is VALID [2022-04-27 23:56:33,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {15963#true} [119] 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] {15963#true} is VALID [2022-04-27 23:56:33,030 INFO L272 TraceCheckUtils]: 6: Hoare triple {15971#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {15963#true} is VALID [2022-04-27 23:56:33,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {15971#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:33,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {15971#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:33,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15971#(<= ~counter~0 0)} {15963#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:33,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {15971#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:33,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {15963#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {15971#(<= ~counter~0 0)} is VALID [2022-04-27 23:56:33,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {15963#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15963#true} is VALID [2022-04-27 23:56:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:56:33,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:56:33,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324561074] [2022-04-27 23:56:33,033 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:56:33,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894595291] [2022-04-27 23:56:33,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894595291] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:56:33,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:56:33,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-27 23:56:33,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123409922] [2022-04-27 23:56:33,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:56:33,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-04-27 23:56:33,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:56:33,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:56:33,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:33,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 23:56:33,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:56:33,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 23:56:33,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 23:56:33,065 INFO L87 Difference]: Start difference. First operand 498 states and 775 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:56:34,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:34,009 INFO L93 Difference]: Finished difference Result 859 states and 1363 transitions. [2022-04-27 23:56:34,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 23:56:34,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-04-27 23:56:34,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:56:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:56:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2022-04-27 23:56:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:56:34,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2022-04-27 23:56:34,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 132 transitions. [2022-04-27 23:56:34,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:34,133 INFO L225 Difference]: With dead ends: 859 [2022-04-27 23:56:34,133 INFO L226 Difference]: Without dead ends: 504 [2022-04-27 23:56:34,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 23:56:34,135 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 75 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:56:34,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 167 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:56:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-04-27 23:56:34,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 502. [2022-04-27 23:56:34,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:56:34,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 504 states. Second operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 23:56:34,850 INFO L74 IsIncluded]: Start isIncluded. First operand 504 states. Second operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 23:56:34,851 INFO L87 Difference]: Start difference. First operand 504 states. Second operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 23:56:34,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:34,875 INFO L93 Difference]: Finished difference Result 504 states and 778 transitions. [2022-04-27 23:56:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 778 transitions. [2022-04-27 23:56:34,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:34,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:34,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 504 states. [2022-04-27 23:56:34,879 INFO L87 Difference]: Start difference. First operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 504 states. [2022-04-27 23:56:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:34,901 INFO L93 Difference]: Finished difference Result 504 states and 778 transitions. [2022-04-27 23:56:34,901 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 778 transitions. [2022-04-27 23:56:34,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:34,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:34,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:56:34,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:56:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 23:56:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 777 transitions. [2022-04-27 23:56:34,931 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 777 transitions. Word has length 42 [2022-04-27 23:56:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:56:34,931 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 777 transitions. [2022-04-27 23:56:34,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:56:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 777 transitions. [2022-04-27 23:56:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 23:56:34,932 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:56:34,932 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:56:34,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 23:56:35,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:35,154 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:56:35,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:56:35,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1867030118, now seen corresponding path program 2 times [2022-04-27 23:56:35,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:56:35,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918165078] [2022-04-27 23:56:35,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:35,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:56:35,168 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:56:35,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [408427656] [2022-04-27 23:56:35,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 23:56:35,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:35,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:56:35,171 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:56:35,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 23:56:35,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 23:56:35,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 23:56:35,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 23:56:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:35,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:56:35,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {19341#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19341#true} is VALID [2022-04-27 23:56:35,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {19341#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {19341#true} is VALID [2022-04-27 23:56:35,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {19341#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19341#true} is VALID [2022-04-27 23:56:35,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19341#true} {19341#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19341#true} is VALID [2022-04-27 23:56:35,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {19341#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19341#true} is VALID [2022-04-27 23:56:35,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {19341#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {19341#true} is VALID [2022-04-27 23:56:35,348 INFO L272 TraceCheckUtils]: 6: Hoare triple {19341#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {19341#true} is VALID [2022-04-27 23:56:35,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {19341#true} [119] 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] {19341#true} is VALID [2022-04-27 23:56:35,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {19341#true} [122] 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[] {19341#true} is VALID [2022-04-27 23:56:35,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {19341#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19341#true} is VALID [2022-04-27 23:56:35,348 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19341#true} {19341#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {19341#true} is VALID [2022-04-27 23:56:35,349 INFO L272 TraceCheckUtils]: 11: Hoare triple {19341#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {19341#true} is VALID [2022-04-27 23:56:35,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {19341#true} [119] 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] {19341#true} is VALID [2022-04-27 23:56:35,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {19341#true} [122] 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[] {19341#true} is VALID [2022-04-27 23:56:35,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {19341#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19341#true} is VALID [2022-04-27 23:56:35,349 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19341#true} {19341#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {19341#true} is VALID [2022-04-27 23:56:35,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {19341#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {19341#true} is VALID [2022-04-27 23:56:35,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {19341#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {19341#true} is VALID [2022-04-27 23:56:35,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {19341#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {19341#true} is VALID [2022-04-27 23:56:35,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {19341#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {19341#true} is VALID [2022-04-27 23:56:35,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {19341#true} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {19341#true} is VALID [2022-04-27 23:56:35,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {19341#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {19341#true} is VALID [2022-04-27 23:56:35,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {19341#true} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {19412#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 23:56:35,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {19412#(not (<= main_~b~0 main_~c~0))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {19416#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 23:56:35,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {19416#(< main_~b~0 main_~a~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {19416#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 23:56:35,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {19416#(< main_~b~0 main_~a~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {19416#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 23:56:35,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {19416#(< main_~b~0 main_~a~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {19426#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 23:56:35,351 INFO L290 TraceCheckUtils]: 27: Hoare triple {19426#(< main_~b~0 main_~c~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {19426#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 23:56:35,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {19426#(< main_~b~0 main_~c~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {19426#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 23:56:35,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {19426#(< main_~b~0 main_~c~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {19342#false} is VALID [2022-04-27 23:56:35,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {19342#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {19342#false} is VALID [2022-04-27 23:56:35,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {19342#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {19342#false} is VALID [2022-04-27 23:56:35,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {19342#false} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {19342#false} is VALID [2022-04-27 23:56:35,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {19342#false} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {19342#false} is VALID [2022-04-27 23:56:35,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {19342#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {19342#false} is VALID [2022-04-27 23:56:35,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {19342#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {19342#false} is VALID [2022-04-27 23:56:35,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {19342#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {19342#false} is VALID [2022-04-27 23:56:35,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {19342#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {19342#false} is VALID [2022-04-27 23:56:35,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {19342#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {19342#false} is VALID [2022-04-27 23:56:35,356 INFO L272 TraceCheckUtils]: 39: Hoare triple {19342#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {19342#false} is VALID [2022-04-27 23:56:35,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {19342#false} [130] __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] {19342#false} is VALID [2022-04-27 23:56:35,356 INFO L290 TraceCheckUtils]: 41: Hoare triple {19342#false} [134] 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[] {19342#false} is VALID [2022-04-27 23:56:35,356 INFO L290 TraceCheckUtils]: 42: Hoare triple {19342#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19342#false} is VALID [2022-04-27 23:56:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 23:56:35,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:56:35,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:56:35,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918165078] [2022-04-27 23:56:35,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:56:35,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408427656] [2022-04-27 23:56:35,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408427656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:56:35,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:56:35,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:56:35,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745817980] [2022-04-27 23:56:35,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:56:35,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-04-27 23:56:35,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:56:35,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:56:35,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:35,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:56:35,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:56:35,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:56:35,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:56:35,402 INFO L87 Difference]: Start difference. First operand 502 states and 777 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:56:36,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:36,775 INFO L93 Difference]: Finished difference Result 1073 states and 1723 transitions. [2022-04-27 23:56:36,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 23:56:36,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-04-27 23:56:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:56:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:56:36,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-27 23:56:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:56:36,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-27 23:56:36,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2022-04-27 23:56:36,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:56:36,919 INFO L225 Difference]: With dead ends: 1073 [2022-04-27 23:56:36,919 INFO L226 Difference]: Without dead ends: 760 [2022-04-27 23:56:36,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 23:56:36,921 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 29 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:56:36,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 173 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:56:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-04-27 23:56:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 523. [2022-04-27 23:56:37,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:56:37,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 760 states. Second operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-27 23:56:37,733 INFO L74 IsIncluded]: Start isIncluded. First operand 760 states. Second operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-27 23:56:37,733 INFO L87 Difference]: Start difference. First operand 760 states. Second operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-27 23:56:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:37,783 INFO L93 Difference]: Finished difference Result 760 states and 1199 transitions. [2022-04-27 23:56:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1199 transitions. [2022-04-27 23:56:37,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:37,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:37,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) Second operand 760 states. [2022-04-27 23:56:37,788 INFO L87 Difference]: Start difference. First operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) Second operand 760 states. [2022-04-27 23:56:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:56:37,846 INFO L93 Difference]: Finished difference Result 760 states and 1199 transitions. [2022-04-27 23:56:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1199 transitions. [2022-04-27 23:56:37,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:56:37,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:56:37,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:56:37,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:56:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-27 23:56:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 794 transitions. [2022-04-27 23:56:37,879 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 794 transitions. Word has length 43 [2022-04-27 23:56:37,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:56:37,879 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 794 transitions. [2022-04-27 23:56:37,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:56:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 794 transitions. [2022-04-27 23:56:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 23:56:37,882 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:56:37,882 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:56:37,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 23:56:38,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 23:56:38,107 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:56:38,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:56:38,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2059301326, now seen corresponding path program 1 times [2022-04-27 23:56:38,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:56:38,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507416816] [2022-04-27 23:56:38,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:38,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:56:38,129 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:56:38,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1917867349] [2022-04-27 23:56:38,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:56:38,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:56:38,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:56:38,142 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:56:38,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 23:56:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:38,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-27 23:56:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:56:38,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:56:38,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {23453#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23453#true} is VALID [2022-04-27 23:56:38,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {23453#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {23453#true} is VALID [2022-04-27 23:56:38,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {23453#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23453#true} is VALID [2022-04-27 23:56:38,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23453#true} {23453#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23453#true} is VALID [2022-04-27 23:56:38,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {23453#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23453#true} is VALID [2022-04-27 23:56:38,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {23453#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23453#true} is VALID [2022-04-27 23:56:38,985 INFO L272 TraceCheckUtils]: 6: Hoare triple {23453#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {23453#true} is VALID [2022-04-27 23:56:38,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {23453#true} [119] 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] {23453#true} is VALID [2022-04-27 23:56:38,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {23453#true} [122] 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[] {23453#true} is VALID [2022-04-27 23:56:38,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {23453#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23453#true} is VALID [2022-04-27 23:56:38,985 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23453#true} {23453#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {23453#true} is VALID [2022-04-27 23:56:38,986 INFO L272 TraceCheckUtils]: 11: Hoare triple {23453#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {23453#true} is VALID [2022-04-27 23:56:38,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {23453#true} [119] 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] {23453#true} is VALID [2022-04-27 23:56:38,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {23453#true} [122] 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[] {23453#true} is VALID [2022-04-27 23:56:38,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {23453#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23453#true} is VALID [2022-04-27 23:56:38,986 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23453#true} {23453#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {23453#true} is VALID [2022-04-27 23:56:38,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {23453#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23506#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:38,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {23506#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {23506#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:38,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {23506#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {23506#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:38,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {23506#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {23516#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:38,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {23516#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {23516#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:38,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {23516#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {23516#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:38,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {23516#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {23526#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:38,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {23526#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {23526#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:38,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {23526#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {23526#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:38,990 INFO L272 TraceCheckUtils]: 25: Hoare triple {23526#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {23453#true} is VALID [2022-04-27 23:56:38,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {23453#true} [130] __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] {23539#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:56:38,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {23539#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] 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[] {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:56:38,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:56:38,992 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} {23526#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:38,992 INFO L272 TraceCheckUtils]: 30: Hoare triple {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {23453#true} is VALID [2022-04-27 23:56:38,993 INFO L290 TraceCheckUtils]: 31: Hoare triple {23453#true} [130] __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] {23539#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:56:38,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {23539#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] 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[] {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:56:38,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:56:38,994 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:38,994 INFO L272 TraceCheckUtils]: 35: Hoare triple {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {23453#true} is VALID [2022-04-27 23:56:38,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {23453#true} [130] __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] {23453#true} is VALID [2022-04-27 23:56:38,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {23453#true} [135] 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[] {23453#true} is VALID [2022-04-27 23:56:38,995 INFO L290 TraceCheckUtils]: 38: Hoare triple {23453#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23453#true} is VALID [2022-04-27 23:56:38,995 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23453#true} {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:38,996 INFO L272 TraceCheckUtils]: 40: Hoare triple {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {23453#true} is VALID [2022-04-27 23:56:38,996 INFO L290 TraceCheckUtils]: 41: Hoare triple {23453#true} [130] __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] {23453#true} is VALID [2022-04-27 23:56:38,996 INFO L290 TraceCheckUtils]: 42: Hoare triple {23453#true} [135] 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[] {23453#true} is VALID [2022-04-27 23:56:38,996 INFO L290 TraceCheckUtils]: 43: Hoare triple {23453#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23453#true} is VALID [2022-04-27 23:56:38,997 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {23453#true} {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:38,997 INFO L290 TraceCheckUtils]: 45: Hoare triple {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:38,998 INFO L290 TraceCheckUtils]: 46: Hoare triple {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {23602#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:38,998 INFO L290 TraceCheckUtils]: 47: Hoare triple {23602#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {23602#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:38,999 INFO L290 TraceCheckUtils]: 48: Hoare triple {23602#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {23602#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:38,999 INFO L290 TraceCheckUtils]: 49: Hoare triple {23602#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {23602#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:56:39,000 INFO L290 TraceCheckUtils]: 50: Hoare triple {23602#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23615#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 23:56:39,000 INFO L290 TraceCheckUtils]: 51: Hoare triple {23615#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {23615#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 23:56:39,001 INFO L290 TraceCheckUtils]: 52: Hoare triple {23615#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {23615#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 23:56:39,001 INFO L290 TraceCheckUtils]: 53: Hoare triple {23615#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {23625#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 23:56:39,002 INFO L272 TraceCheckUtils]: 54: Hoare triple {23625#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0))} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23629#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:56:39,002 INFO L290 TraceCheckUtils]: 55: Hoare triple {23629#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {23633#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:56:39,003 INFO L290 TraceCheckUtils]: 56: Hoare triple {23633#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {23454#false} is VALID [2022-04-27 23:56:39,003 INFO L290 TraceCheckUtils]: 57: Hoare triple {23454#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23454#false} is VALID [2022-04-27 23:56:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 23:56:39,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:57:24,720 INFO L290 TraceCheckUtils]: 57: Hoare triple {23454#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23454#false} is VALID [2022-04-27 23:57:24,721 INFO L290 TraceCheckUtils]: 56: Hoare triple {23633#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {23454#false} is VALID [2022-04-27 23:57:24,721 INFO L290 TraceCheckUtils]: 55: Hoare triple {23629#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {23633#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:57:24,722 INFO L272 TraceCheckUtils]: 54: Hoare triple {23649#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23629#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:57:24,723 INFO L290 TraceCheckUtils]: 53: Hoare triple {23653#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {23649#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:57:24,723 INFO L290 TraceCheckUtils]: 52: Hoare triple {23653#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {23653#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 23:57:24,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {23653#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {23653#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 23:57:25,039 INFO L290 TraceCheckUtils]: 50: Hoare triple {23663#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, 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_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23653#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 23:57:25,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {23663#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {23663#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 23:57:25,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {23663#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {23663#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 23:57:25,041 INFO L290 TraceCheckUtils]: 47: Hoare triple {23663#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {23663#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 23:57:25,076 INFO L290 TraceCheckUtils]: 46: Hoare triple {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {23663#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 23:57:25,077 INFO L290 TraceCheckUtils]: 45: Hoare triple {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 23:57:25,078 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {23453#true} {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 23:57:25,078 INFO L290 TraceCheckUtils]: 43: Hoare triple {23453#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23453#true} is VALID [2022-04-27 23:57:25,078 INFO L290 TraceCheckUtils]: 42: Hoare triple {23453#true} [135] 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[] {23453#true} is VALID [2022-04-27 23:57:25,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {23453#true} [130] __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] {23453#true} is VALID [2022-04-27 23:57:25,078 INFO L272 TraceCheckUtils]: 40: Hoare triple {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {23453#true} is VALID [2022-04-27 23:57:25,079 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23453#true} {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 23:57:25,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {23453#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23453#true} is VALID [2022-04-27 23:57:25,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {23453#true} [135] 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[] {23453#true} is VALID [2022-04-27 23:57:25,079 INFO L290 TraceCheckUtils]: 36: Hoare triple {23453#true} [130] __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] {23453#true} is VALID [2022-04-27 23:57:25,079 INFO L272 TraceCheckUtils]: 35: Hoare triple {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {23453#true} is VALID [2022-04-27 23:57:25,081 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} {23713#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 23:57:25,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:57:25,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {23723#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] 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[] {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:57:25,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {23453#true} [130] __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] {23723#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 23:57:25,082 INFO L272 TraceCheckUtils]: 30: Hoare triple {23713#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {23453#true} is VALID [2022-04-27 23:57:25,083 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} {23730#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {23713#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 23:57:25,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:57:25,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {23723#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] 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[] {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:57:25,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {23453#true} [130] __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] {23723#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 23:57:25,085 INFO L272 TraceCheckUtils]: 25: Hoare triple {23730#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {23453#true} is VALID [2022-04-27 23:57:25,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {23730#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {23730#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 23:57:25,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {23730#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {23730#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 23:57:25,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {23752#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* 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)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {23730#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 23:57:25,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {23752#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* 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)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {23752#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* 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)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-27 23:57:25,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {23752#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* 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)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {23752#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* 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)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-27 23:57:25,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {23453#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {23752#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* 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)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-27 23:57:25,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {23453#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {23453#true} is VALID [2022-04-27 23:57:25,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {23453#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {23453#true} is VALID [2022-04-27 23:57:25,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {23453#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23453#true} is VALID [2022-04-27 23:57:25,091 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23453#true} {23453#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {23453#true} is VALID [2022-04-27 23:57:25,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {23453#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23453#true} is VALID [2022-04-27 23:57:25,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {23453#true} [122] 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[] {23453#true} is VALID [2022-04-27 23:57:25,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {23453#true} [119] 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] {23453#true} is VALID [2022-04-27 23:57:25,091 INFO L272 TraceCheckUtils]: 11: Hoare triple {23453#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {23453#true} is VALID [2022-04-27 23:57:25,091 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23453#true} {23453#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {23453#true} is VALID [2022-04-27 23:57:25,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {23453#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23453#true} is VALID [2022-04-27 23:57:25,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {23453#true} [122] 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[] {23453#true} is VALID [2022-04-27 23:57:25,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {23453#true} [119] 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] {23453#true} is VALID [2022-04-27 23:57:25,092 INFO L272 TraceCheckUtils]: 6: Hoare triple {23453#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {23453#true} is VALID [2022-04-27 23:57:25,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {23453#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23453#true} is VALID [2022-04-27 23:57:25,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {23453#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23453#true} is VALID [2022-04-27 23:57:25,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23453#true} {23453#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23453#true} is VALID [2022-04-27 23:57:25,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {23453#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23453#true} is VALID [2022-04-27 23:57:25,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {23453#true} [113] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {23453#true} is VALID [2022-04-27 23:57:25,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {23453#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23453#true} is VALID [2022-04-27 23:57:25,093 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 23:57:25,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:57:25,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507416816] [2022-04-27 23:57:25,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:57:25,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917867349] [2022-04-27 23:57:25,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917867349] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:57:25,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:57:25,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-27 23:57:25,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997355711] [2022-04-27 23:57:25,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:57:25,094 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 58 [2022-04-27 23:57:25,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:57:25,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-27 23:57:25,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:57:25,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 23:57:25,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:57:25,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 23:57:25,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-27 23:57:25,266 INFO L87 Difference]: Start difference. First operand 523 states and 794 transitions. Second operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-27 23:57:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:57:38,705 INFO L93 Difference]: Finished difference Result 838 states and 1289 transitions. [2022-04-27 23:57:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 23:57:38,706 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 58 [2022-04-27 23:57:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:57:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-27 23:57:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 314 transitions. [2022-04-27 23:57:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-27 23:57:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 314 transitions. [2022-04-27 23:57:38,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 314 transitions. [2022-04-27 23:57:47,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 314 edges. 314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:57:47,355 INFO L225 Difference]: With dead ends: 838 [2022-04-27 23:57:47,355 INFO L226 Difference]: Without dead ends: 834 [2022-04-27 23:57:47,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 23:57:47,356 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 161 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-27 23:57:47,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 621 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-27 23:57:47,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-04-27 23:57:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 673. [2022-04-27 23:57:48,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:57:48,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 834 states. Second operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 23:57:48,364 INFO L74 IsIncluded]: Start isIncluded. First operand 834 states. Second operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 23:57:48,365 INFO L87 Difference]: Start difference. First operand 834 states. Second operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 23:57:48,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:57:48,415 INFO L93 Difference]: Finished difference Result 834 states and 1273 transitions. [2022-04-27 23:57:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1273 transitions. [2022-04-27 23:57:48,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:57:48,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:57:48,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) Second operand 834 states. [2022-04-27 23:57:48,420 INFO L87 Difference]: Start difference. First operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) Second operand 834 states. [2022-04-27 23:57:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:57:48,468 INFO L93 Difference]: Finished difference Result 834 states and 1273 transitions. [2022-04-27 23:57:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1273 transitions. [2022-04-27 23:57:48,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:57:48,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:57:48,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:57:48,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:57:48,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 23:57:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1016 transitions. [2022-04-27 23:57:48,511 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1016 transitions. Word has length 58 [2022-04-27 23:57:48,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:57:48,512 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 1016 transitions. [2022-04-27 23:57:48,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-27 23:57:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1016 transitions. [2022-04-27 23:57:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 23:57:48,513 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:57:48,513 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:57:48,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-27 23:57:48,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 23:57:48,734 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:57:48,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:57:48,734 INFO L85 PathProgramCache]: Analyzing trace with hash -80402644, now seen corresponding path program 1 times [2022-04-27 23:57:48,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:57:48,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192207426] [2022-04-27 23:57:48,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:57:48,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:57:48,754 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:57:48,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1480612820] [2022-04-27 23:57:48,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:57:48,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:57:48,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:57:48,755 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 23:57:48,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 23:57:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 23:57:48,825 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 23:57:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 23:57:48,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 23:57:48,905 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 23:57:48,906 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 23:57:48,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-27 23:57:49,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 23:57:49,122 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:57:49,125 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 23:57:49,181 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 23:57:49,181 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 23:57:49,181 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 23:57:49,181 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 23:57:49,181 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 23:57:49,181 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 23:57:49,181 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 23:57:49,181 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 23:57:49,181 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 23:57:49,181 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 23:57:49,181 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 23:57:49,181 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 23:57:49,181 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-27 23:57:49,181 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 23:57:49,181 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 23:57:49,181 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-27 23:57:49,182 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 23:57:49,183 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 23:57:49,183 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 23:57:49,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:57:49 BasicIcfg [2022-04-27 23:57:49,185 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 23:57:49,186 INFO L158 Benchmark]: Toolchain (without parser) took 106318.36ms. Allocated memory was 179.3MB in the beginning and 297.8MB in the end (delta: 118.5MB). Free memory was 129.8MB in the beginning and 244.7MB in the end (delta: -114.8MB). Peak memory consumption was 4.7MB. Max. memory is 8.0GB. [2022-04-27 23:57:49,186 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 23:57:49,187 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.94ms. Allocated memory is still 179.3MB. Free memory was 129.7MB in the beginning and 157.4MB in the end (delta: -27.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 23:57:49,187 INFO L158 Benchmark]: Boogie Preprocessor took 46.02ms. Allocated memory is still 179.3MB. Free memory was 157.4MB in the beginning and 156.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 23:57:49,187 INFO L158 Benchmark]: RCFGBuilder took 390.23ms. Allocated memory is still 179.3MB. Free memory was 155.6MB in the beginning and 142.7MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 23:57:49,187 INFO L158 Benchmark]: IcfgTransformer took 48.69ms. Allocated memory is still 179.3MB. Free memory was 142.7MB in the beginning and 140.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 23:57:49,188 INFO L158 Benchmark]: TraceAbstraction took 105520.06ms. Allocated memory was 179.3MB in the beginning and 297.8MB in the end (delta: 118.5MB). Free memory was 140.2MB in the beginning and 244.7MB in the end (delta: -104.4MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. [2022-04-27 23:57:49,190 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.11ms. Allocated memory is still 179.3MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 306.94ms. Allocated memory is still 179.3MB. Free memory was 129.7MB in the beginning and 157.4MB in the end (delta: -27.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.02ms. Allocated memory is still 179.3MB. Free memory was 157.4MB in the beginning and 156.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 390.23ms. Allocated memory is still 179.3MB. Free memory was 155.6MB in the beginning and 142.7MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 48.69ms. Allocated memory is still 179.3MB. Free memory was 142.7MB in the beginning and 140.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 105520.06ms. Allocated memory was 179.3MB in the beginning and 297.8MB in the end (delta: 118.5MB). Free memory was 140.2MB in the beginning and 244.7MB in the end (delta: -104.4MB). Peak memory consumption was 14.4MB. 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 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=10, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=2, y=3] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=2, y=3] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [\old(counter)=0, a=2, b=3, counter=0, p=1, q=0, r=0, s=1, x=2, y=3] [L34] EXPR counter++ VAL [\old(counter)=0, a=2, b=3, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=2, y=3] [L34] COND TRUE counter++<5 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=2, b=3, c=2, counter=1, k=0, p=1, q=0, r=0, s=1, x=2, y=3] [L41] EXPR counter++ VAL [\old(counter)=0, a=2, b=3, c=2, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=2, y=3] [L41] COND TRUE counter++<5 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=2, b=3, c=2, counter=2, k=0, p=1, q=0, r=0, s=1, x=2, y=3] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=3, b=2, c=2, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=2, y=3] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=2, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=2, y=3] [L34] COND TRUE counter++<5 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=3, b=2, c=3, counter=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=2, y=3] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=4, counter++=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=2, y=3] [L41] COND TRUE counter++<5 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=3, b=2, c=3, counter=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L48] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, counter++=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L48] COND TRUE counter++<5 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=3, b=2, c=1, counter=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=1, counter=6, counter++=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L41] COND FALSE !(counter++<5) [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=2, b=1, c=1, counter=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=2, x=2, y=3] [L34] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=7, counter++=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=2, x=2, y=3] [L34] COND FALSE !(counter++<5) [L73] CALL __VERIFIER_assert(p*x - q*x + r*y - s*y == a) VAL [\old(cond)=0, \old(counter)=0, counter=7] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=7] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 105.4s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 36.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1039 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 982 mSDsluCounter, 3686 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2835 mSDsCounter, 602 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2877 IncrementalHoareTripleChecker+Invalid, 3479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 602 mSolverCounterUnsat, 851 mSDtfsCounter, 2877 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 914 GetRequests, 747 SyntacticMatches, 7 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=673occurred in iteration=17, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 578 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 57.1s InterpolantComputationTime, 666 NumberOfCodeBlocks, 666 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 859 ConstructedInterpolants, 0 QuantifiedInterpolants, 3856 SizeOfPredicates, 54 NumberOfNonLiveVariables, 2313 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 246/348 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-27 23:57:49,227 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...