/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/fermat1-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 03:06:32,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 03:06:32,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 03:06:32,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 03:06:32,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 03:06:32,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 03:06:32,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 03:06:32,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 03:06:32,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 03:06:32,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 03:06:32,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 03:06:32,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 03:06:32,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 03:06:32,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 03:06:32,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 03:06:32,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 03:06:32,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 03:06:32,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 03:06:32,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 03:06:32,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 03:06:32,058 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 03:06:32,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 03:06:32,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 03:06:32,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 03:06:32,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 03:06:32,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 03:06:32,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 03:06:32,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 03:06:32,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 03:06:32,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 03:06:32,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 03:06:32,071 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 03:06:32,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 03:06:32,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 03:06:32,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 03:06:32,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 03:06:32,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 03:06:32,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 03:06:32,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 03:06:32,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 03:06:32,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 03:06:32,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 03:06:32,083 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 03:06:32,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 03:06:32,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 03:06:32,115 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 03:06:32,115 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 03:06:32,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 03:06:32,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 03:06:32,116 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 03:06:32,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 03:06:32,116 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 03:06:32,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 03:06:32,117 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 03:06:32,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 03:06:32,118 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 03:06:32,118 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 03:06:32,118 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 03:06:32,118 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 03:06:32,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 03:06:32,119 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 03:06:32,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 03:06:32,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:06:32,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 03:06:32,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 03:06:32,119 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 03:06:32,119 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 03:06:32,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 03:06:32,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 03:06:32,120 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 03:06:32,120 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 03:06:32,121 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 03:06:32,121 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 03:06:32,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 03:06:32,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 03:06:32,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 03:06:32,341 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 03:06:32,342 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 03:06:32,343 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2022-04-15 03:06:32,393 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddd150990/dd8b2b8404504cffb51fd685d1d35771/FLAGa249677cd [2022-04-15 03:06:32,781 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 03:06:32,782 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2022-04-15 03:06:32,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddd150990/dd8b2b8404504cffb51fd685d1d35771/FLAGa249677cd [2022-04-15 03:06:32,800 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddd150990/dd8b2b8404504cffb51fd685d1d35771 [2022-04-15 03:06:32,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 03:06:32,805 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 03:06:32,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 03:06:32,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 03:06:32,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 03:06:32,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:06:32" (1/1) ... [2022-04-15 03:06:32,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@208be2af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:06:32, skipping insertion in model container [2022-04-15 03:06:32,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:06:32" (1/1) ... [2022-04-15 03:06:32,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 03:06:32,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 03:06:33,000 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/fermat1-ll_unwindbound10.c[535,548] [2022-04-15 03:06:33,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:06:33,048 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 03:06:33,065 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/fermat1-ll_unwindbound10.c[535,548] [2022-04-15 03:06:33,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:06:33,098 INFO L208 MainTranslator]: Completed translation [2022-04-15 03:06:33,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:06:33 WrapperNode [2022-04-15 03:06:33,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 03:06:33,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 03:06:33,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 03:06:33,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 03:06:33,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:06:33" (1/1) ... [2022-04-15 03:06:33,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:06:33" (1/1) ... [2022-04-15 03:06:33,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:06:33" (1/1) ... [2022-04-15 03:06:33,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:06:33" (1/1) ... [2022-04-15 03:06:33,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:06:33" (1/1) ... [2022-04-15 03:06:33,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:06:33" (1/1) ... [2022-04-15 03:06:33,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:06:33" (1/1) ... [2022-04-15 03:06:33,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 03:06:33,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 03:06:33,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 03:06:33,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 03:06:33,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:06:33" (1/1) ... [2022-04-15 03:06:33,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:06:33,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:06:33,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 03:06:33,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 03:06:33,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 03:06:33,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 03:06:33,218 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 03:06:33,218 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 03:06:33,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 03:06:33,218 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 03:06:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 03:06:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 03:06:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 03:06:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 03:06:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 03:06:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 03:06:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 03:06:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 03:06:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 03:06:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 03:06:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 03:06:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 03:06:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 03:06:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 03:06:33,279 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 03:06:33,280 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 03:06:33,424 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 03:06:33,430 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 03:06:33,431 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 03:06:33,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:06:33 BoogieIcfgContainer [2022-04-15 03:06:33,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 03:06:33,433 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 03:06:33,433 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 03:06:33,434 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 03:06:33,444 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:06:33" (1/1) ... [2022-04-15 03:06:33,446 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 03:06:33,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:06:33 BasicIcfg [2022-04-15 03:06:33,506 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 03:06:33,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 03:06:33,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 03:06:33,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 03:06:33,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:06:32" (1/4) ... [2022-04-15 03:06:33,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73eea5ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:06:33, skipping insertion in model container [2022-04-15 03:06:33,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:06:33" (2/4) ... [2022-04-15 03:06:33,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73eea5ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:06:33, skipping insertion in model container [2022-04-15 03:06:33,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:06:33" (3/4) ... [2022-04-15 03:06:33,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73eea5ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:06:33, skipping insertion in model container [2022-04-15 03:06:33,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:06:33" (4/4) ... [2022-04-15 03:06:33,514 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound10.cqvasr [2022-04-15 03:06:33,518 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 03:06:33,518 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 03:06:33,576 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 03:06:33,582 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 03:06:33,583 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 03:06:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 03:06:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 03:06:33,604 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:06:33,604 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:06:33,605 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:06:33,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:06:33,609 INFO L85 PathProgramCache]: Analyzing trace with hash -758992103, now seen corresponding path program 1 times [2022-04-15 03:06:33,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:06:33,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441045135] [2022-04-15 03:06:33,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:06:33,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:06:33,735 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:06:33,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [49136339] [2022-04-15 03:06:33,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:06:33,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:06:33,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:06:33,743 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:06:33,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 03:06:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:06:33,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-15 03:06:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:06:33,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:06:33,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-15 03:06:33,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {40#true} is VALID [2022-04-15 03:06:33,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-15 03:06:33,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-15 03:06:33,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-15 03:06:33,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {40#true} is VALID [2022-04-15 03:06:33,979 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {40#true} is VALID [2022-04-15 03:06:33,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} [113] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-15 03:06:33,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} [115] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 03:06:33,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 03:06:33,982 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {41#false} is VALID [2022-04-15 03:06:33,982 INFO L272 TraceCheckUtils]: 11: Hoare triple {41#false} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 03:06:33,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} [113] assume_abort_if_notENTRY-->L9: 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] {41#false} is VALID [2022-04-15 03:06:33,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} [115] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 03:06:33,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 03:06:33,984 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {41#false} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-15 03:06:33,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {41#false} is VALID [2022-04-15 03:06:33,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} [117] L47-3-->L34-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 03:06:33,985 INFO L272 TraceCheckUtils]: 18: Hoare triple {41#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {41#false} is VALID [2022-04-15 03:06:33,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {41#false} is VALID [2022-04-15 03:06:33,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 03:06:33,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-15 03:06:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 03:06:33,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:06:33,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:06:33,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441045135] [2022-04-15 03:06:33,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:06:33,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49136339] [2022-04-15 03:06:33,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49136339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:06:33,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:06:33,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 03:06:33,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901670395] [2022-04-15 03:06:33,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:06:33,999 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 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 22 [2022-04-15 03:06:34,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:06:34,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 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-15 03:06:34,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:06:34,035 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-15 03:06:34,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:06:34,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-15 03:06:34,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 03:06:34,075 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 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-15 03:06:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:06:34,161 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-15 03:06:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-15 03:06:34,161 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 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 22 [2022-04-15 03:06:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:06:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 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-15 03:06:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-15 03:06:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 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-15 03:06:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-15 03:06:34,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-15 03:06:34,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:06:34,322 INFO L225 Difference]: With dead ends: 67 [2022-04-15 03:06:34,323 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 03:06:34,325 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 03:06:34,329 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:06:34,331 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:06:34,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 03:06:34,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 03:06:34,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:06:34,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 03:06:34,359 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 03:06:34,360 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 03:06:34,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:06:34,368 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 03:06:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 03:06:34,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:06:34,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:06:34,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-15 03:06:34,370 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-15 03:06:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:06:34,375 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 03:06:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 03:06:34,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:06:34,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:06:34,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:06:34,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:06:34,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 03:06:34,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-15 03:06:34,380 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-15 03:06:34,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:06:34,380 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-15 03:06:34,380 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 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-15 03:06:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 03:06:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 03:06:34,381 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:06:34,381 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:06:34,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 03:06:34,591 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-15 03:06:34,591 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:06:34,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:06:34,592 INFO L85 PathProgramCache]: Analyzing trace with hash -713449777, now seen corresponding path program 1 times [2022-04-15 03:06:34,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:06:34,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992947131] [2022-04-15 03:06:34,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:06:34,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:06:34,618 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:06:34,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [62167627] [2022-04-15 03:06:34,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:06:34,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:06:34,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:06:34,628 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:06:34,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 03:06:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:06:34,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 03:06:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:06:34,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:06:34,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {307#true} is VALID [2022-04-15 03:06:34,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {315#(<= ~counter~0 0)} is VALID [2022-04-15 03:06:34,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {315#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#(<= ~counter~0 0)} is VALID [2022-04-15 03:06:34,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {315#(<= ~counter~0 0)} {307#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#(<= ~counter~0 0)} is VALID [2022-04-15 03:06:34,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {315#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#(<= ~counter~0 0)} is VALID [2022-04-15 03:06:34,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {315#(<= ~counter~0 0)} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {315#(<= ~counter~0 0)} is VALID [2022-04-15 03:06:34,922 INFO L272 TraceCheckUtils]: 6: Hoare triple {315#(<= ~counter~0 0)} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {315#(<= ~counter~0 0)} is VALID [2022-04-15 03:06:34,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: 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] {315#(<= ~counter~0 0)} is VALID [2022-04-15 03:06:34,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {315#(<= ~counter~0 0)} [116] L9-->L9-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[] {315#(<= ~counter~0 0)} is VALID [2022-04-15 03:06:34,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#(<= ~counter~0 0)} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#(<= ~counter~0 0)} is VALID [2022-04-15 03:06:34,924 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {315#(<= ~counter~0 0)} is VALID [2022-04-15 03:06:34,925 INFO L272 TraceCheckUtils]: 11: Hoare triple {315#(<= ~counter~0 0)} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {315#(<= ~counter~0 0)} is VALID [2022-04-15 03:06:34,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: 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] {315#(<= ~counter~0 0)} is VALID [2022-04-15 03:06:34,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#(<= ~counter~0 0)} [116] L9-->L9-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[] {315#(<= ~counter~0 0)} is VALID [2022-04-15 03:06:34,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#(<= ~counter~0 0)} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#(<= ~counter~0 0)} is VALID [2022-04-15 03:06:34,928 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {315#(<= ~counter~0 0)} is VALID [2022-04-15 03:06:34,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {315#(<= ~counter~0 0)} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {315#(<= ~counter~0 0)} is VALID [2022-04-15 03:06:34,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#(<= ~counter~0 0)} [118] L47-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] {364#(<= |main_#t~post6| 0)} is VALID [2022-04-15 03:06:34,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#(<= |main_#t~post6| 0)} [121] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {308#false} is VALID [2022-04-15 03:06:34,931 INFO L272 TraceCheckUtils]: 19: Hoare triple {308#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {308#false} is VALID [2022-04-15 03:06:34,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {308#false} is VALID [2022-04-15 03:06:34,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {308#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {308#false} is VALID [2022-04-15 03:06:34,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {308#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {308#false} is VALID [2022-04-15 03:06:34,932 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-15 03:06:34,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:06:34,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:06:34,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992947131] [2022-04-15 03:06:34,933 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:06:34,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62167627] [2022-04-15 03:06:34,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62167627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:06:34,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:06:34,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 03:06:34,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110514010] [2022-04-15 03:06:34,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:06:34,935 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-15 03:06:34,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:06:34,936 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-15 03:06:34,954 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-15 03:06:34,954 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 03:06:34,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:06:34,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 03:06:34,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 03:06:34,955 INFO L87 Difference]: Start difference. First operand 32 states and 41 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-15 03:06:35,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:06:35,087 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 03:06:35,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 03:06:35,088 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-15 03:06:35,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:06:35,088 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-15 03:06:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 03:06:35,090 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-15 03:06:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 03:06:35,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-15 03:06:35,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:06:35,147 INFO L225 Difference]: With dead ends: 41 [2022-04-15 03:06:35,148 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 03:06:35,148 INFO L912 BasicCegarLoop]: 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-15 03:06:35,149 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 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-15 03:06:35,150 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:06:35,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 03:06:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 03:06:35,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:06:35,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 03:06:35,161 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 03:06:35,164 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 03:06:35,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:06:35,170 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 03:06:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 03:06:35,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:06:35,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:06:35,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-15 03:06:35,172 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-15 03:06:35,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:06:35,177 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 03:06:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 03:06:35,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:06:35,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:06:35,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:06:35,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:06:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 03:06:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-15 03:06:35,180 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-15 03:06:35,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:06:35,180 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-15 03:06:35,180 INFO L479 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-15 03:06:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 03:06:35,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 03:06:35,181 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:06:35,181 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:06:35,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 03:06:35,409 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-15 03:06:35,409 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:06:35,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:06:35,410 INFO L85 PathProgramCache]: Analyzing trace with hash -712377301, now seen corresponding path program 1 times [2022-04-15 03:06:35,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:06:35,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996125077] [2022-04-15 03:06:35,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:06:35,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:06:35,427 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:06:35,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015162585] [2022-04-15 03:06:35,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:06:35,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:06:35,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:06:35,429 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:06:35,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 03:06:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:06:35,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 03:06:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:06:35,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:06:36,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-15 03:06:36,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {554#true} is VALID [2022-04-15 03:06:36,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-15 03:06:36,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-15 03:06:36,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-15 03:06:36,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#true} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {554#true} is VALID [2022-04-15 03:06:36,519 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#true} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {554#true} is VALID [2022-04-15 03:06:36,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} [113] assume_abort_if_notENTRY-->L9: 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] {554#true} is VALID [2022-04-15 03:06:36,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} [116] L9-->L9-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[] {554#true} is VALID [2022-04-15 03:06:36,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-15 03:06:36,520 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {554#true} is VALID [2022-04-15 03:06:36,521 INFO L272 TraceCheckUtils]: 11: Hoare triple {554#true} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-15 03:06:36,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} [113] assume_abort_if_notENTRY-->L9: 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] {554#true} is VALID [2022-04-15 03:06:36,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} [116] L9-->L9-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[] {554#true} is VALID [2022-04-15 03:06:36,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-15 03:06:36,521 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-15 03:06:38,528 WARN L290 TraceCheckUtils]: 16: Hoare triple {554#true} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is UNKNOWN [2022-04-15 03:06:38,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} [118] L47-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] {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-15 03:06:38,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-15 03:06:39,947 INFO L272 TraceCheckUtils]: 19: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {617#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:06:39,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {617#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:06:39,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#(<= 1 __VERIFIER_assert_~cond)} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {555#false} is VALID [2022-04-15 03:06:39,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#false} is VALID [2022-04-15 03:06:39,950 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-15 03:06:39,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:06:39,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:06:39,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996125077] [2022-04-15 03:06:39,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:06:39,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015162585] [2022-04-15 03:06:39,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015162585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:06:39,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:06:39,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 03:06:39,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016048233] [2022-04-15 03:06:39,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:06:39,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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 23 [2022-04-15 03:06:39,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:06:39,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-15 03:06:42,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 03:06:42,540 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 03:06:42,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:06:42,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 03:06:42,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 03:06:42,541 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-15 03:06:44,352 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 03:06:48,904 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 03:06:50,653 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 03:06:54,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 03:06:56,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 03:07:00,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 03:07:00,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:00,951 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 03:07:00,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 03:07:00,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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 23 [2022-04-15 03:07:00,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:07:00,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-15 03:07:00,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 03:07:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-15 03:07:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 03:07:00,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-15 03:07:02,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:02,893 INFO L225 Difference]: With dead ends: 53 [2022-04-15 03:07:02,893 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 03:07:02,893 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 03:07:02,894 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-04-15 03:07:02,895 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 119 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 12.2s Time] [2022-04-15 03:07:02,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 03:07:02,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-15 03:07:02,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:07:02,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 03:07:02,912 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 03:07:02,915 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 03:07:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:02,918 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 03:07:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 03:07:02,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:02,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:02,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-15 03:07:02,920 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-15 03:07:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:02,924 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 03:07:02,924 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 03:07:02,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:02,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:02,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:07:02,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:07:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 03:07:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-15 03:07:02,928 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-15 03:07:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:07:02,928 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-15 03:07:02,928 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-15 03:07:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-15 03:07:02,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 03:07:02,929 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:07:02,929 INFO L499 BasicCegarLoop]: 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-15 03:07:02,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 03:07:03,155 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:03,156 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:07:03,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:07:03,156 INFO L85 PathProgramCache]: Analyzing trace with hash 740915101, now seen corresponding path program 1 times [2022-04-15 03:07:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:07:03,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564471334] [2022-04-15 03:07:03,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:07:03,187 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:07:03,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573508263] [2022-04-15 03:07:03,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:03,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:03,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:07:03,191 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:07:03,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 03:07:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:03,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 03:07:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:03,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:07:03,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 03:07:03,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {877#true} is VALID [2022-04-15 03:07:03,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 03:07:03,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 03:07:03,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 03:07:03,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {877#true} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {877#true} is VALID [2022-04-15 03:07:03,457 INFO L272 TraceCheckUtils]: 6: Hoare triple {877#true} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {877#true} is VALID [2022-04-15 03:07:03,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} [113] assume_abort_if_notENTRY-->L9: 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] {877#true} is VALID [2022-04-15 03:07:03,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} [116] L9-->L9-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[] {877#true} is VALID [2022-04-15 03:07:03,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 03:07:03,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {877#true} is VALID [2022-04-15 03:07:03,458 INFO L272 TraceCheckUtils]: 11: Hoare triple {877#true} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {877#true} is VALID [2022-04-15 03:07:03,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} [113] assume_abort_if_notENTRY-->L9: 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] {877#true} is VALID [2022-04-15 03:07:03,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} [116] L9-->L9-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[] {877#true} is VALID [2022-04-15 03:07:03,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 03:07:03,460 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {877#true} is VALID [2022-04-15 03:07:03,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#true} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {877#true} is VALID [2022-04-15 03:07:03,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} [118] L47-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] {877#true} is VALID [2022-04-15 03:07:03,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {877#true} is VALID [2022-04-15 03:07:03,463 INFO L272 TraceCheckUtils]: 19: Hoare triple {877#true} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {877#true} is VALID [2022-04-15 03:07:03,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {942#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:07:03,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {942#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [128] L12-->L12-2: Formula: (not (= 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[] {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:07:03,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:07:03,466 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} {877#true} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {953#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-15 03:07:03,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {953#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} [129] L35-1-->L34-3: Formula: (= v_main_~r~0_4 0) InVars {main_~r~0=v_main_~r~0_4} OutVars{main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {957#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-15 03:07:03,468 INFO L272 TraceCheckUtils]: 25: Hoare triple {957#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:07:03,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:07:03,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {878#false} is VALID [2022-04-15 03:07:03,469 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {878#false} is VALID [2022-04-15 03:07:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 03:07:03,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:07:03,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {878#false} is VALID [2022-04-15 03:07:03,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {878#false} is VALID [2022-04-15 03:07:03,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:07:03,940 INFO L272 TraceCheckUtils]: 25: Hoare triple {957#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:07:03,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {984#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} [129] L35-1-->L34-3: Formula: (= v_main_~r~0_4 0) InVars {main_~r~0=v_main_~r~0_4} OutVars{main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {957#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-15 03:07:03,944 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} {877#true} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {984#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-15 03:07:03,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:07:03,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {997#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [128] L12-->L12-2: Formula: (not (= 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[] {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:07:03,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {997#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 03:07:03,950 INFO L272 TraceCheckUtils]: 19: Hoare triple {877#true} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {877#true} is VALID [2022-04-15 03:07:03,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {877#true} is VALID [2022-04-15 03:07:03,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} [118] L47-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] {877#true} is VALID [2022-04-15 03:07:03,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#true} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {877#true} is VALID [2022-04-15 03:07:03,951 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {877#true} is VALID [2022-04-15 03:07:03,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 03:07:03,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} [116] L9-->L9-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[] {877#true} is VALID [2022-04-15 03:07:03,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} [113] assume_abort_if_notENTRY-->L9: 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] {877#true} is VALID [2022-04-15 03:07:03,952 INFO L272 TraceCheckUtils]: 11: Hoare triple {877#true} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {877#true} is VALID [2022-04-15 03:07:03,952 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {877#true} is VALID [2022-04-15 03:07:03,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 03:07:03,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} [116] L9-->L9-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[] {877#true} is VALID [2022-04-15 03:07:03,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} [113] assume_abort_if_notENTRY-->L9: 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] {877#true} is VALID [2022-04-15 03:07:03,953 INFO L272 TraceCheckUtils]: 6: Hoare triple {877#true} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {877#true} is VALID [2022-04-15 03:07:03,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {877#true} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {877#true} is VALID [2022-04-15 03:07:03,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 03:07:03,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 03:07:03,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 03:07:03,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {877#true} is VALID [2022-04-15 03:07:03,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 03:07:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 03:07:03,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:07:03,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564471334] [2022-04-15 03:07:03,955 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:07:03,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573508263] [2022-04-15 03:07:03,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573508263] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 03:07:03,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 03:07:03,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 03:07:03,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758461796] [2022-04-15 03:07:03,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 03:07:03,956 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-15 03:07:03,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:07:03,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 03:07:03,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:03,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 03:07:03,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:07:03,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 03:07:03,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 03:07:03,987 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 03:07:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:04,514 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-15 03:07:04,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 03:07:04,514 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-15 03:07:04,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:07:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 03:07:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 03:07:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 03:07:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 03:07:04,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-15 03:07:04,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:04,573 INFO L225 Difference]: With dead ends: 57 [2022-04-15 03:07:04,573 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 03:07:04,574 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 03:07:04,575 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 03:07:04,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 171 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 03:07:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 03:07:04,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-15 03:07:04,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:07:04,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 03:07:04,588 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 03:07:04,590 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 03:07:04,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:04,597 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 03:07:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 03:07:04,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:04,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:04,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-15 03:07:04,599 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-15 03:07:04,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:04,601 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 03:07:04,601 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 03:07:04,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:04,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:04,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:07:04,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:07:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 03:07:04,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-15 03:07:04,604 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 29 [2022-04-15 03:07:04,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:07:04,605 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2022-04-15 03:07:04,605 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 03:07:04,605 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 03:07:04,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 03:07:04,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:07:04,606 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1] [2022-04-15 03:07:04,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 03:07:04,831 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:04,832 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:07:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:07:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1345250901, now seen corresponding path program 1 times [2022-04-15 03:07:04,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:07:04,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035819810] [2022-04-15 03:07:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:04,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:07:04,846 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:07:04,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575974287] [2022-04-15 03:07:04,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:04,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:04,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:07:04,848 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:07:04,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 03:07:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:04,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 03:07:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:04,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:07:05,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {1324#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1324#true} is VALID [2022-04-15 03:07:05,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {1324#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {1332#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {1332#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1332#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1332#(<= ~counter~0 0)} {1324#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1332#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {1332#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1332#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {1332#(<= ~counter~0 0)} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {1332#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,114 INFO L272 TraceCheckUtils]: 6: Hoare triple {1332#(<= ~counter~0 0)} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1332#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {1332#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: 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] {1332#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {1332#(<= ~counter~0 0)} [116] L9-->L9-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[] {1332#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {1332#(<= ~counter~0 0)} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1332#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,116 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1332#(<= ~counter~0 0)} {1332#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1332#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,117 INFO L272 TraceCheckUtils]: 11: Hoare triple {1332#(<= ~counter~0 0)} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1332#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {1332#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: 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] {1332#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {1332#(<= ~counter~0 0)} [116] L9-->L9-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[] {1332#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {1332#(<= ~counter~0 0)} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1332#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,119 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1332#(<= ~counter~0 0)} {1332#(<= ~counter~0 0)} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1332#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {1332#(<= ~counter~0 0)} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {1332#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {1332#(<= ~counter~0 0)} [118] L47-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] {1381#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:05,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {1381#(<= ~counter~0 1)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1381#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:05,121 INFO L272 TraceCheckUtils]: 19: Hoare triple {1381#(<= ~counter~0 1)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1381#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:05,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {1381#(<= ~counter~0 1)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1381#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:05,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {1381#(<= ~counter~0 1)} [128] L12-->L12-2: Formula: (not (= 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[] {1381#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:05,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {1381#(<= ~counter~0 1)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1381#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:05,123 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1381#(<= ~counter~0 1)} {1381#(<= ~counter~0 1)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1381#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:05,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {1381#(<= ~counter~0 1)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {1381#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:05,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {1381#(<= ~counter~0 1)} [135] L39-3-->L39-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] {1406#(<= |main_#t~post7| 1)} is VALID [2022-04-15 03:07:05,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {1406#(<= |main_#t~post7| 1)} [138] L39-1-->L47-2: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1325#false} is VALID [2022-04-15 03:07:05,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {1325#false} [137] L47-2-->L47: 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] {1325#false} is VALID [2022-04-15 03:07:05,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {1325#false} [144] L47-->L47-3: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {1325#false} is VALID [2022-04-15 03:07:05,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {1325#false} [118] L47-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] {1325#false} is VALID [2022-04-15 03:07:05,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {1325#false} [121] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1325#false} is VALID [2022-04-15 03:07:05,126 INFO L272 TraceCheckUtils]: 31: Hoare triple {1325#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {1325#false} is VALID [2022-04-15 03:07:05,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {1325#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1325#false} is VALID [2022-04-15 03:07:05,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {1325#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1325#false} is VALID [2022-04-15 03:07:05,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {1325#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1325#false} is VALID [2022-04-15 03:07:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 03:07:05,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:07:05,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:07:05,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035819810] [2022-04-15 03:07:05,127 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:07:05,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575974287] [2022-04-15 03:07:05,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575974287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:07:05,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:07:05,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 03:07:05,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967464781] [2022-04-15 03:07:05,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:07:05,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 03:07:05,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:07:05,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 03:07:05,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:05,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 03:07:05,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:07:05,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 03:07:05,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 03:07:05,159 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 03:07:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:05,282 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-15 03:07:05,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 03:07:05,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 03:07:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:07:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 03:07:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-15 03:07:05,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 03:07:05,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-15 03:07:05,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-15 03:07:05,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:05,344 INFO L225 Difference]: With dead ends: 97 [2022-04-15 03:07:05,344 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 03:07:05,345 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-15 03:07:05,346 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:07:05,346 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 120 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:07:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 03:07:05,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-15 03:07:05,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:07:05,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 03:07:05,363 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 03:07:05,363 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 03:07:05,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:05,366 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-15 03:07:05,366 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-15 03:07:05,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:05,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:05,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-15 03:07:05,368 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-15 03:07:05,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:05,370 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-15 03:07:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-15 03:07:05,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:05,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:05,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:07:05,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:07:05,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 03:07:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-15 03:07:05,374 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 35 [2022-04-15 03:07:05,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:07:05,374 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-04-15 03:07:05,375 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 03:07:05,375 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-15 03:07:05,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 03:07:05,376 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:07:05,376 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:07:05,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 03:07:05,595 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:05,596 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:07:05,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:07:05,596 INFO L85 PathProgramCache]: Analyzing trace with hash -516919762, now seen corresponding path program 1 times [2022-04-15 03:07:05,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:07:05,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274403425] [2022-04-15 03:07:05,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:05,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:07:05,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:07:05,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1616839985] [2022-04-15 03:07:05,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:05,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:05,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:07:05,613 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:07:05,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 03:07:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:05,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 03:07:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:05,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:07:05,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {1774#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1774#true} is VALID [2022-04-15 03:07:05,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {1782#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {1782#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1782#(<= ~counter~0 0)} {1774#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {1782#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {1782#(<= ~counter~0 0)} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {1782#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,905 INFO L272 TraceCheckUtils]: 6: Hoare triple {1782#(<= ~counter~0 0)} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1782#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {1782#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: 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] {1782#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {1782#(<= ~counter~0 0)} [116] L9-->L9-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[] {1782#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {1782#(<= ~counter~0 0)} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,907 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1782#(<= ~counter~0 0)} {1782#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1782#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,908 INFO L272 TraceCheckUtils]: 11: Hoare triple {1782#(<= ~counter~0 0)} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1782#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {1782#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: 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] {1782#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {1782#(<= ~counter~0 0)} [116] L9-->L9-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[] {1782#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {1782#(<= ~counter~0 0)} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1782#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,910 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1782#(<= ~counter~0 0)} {1782#(<= ~counter~0 0)} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1782#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {1782#(<= ~counter~0 0)} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {1782#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:05,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {1782#(<= ~counter~0 0)} [118] L47-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] {1831#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:05,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {1831#(<= ~counter~0 1)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1831#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:05,913 INFO L272 TraceCheckUtils]: 19: Hoare triple {1831#(<= ~counter~0 1)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1831#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:05,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {1831#(<= ~counter~0 1)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1831#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:05,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {1831#(<= ~counter~0 1)} [128] L12-->L12-2: Formula: (not (= 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[] {1831#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:05,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {1831#(<= ~counter~0 1)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1831#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:05,917 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1831#(<= ~counter~0 1)} {1831#(<= ~counter~0 1)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1831#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:05,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {1831#(<= ~counter~0 1)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {1831#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:05,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {1831#(<= ~counter~0 1)} [135] L39-3-->L39-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] {1856#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:05,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {1856#(<= ~counter~0 2)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1856#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:05,919 INFO L272 TraceCheckUtils]: 27: Hoare triple {1856#(<= ~counter~0 2)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1856#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:05,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {1856#(<= ~counter~0 2)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1856#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:05,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {1856#(<= ~counter~0 2)} [128] L12-->L12-2: Formula: (not (= 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[] {1856#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:05,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {1856#(<= ~counter~0 2)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:05,921 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1856#(<= ~counter~0 2)} {1856#(<= ~counter~0 2)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1856#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:05,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {1856#(<= ~counter~0 2)} [140] L40-1-->L47-2: Formula: (not (< 0 v_main_~r~0_7)) InVars {main_~r~0=v_main_~r~0_7} OutVars{main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[] {1856#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:05,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {1856#(<= ~counter~0 2)} [137] L47-2-->L47: 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] {1881#(<= |main_#t~post8| 2)} is VALID [2022-04-15 03:07:05,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {1881#(<= |main_#t~post8| 2)} [144] L47-->L47-3: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {1775#false} is VALID [2022-04-15 03:07:05,922 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#false} [118] L47-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] {1775#false} is VALID [2022-04-15 03:07:05,922 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#false} [121] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1775#false} is VALID [2022-04-15 03:07:05,922 INFO L272 TraceCheckUtils]: 37: Hoare triple {1775#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {1775#false} is VALID [2022-04-15 03:07:05,923 INFO L290 TraceCheckUtils]: 38: Hoare triple {1775#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1775#false} is VALID [2022-04-15 03:07:05,923 INFO L290 TraceCheckUtils]: 39: Hoare triple {1775#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1775#false} is VALID [2022-04-15 03:07:05,923 INFO L290 TraceCheckUtils]: 40: Hoare triple {1775#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1775#false} is VALID [2022-04-15 03:07:05,923 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 03:07:05,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:07:06,219 INFO L290 TraceCheckUtils]: 40: Hoare triple {1775#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1775#false} is VALID [2022-04-15 03:07:06,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {1775#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1775#false} is VALID [2022-04-15 03:07:06,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {1775#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1775#false} is VALID [2022-04-15 03:07:06,220 INFO L272 TraceCheckUtils]: 37: Hoare triple {1775#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {1775#false} is VALID [2022-04-15 03:07:06,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#false} [121] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1775#false} is VALID [2022-04-15 03:07:06,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#false} [118] L47-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] {1775#false} is VALID [2022-04-15 03:07:06,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {1921#(< |main_#t~post8| 10)} [144] L47-->L47-3: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {1775#false} is VALID [2022-04-15 03:07:06,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#(< ~counter~0 10)} [137] L47-2-->L47: 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] {1921#(< |main_#t~post8| 10)} is VALID [2022-04-15 03:07:06,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#(< ~counter~0 10)} [140] L40-1-->L47-2: Formula: (not (< 0 v_main_~r~0_7)) InVars {main_~r~0=v_main_~r~0_7} OutVars{main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[] {1925#(< ~counter~0 10)} is VALID [2022-04-15 03:07:06,222 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1774#true} {1925#(< ~counter~0 10)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1925#(< ~counter~0 10)} is VALID [2022-04-15 03:07:06,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {1774#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1774#true} is VALID [2022-04-15 03:07:06,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {1774#true} [128] L12-->L12-2: Formula: (not (= 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[] {1774#true} is VALID [2022-04-15 03:07:06,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {1774#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1774#true} is VALID [2022-04-15 03:07:06,223 INFO L272 TraceCheckUtils]: 27: Hoare triple {1925#(< ~counter~0 10)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1774#true} is VALID [2022-04-15 03:07:06,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {1925#(< ~counter~0 10)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1925#(< ~counter~0 10)} is VALID [2022-04-15 03:07:06,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {1950#(< ~counter~0 9)} [135] L39-3-->L39-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] {1925#(< ~counter~0 10)} is VALID [2022-04-15 03:07:06,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {1950#(< ~counter~0 9)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {1950#(< ~counter~0 9)} is VALID [2022-04-15 03:07:06,225 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1774#true} {1950#(< ~counter~0 9)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1950#(< ~counter~0 9)} is VALID [2022-04-15 03:07:06,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {1774#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1774#true} is VALID [2022-04-15 03:07:06,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {1774#true} [128] L12-->L12-2: Formula: (not (= 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[] {1774#true} is VALID [2022-04-15 03:07:06,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {1774#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1774#true} is VALID [2022-04-15 03:07:06,226 INFO L272 TraceCheckUtils]: 19: Hoare triple {1950#(< ~counter~0 9)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1774#true} is VALID [2022-04-15 03:07:06,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {1950#(< ~counter~0 9)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1950#(< ~counter~0 9)} is VALID [2022-04-15 03:07:06,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {1975#(< ~counter~0 8)} [118] L47-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] {1950#(< ~counter~0 9)} is VALID [2022-04-15 03:07:06,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {1975#(< ~counter~0 8)} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {1975#(< ~counter~0 8)} is VALID [2022-04-15 03:07:06,228 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1774#true} {1975#(< ~counter~0 8)} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1975#(< ~counter~0 8)} is VALID [2022-04-15 03:07:06,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {1774#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1774#true} is VALID [2022-04-15 03:07:06,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {1774#true} [116] L9-->L9-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[] {1774#true} is VALID [2022-04-15 03:07:06,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {1774#true} [113] assume_abort_if_notENTRY-->L9: 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] {1774#true} is VALID [2022-04-15 03:07:06,229 INFO L272 TraceCheckUtils]: 11: Hoare triple {1975#(< ~counter~0 8)} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1774#true} is VALID [2022-04-15 03:07:06,231 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1774#true} {1975#(< ~counter~0 8)} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1975#(< ~counter~0 8)} is VALID [2022-04-15 03:07:06,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {1774#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1774#true} is VALID [2022-04-15 03:07:06,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {1774#true} [116] L9-->L9-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[] {1774#true} is VALID [2022-04-15 03:07:06,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {1774#true} [113] assume_abort_if_notENTRY-->L9: 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] {1774#true} is VALID [2022-04-15 03:07:06,231 INFO L272 TraceCheckUtils]: 6: Hoare triple {1975#(< ~counter~0 8)} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1774#true} is VALID [2022-04-15 03:07:06,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {1975#(< ~counter~0 8)} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {1975#(< ~counter~0 8)} is VALID [2022-04-15 03:07:06,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {1975#(< ~counter~0 8)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1975#(< ~counter~0 8)} is VALID [2022-04-15 03:07:06,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1975#(< ~counter~0 8)} {1774#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1975#(< ~counter~0 8)} is VALID [2022-04-15 03:07:06,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {1975#(< ~counter~0 8)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1975#(< ~counter~0 8)} is VALID [2022-04-15 03:07:06,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {1975#(< ~counter~0 8)} is VALID [2022-04-15 03:07:06,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {1774#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1774#true} is VALID [2022-04-15 03:07:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 03:07:06,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:07:06,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274403425] [2022-04-15 03:07:06,240 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:07:06,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616839985] [2022-04-15 03:07:06,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616839985] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 03:07:06,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 03:07:06,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-15 03:07:06,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210375706] [2022-04-15 03:07:06,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:07:06,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-15 03:07:06,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:07:06,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 03:07:06,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:06,270 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 03:07:06,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:07:06,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 03:07:06,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 03:07:06,271 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 03:07:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:06,470 INFO L93 Difference]: Finished difference Result 106 states and 135 transitions. [2022-04-15 03:07:06,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 03:07:06,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-15 03:07:06,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:07:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 03:07:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-15 03:07:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 03:07:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-15 03:07:06,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-15 03:07:06,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:06,554 INFO L225 Difference]: With dead ends: 106 [2022-04-15 03:07:06,554 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 03:07:06,555 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 03:07:06,556 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:07:06,556 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 109 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:07:06,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 03:07:06,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-15 03:07:06,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:07:06,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 03:07:06,586 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 03:07:06,587 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 03:07:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:06,590 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-15 03:07:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-15 03:07:06,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:06,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:06,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-15 03:07:06,591 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-15 03:07:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:06,595 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-15 03:07:06,595 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-15 03:07:06,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:06,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:06,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:07:06,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:07:06,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 03:07:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-04-15 03:07:06,598 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 41 [2022-04-15 03:07:06,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:07:06,598 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-04-15 03:07:06,598 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 03:07:06,598 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-15 03:07:06,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 03:07:06,600 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:07:06,600 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-15 03:07:06,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 03:07:06,824 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:06,825 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:07:06,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:07:06,825 INFO L85 PathProgramCache]: Analyzing trace with hash -61650990, now seen corresponding path program 1 times [2022-04-15 03:07:06,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:07:06,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972129455] [2022-04-15 03:07:06,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:06,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:07:06,842 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:07:06,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1351923448] [2022-04-15 03:07:06,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:06,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:06,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:07:06,850 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:07:06,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 03:07:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:06,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 03:07:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:06,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:07:07,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {2410#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2410#true} is VALID [2022-04-15 03:07:07,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {2410#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {2418#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:07,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2418#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:07,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#(<= ~counter~0 0)} {2410#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2418#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:07,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2418#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:07,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#(<= ~counter~0 0)} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {2418#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:07,158 INFO L272 TraceCheckUtils]: 6: Hoare triple {2418#(<= ~counter~0 0)} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {2418#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:07,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {2418#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: 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] {2418#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:07,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {2418#(<= ~counter~0 0)} [116] L9-->L9-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[] {2418#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:07,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#(<= ~counter~0 0)} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2418#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:07,160 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2418#(<= ~counter~0 0)} {2418#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {2418#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:07,161 INFO L272 TraceCheckUtils]: 11: Hoare triple {2418#(<= ~counter~0 0)} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2418#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:07,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {2418#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: 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] {2418#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:07,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {2418#(<= ~counter~0 0)} [116] L9-->L9-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[] {2418#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:07,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#(<= ~counter~0 0)} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2418#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:07,166 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2418#(<= ~counter~0 0)} {2418#(<= ~counter~0 0)} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2418#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:07,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#(<= ~counter~0 0)} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {2418#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:07,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {2418#(<= ~counter~0 0)} [118] L47-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] {2467#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:07,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {2467#(<= ~counter~0 1)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2467#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:07,168 INFO L272 TraceCheckUtils]: 19: Hoare triple {2467#(<= ~counter~0 1)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2467#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:07,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {2467#(<= ~counter~0 1)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2467#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:07,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {2467#(<= ~counter~0 1)} [128] L12-->L12-2: Formula: (not (= 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[] {2467#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:07,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {2467#(<= ~counter~0 1)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2467#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:07,170 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2467#(<= ~counter~0 1)} {2467#(<= ~counter~0 1)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2467#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:07,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {2467#(<= ~counter~0 1)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {2467#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:07,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {2467#(<= ~counter~0 1)} [135] L39-3-->L39-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] {2492#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:07,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {2492#(<= ~counter~0 2)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2492#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:07,172 INFO L272 TraceCheckUtils]: 27: Hoare triple {2492#(<= ~counter~0 2)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2492#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:07,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {2492#(<= ~counter~0 2)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2492#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:07,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {2492#(<= ~counter~0 2)} [128] L12-->L12-2: Formula: (not (= 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[] {2492#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:07,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {2492#(<= ~counter~0 2)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2492#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:07,174 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2492#(<= ~counter~0 2)} {2492#(<= ~counter~0 2)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2492#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:07,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {2492#(<= ~counter~0 2)} [141] L40-1-->L39-3: Formula: (and (< 0 v_main_~r~0_9) (= v_main_~r~0_8 (+ (* (- 1) v_main_~v~0_7) v_main_~r~0_9)) (= v_main_~v~0_6 (+ v_main_~v~0_7 2))) InVars {main_~v~0=v_main_~v~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~v~0=v_main_~v~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2492#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:07,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {2492#(<= ~counter~0 2)} [135] L39-3-->L39-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] {2517#(<= |main_#t~post7| 2)} is VALID [2022-04-15 03:07:07,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {2517#(<= |main_#t~post7| 2)} [138] L39-1-->L47-2: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2411#false} is VALID [2022-04-15 03:07:07,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {2411#false} [137] L47-2-->L47: 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] {2411#false} is VALID [2022-04-15 03:07:07,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {2411#false} [144] L47-->L47-3: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {2411#false} is VALID [2022-04-15 03:07:07,175 INFO L290 TraceCheckUtils]: 37: Hoare triple {2411#false} [118] L47-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] {2411#false} is VALID [2022-04-15 03:07:07,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {2411#false} [121] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2411#false} is VALID [2022-04-15 03:07:07,176 INFO L272 TraceCheckUtils]: 39: Hoare triple {2411#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {2411#false} is VALID [2022-04-15 03:07:07,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {2411#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2411#false} is VALID [2022-04-15 03:07:07,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {2411#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2411#false} is VALID [2022-04-15 03:07:07,176 INFO L290 TraceCheckUtils]: 42: Hoare triple {2411#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2411#false} is VALID [2022-04-15 03:07:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 03:07:07,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:07:07,423 INFO L290 TraceCheckUtils]: 42: Hoare triple {2411#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2411#false} is VALID [2022-04-15 03:07:07,423 INFO L290 TraceCheckUtils]: 41: Hoare triple {2411#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2411#false} is VALID [2022-04-15 03:07:07,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {2411#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2411#false} is VALID [2022-04-15 03:07:07,423 INFO L272 TraceCheckUtils]: 39: Hoare triple {2411#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {2411#false} is VALID [2022-04-15 03:07:07,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {2411#false} [121] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2411#false} is VALID [2022-04-15 03:07:07,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {2411#false} [118] L47-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] {2411#false} is VALID [2022-04-15 03:07:07,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {2411#false} [144] L47-->L47-3: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {2411#false} is VALID [2022-04-15 03:07:07,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {2411#false} [137] L47-2-->L47: 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] {2411#false} is VALID [2022-04-15 03:07:07,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {2569#(< |main_#t~post7| 10)} [138] L39-1-->L47-2: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2411#false} is VALID [2022-04-15 03:07:07,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {2573#(< ~counter~0 10)} [135] L39-3-->L39-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] {2569#(< |main_#t~post7| 10)} is VALID [2022-04-15 03:07:07,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {2573#(< ~counter~0 10)} [141] L40-1-->L39-3: Formula: (and (< 0 v_main_~r~0_9) (= v_main_~r~0_8 (+ (* (- 1) v_main_~v~0_7) v_main_~r~0_9)) (= v_main_~v~0_6 (+ v_main_~v~0_7 2))) InVars {main_~v~0=v_main_~v~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~v~0=v_main_~v~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {2573#(< ~counter~0 10)} is VALID [2022-04-15 03:07:07,431 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2410#true} {2573#(< ~counter~0 10)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2573#(< ~counter~0 10)} is VALID [2022-04-15 03:07:07,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {2410#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2410#true} is VALID [2022-04-15 03:07:07,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {2410#true} [128] L12-->L12-2: Formula: (not (= 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[] {2410#true} is VALID [2022-04-15 03:07:07,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {2410#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2410#true} is VALID [2022-04-15 03:07:07,431 INFO L272 TraceCheckUtils]: 27: Hoare triple {2573#(< ~counter~0 10)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2410#true} is VALID [2022-04-15 03:07:07,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {2573#(< ~counter~0 10)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2573#(< ~counter~0 10)} is VALID [2022-04-15 03:07:07,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {2598#(< ~counter~0 9)} [135] L39-3-->L39-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] {2573#(< ~counter~0 10)} is VALID [2022-04-15 03:07:07,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {2598#(< ~counter~0 9)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {2598#(< ~counter~0 9)} is VALID [2022-04-15 03:07:07,433 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2410#true} {2598#(< ~counter~0 9)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2598#(< ~counter~0 9)} is VALID [2022-04-15 03:07:07,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {2410#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2410#true} is VALID [2022-04-15 03:07:07,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {2410#true} [128] L12-->L12-2: Formula: (not (= 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[] {2410#true} is VALID [2022-04-15 03:07:07,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {2410#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2410#true} is VALID [2022-04-15 03:07:07,433 INFO L272 TraceCheckUtils]: 19: Hoare triple {2598#(< ~counter~0 9)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {2410#true} is VALID [2022-04-15 03:07:07,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {2598#(< ~counter~0 9)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2598#(< ~counter~0 9)} is VALID [2022-04-15 03:07:07,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {2623#(< ~counter~0 8)} [118] L47-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] {2598#(< ~counter~0 9)} is VALID [2022-04-15 03:07:07,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {2623#(< ~counter~0 8)} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {2623#(< ~counter~0 8)} is VALID [2022-04-15 03:07:07,435 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2410#true} {2623#(< ~counter~0 8)} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2623#(< ~counter~0 8)} is VALID [2022-04-15 03:07:07,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {2410#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2410#true} is VALID [2022-04-15 03:07:07,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {2410#true} [116] L9-->L9-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[] {2410#true} is VALID [2022-04-15 03:07:07,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {2410#true} [113] assume_abort_if_notENTRY-->L9: 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] {2410#true} is VALID [2022-04-15 03:07:07,436 INFO L272 TraceCheckUtils]: 11: Hoare triple {2623#(< ~counter~0 8)} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2410#true} is VALID [2022-04-15 03:07:07,437 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2410#true} {2623#(< ~counter~0 8)} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {2623#(< ~counter~0 8)} is VALID [2022-04-15 03:07:07,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {2410#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2410#true} is VALID [2022-04-15 03:07:07,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {2410#true} [116] L9-->L9-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[] {2410#true} is VALID [2022-04-15 03:07:07,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {2410#true} [113] assume_abort_if_notENTRY-->L9: 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] {2410#true} is VALID [2022-04-15 03:07:07,437 INFO L272 TraceCheckUtils]: 6: Hoare triple {2623#(< ~counter~0 8)} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {2410#true} is VALID [2022-04-15 03:07:07,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {2623#(< ~counter~0 8)} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {2623#(< ~counter~0 8)} is VALID [2022-04-15 03:07:07,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {2623#(< ~counter~0 8)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2623#(< ~counter~0 8)} is VALID [2022-04-15 03:07:07,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2623#(< ~counter~0 8)} {2410#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2623#(< ~counter~0 8)} is VALID [2022-04-15 03:07:07,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {2623#(< ~counter~0 8)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2623#(< ~counter~0 8)} is VALID [2022-04-15 03:07:07,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {2410#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {2623#(< ~counter~0 8)} is VALID [2022-04-15 03:07:07,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {2410#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2410#true} is VALID [2022-04-15 03:07:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 03:07:07,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:07:07,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972129455] [2022-04-15 03:07:07,440 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:07:07,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351923448] [2022-04-15 03:07:07,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351923448] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 03:07:07,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 03:07:07,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 03:07:07,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821214522] [2022-04-15 03:07:07,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 03:07:07,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 43 [2022-04-15 03:07:07,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:07:07,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-15 03:07:07,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:07,504 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 03:07:07,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:07:07,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 03:07:07,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 03:07:07,505 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-15 03:07:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:07,920 INFO L93 Difference]: Finished difference Result 174 states and 220 transitions. [2022-04-15 03:07:07,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 03:07:07,921 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 43 [2022-04-15 03:07:07,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:07:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-15 03:07:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2022-04-15 03:07:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-15 03:07:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2022-04-15 03:07:07,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 156 transitions. [2022-04-15 03:07:08,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:08,155 INFO L225 Difference]: With dead ends: 174 [2022-04-15 03:07:08,155 INFO L226 Difference]: Without dead ends: 137 [2022-04-15 03:07:08,161 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-15 03:07:08,162 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 81 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 03:07:08,162 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 179 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 03:07:08,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-15 03:07:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 123. [2022-04-15 03:07:08,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:07:08,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 123 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 90 states have internal predecessors, (110), 22 states have call successors, (22), 13 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 03:07:08,228 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 123 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 90 states have internal predecessors, (110), 22 states have call successors, (22), 13 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 03:07:08,229 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 123 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 90 states have internal predecessors, (110), 22 states have call successors, (22), 13 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 03:07:08,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:08,236 INFO L93 Difference]: Finished difference Result 137 states and 165 transitions. [2022-04-15 03:07:08,236 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 165 transitions. [2022-04-15 03:07:08,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:08,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:08,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 90 states have internal predecessors, (110), 22 states have call successors, (22), 13 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 137 states. [2022-04-15 03:07:08,238 INFO L87 Difference]: Start difference. First operand has 123 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 90 states have internal predecessors, (110), 22 states have call successors, (22), 13 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 137 states. [2022-04-15 03:07:08,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:08,242 INFO L93 Difference]: Finished difference Result 137 states and 165 transitions. [2022-04-15 03:07:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 165 transitions. [2022-04-15 03:07:08,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:08,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:08,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:07:08,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:07:08,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 90 states have internal predecessors, (110), 22 states have call successors, (22), 13 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 03:07:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 152 transitions. [2022-04-15 03:07:08,249 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 152 transitions. Word has length 43 [2022-04-15 03:07:08,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:07:08,249 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 152 transitions. [2022-04-15 03:07:08,250 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-15 03:07:08,250 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 152 transitions. [2022-04-15 03:07:08,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 03:07:08,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:07:08,252 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2022-04-15 03:07:08,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 03:07:08,466 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:08,467 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:07:08,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:07:08,467 INFO L85 PathProgramCache]: Analyzing trace with hash 468355249, now seen corresponding path program 1 times [2022-04-15 03:07:08,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:07:08,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485045281] [2022-04-15 03:07:08,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:08,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:07:08,481 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:07:08,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [898280417] [2022-04-15 03:07:08,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:08,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:08,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:07:08,483 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:07:08,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 03:07:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:08,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 03:07:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:08,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:07:08,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {3371#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3371#true} is VALID [2022-04-15 03:07:08,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {3371#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {3371#true} is VALID [2022-04-15 03:07:08,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3371#true} is VALID [2022-04-15 03:07:08,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3371#true} {3371#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3371#true} is VALID [2022-04-15 03:07:08,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {3371#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3371#true} is VALID [2022-04-15 03:07:08,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {3371#true} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {3371#true} is VALID [2022-04-15 03:07:08,802 INFO L272 TraceCheckUtils]: 6: Hoare triple {3371#true} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {3371#true} is VALID [2022-04-15 03:07:08,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {3371#true} [113] assume_abort_if_notENTRY-->L9: 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] {3371#true} is VALID [2022-04-15 03:07:08,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {3371#true} [116] L9-->L9-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[] {3371#true} is VALID [2022-04-15 03:07:08,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {3371#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3371#true} is VALID [2022-04-15 03:07:08,803 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3371#true} {3371#true} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {3371#true} is VALID [2022-04-15 03:07:08,803 INFO L272 TraceCheckUtils]: 11: Hoare triple {3371#true} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {3371#true} is VALID [2022-04-15 03:07:08,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {3371#true} [113] assume_abort_if_notENTRY-->L9: 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] {3371#true} is VALID [2022-04-15 03:07:08,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {3371#true} [116] L9-->L9-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[] {3371#true} is VALID [2022-04-15 03:07:08,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {3371#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3371#true} is VALID [2022-04-15 03:07:08,804 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3371#true} {3371#true} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {3371#true} is VALID [2022-04-15 03:07:08,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {3371#true} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {3371#true} is VALID [2022-04-15 03:07:08,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {3371#true} [118] L47-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] {3371#true} is VALID [2022-04-15 03:07:08,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {3371#true} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3371#true} is VALID [2022-04-15 03:07:08,804 INFO L272 TraceCheckUtils]: 19: Hoare triple {3371#true} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {3371#true} is VALID [2022-04-15 03:07:08,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {3371#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3371#true} is VALID [2022-04-15 03:07:08,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {3371#true} [128] L12-->L12-2: Formula: (not (= 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[] {3371#true} is VALID [2022-04-15 03:07:08,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {3371#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3371#true} is VALID [2022-04-15 03:07:08,805 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3371#true} {3371#true} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {3371#true} is VALID [2022-04-15 03:07:08,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {3371#true} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {3448#(not (= main_~r~0 0))} is VALID [2022-04-15 03:07:08,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {3448#(not (= main_~r~0 0))} [135] L39-3-->L39-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] {3448#(not (= main_~r~0 0))} is VALID [2022-04-15 03:07:08,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {3448#(not (= main_~r~0 0))} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3448#(not (= main_~r~0 0))} is VALID [2022-04-15 03:07:08,806 INFO L272 TraceCheckUtils]: 27: Hoare triple {3448#(not (= main_~r~0 0))} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {3371#true} is VALID [2022-04-15 03:07:08,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {3371#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3371#true} is VALID [2022-04-15 03:07:08,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {3371#true} [128] L12-->L12-2: Formula: (not (= 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[] {3371#true} is VALID [2022-04-15 03:07:08,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {3371#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3371#true} is VALID [2022-04-15 03:07:08,807 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3371#true} {3448#(not (= main_~r~0 0))} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {3448#(not (= main_~r~0 0))} is VALID [2022-04-15 03:07:08,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {3448#(not (= main_~r~0 0))} [140] L40-1-->L47-2: Formula: (not (< 0 v_main_~r~0_7)) InVars {main_~r~0=v_main_~r~0_7} OutVars{main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[] {3473#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 03:07:08,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {3473#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} [137] L47-2-->L47: 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] {3473#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 03:07:08,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {3473#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {3473#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 03:07:08,808 INFO L272 TraceCheckUtils]: 35: Hoare triple {3473#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {3371#true} is VALID [2022-04-15 03:07:08,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {3371#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3371#true} is VALID [2022-04-15 03:07:08,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {3371#true} [128] L12-->L12-2: Formula: (not (= 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[] {3371#true} is VALID [2022-04-15 03:07:08,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {3371#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3371#true} is VALID [2022-04-15 03:07:08,810 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3371#true} {3473#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {3473#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 03:07:08,810 INFO L290 TraceCheckUtils]: 40: Hoare triple {3473#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} [142] L48-1-->L47-3: Formula: (not (< v_main_~r~0_11 0)) InVars {main_~r~0=v_main_~r~0_11} OutVars{main_~r~0=v_main_~r~0_11} AuxVars[] AssignedVars[] {3372#false} is VALID [2022-04-15 03:07:08,810 INFO L290 TraceCheckUtils]: 41: Hoare triple {3372#false} [118] L47-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] {3372#false} is VALID [2022-04-15 03:07:08,810 INFO L290 TraceCheckUtils]: 42: Hoare triple {3372#false} [121] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3372#false} is VALID [2022-04-15 03:07:08,811 INFO L272 TraceCheckUtils]: 43: Hoare triple {3372#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {3372#false} is VALID [2022-04-15 03:07:08,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {3372#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3372#false} is VALID [2022-04-15 03:07:08,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {3372#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3372#false} is VALID [2022-04-15 03:07:08,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {3372#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3372#false} is VALID [2022-04-15 03:07:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 03:07:08,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:07:08,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:07:08,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485045281] [2022-04-15 03:07:08,820 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:07:08,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898280417] [2022-04-15 03:07:08,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898280417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:07:08,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:07:08,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 03:07:08,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800071767] [2022-04-15 03:07:08,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:07:08,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-15 03:07:08,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:07:08,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 03:07:08,855 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-15 03:07:08,855 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 03:07:08,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:07:08,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 03:07:08,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 03:07:08,856 INFO L87 Difference]: Start difference. First operand 123 states and 152 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 03:07:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:09,044 INFO L93 Difference]: Finished difference Result 178 states and 228 transitions. [2022-04-15 03:07:09,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 03:07:09,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-15 03:07:09,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:07:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 03:07:09,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 03:07:09,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 03:07:09,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 03:07:09,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-15 03:07:09,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:09,147 INFO L225 Difference]: With dead ends: 178 [2022-04-15 03:07:09,147 INFO L226 Difference]: Without dead ends: 123 [2022-04-15 03:07:09,147 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 03:07:09,148 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 19 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:07:09,148 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 123 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:07:09,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-15 03:07:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2022-04-15 03:07:09,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:07:09,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 113 states, 82 states have (on average 1.2195121951219512) internal successors, (100), 83 states have internal predecessors, (100), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 03:07:09,208 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 113 states, 82 states have (on average 1.2195121951219512) internal successors, (100), 83 states have internal predecessors, (100), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 03:07:09,210 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 113 states, 82 states have (on average 1.2195121951219512) internal successors, (100), 83 states have internal predecessors, (100), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 03:07:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:09,216 INFO L93 Difference]: Finished difference Result 123 states and 155 transitions. [2022-04-15 03:07:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 155 transitions. [2022-04-15 03:07:09,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:09,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:09,218 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 82 states have (on average 1.2195121951219512) internal successors, (100), 83 states have internal predecessors, (100), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 123 states. [2022-04-15 03:07:09,219 INFO L87 Difference]: Start difference. First operand has 113 states, 82 states have (on average 1.2195121951219512) internal successors, (100), 83 states have internal predecessors, (100), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 123 states. [2022-04-15 03:07:09,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:09,223 INFO L93 Difference]: Finished difference Result 123 states and 155 transitions. [2022-04-15 03:07:09,223 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 155 transitions. [2022-04-15 03:07:09,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:09,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:09,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:07:09,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:07:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 82 states have (on average 1.2195121951219512) internal successors, (100), 83 states have internal predecessors, (100), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 03:07:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 140 transitions. [2022-04-15 03:07:09,230 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 140 transitions. Word has length 47 [2022-04-15 03:07:09,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:07:09,231 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 140 transitions. [2022-04-15 03:07:09,232 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 03:07:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 140 transitions. [2022-04-15 03:07:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 03:07:09,232 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:07:09,232 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:07:09,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 03:07:09,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-15 03:07:09,456 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:07:09,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:07:09,456 INFO L85 PathProgramCache]: Analyzing trace with hash -763492839, now seen corresponding path program 1 times [2022-04-15 03:07:09,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:07:09,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384812517] [2022-04-15 03:07:09,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:09,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:07:09,478 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:07:09,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [718224413] [2022-04-15 03:07:09,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:09,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:09,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:07:09,481 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:07:09,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 03:07:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:09,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 03:07:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:09,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:07:09,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {4168#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4168#true} is VALID [2022-04-15 03:07:09,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {4168#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {4176#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:09,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {4176#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4176#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:09,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4176#(<= ~counter~0 0)} {4168#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4176#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:09,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {4176#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4176#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:09,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {4176#(<= ~counter~0 0)} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {4176#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:09,839 INFO L272 TraceCheckUtils]: 6: Hoare triple {4176#(<= ~counter~0 0)} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {4176#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:09,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {4176#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: 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] {4176#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:09,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {4176#(<= ~counter~0 0)} [116] L9-->L9-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[] {4176#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:09,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {4176#(<= ~counter~0 0)} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4176#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:09,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4176#(<= ~counter~0 0)} {4176#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {4176#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:09,841 INFO L272 TraceCheckUtils]: 11: Hoare triple {4176#(<= ~counter~0 0)} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {4176#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:09,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {4176#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: 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] {4176#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:09,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {4176#(<= ~counter~0 0)} [116] L9-->L9-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[] {4176#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:09,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {4176#(<= ~counter~0 0)} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4176#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:09,843 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4176#(<= ~counter~0 0)} {4176#(<= ~counter~0 0)} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {4176#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:09,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {4176#(<= ~counter~0 0)} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {4176#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:09,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {4176#(<= ~counter~0 0)} [118] L47-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] {4225#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:09,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {4225#(<= ~counter~0 1)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4225#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:09,845 INFO L272 TraceCheckUtils]: 19: Hoare triple {4225#(<= ~counter~0 1)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {4225#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:09,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {4225#(<= ~counter~0 1)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4225#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:09,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {4225#(<= ~counter~0 1)} [128] L12-->L12-2: Formula: (not (= 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[] {4225#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:09,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {4225#(<= ~counter~0 1)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4225#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:09,847 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4225#(<= ~counter~0 1)} {4225#(<= ~counter~0 1)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {4225#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:09,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {4225#(<= ~counter~0 1)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {4225#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:09,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {4225#(<= ~counter~0 1)} [135] L39-3-->L39-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] {4250#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:09,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {4250#(<= ~counter~0 2)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4250#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:09,849 INFO L272 TraceCheckUtils]: 27: Hoare triple {4250#(<= ~counter~0 2)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {4250#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:09,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {4250#(<= ~counter~0 2)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4250#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:09,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {4250#(<= ~counter~0 2)} [128] L12-->L12-2: Formula: (not (= 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[] {4250#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:09,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {4250#(<= ~counter~0 2)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4250#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:09,850 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4250#(<= ~counter~0 2)} {4250#(<= ~counter~0 2)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {4250#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:09,851 INFO L290 TraceCheckUtils]: 32: Hoare triple {4250#(<= ~counter~0 2)} [140] L40-1-->L47-2: Formula: (not (< 0 v_main_~r~0_7)) InVars {main_~r~0=v_main_~r~0_7} OutVars{main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[] {4250#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:09,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {4250#(<= ~counter~0 2)} [137] L47-2-->L47: 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] {4275#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:09,852 INFO L290 TraceCheckUtils]: 34: Hoare triple {4275#(<= ~counter~0 3)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {4275#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:09,852 INFO L272 TraceCheckUtils]: 35: Hoare triple {4275#(<= ~counter~0 3)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {4275#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:09,853 INFO L290 TraceCheckUtils]: 36: Hoare triple {4275#(<= ~counter~0 3)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4275#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:09,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {4275#(<= ~counter~0 3)} [128] L12-->L12-2: Formula: (not (= 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[] {4275#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:09,853 INFO L290 TraceCheckUtils]: 38: Hoare triple {4275#(<= ~counter~0 3)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4275#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:09,854 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4275#(<= ~counter~0 3)} {4275#(<= ~counter~0 3)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {4275#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:09,854 INFO L290 TraceCheckUtils]: 40: Hoare triple {4275#(<= ~counter~0 3)} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {4275#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:09,855 INFO L290 TraceCheckUtils]: 41: Hoare triple {4275#(<= ~counter~0 3)} [137] L47-2-->L47: 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] {4300#(<= |main_#t~post8| 3)} is VALID [2022-04-15 03:07:09,855 INFO L290 TraceCheckUtils]: 42: Hoare triple {4300#(<= |main_#t~post8| 3)} [144] L47-->L47-3: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {4169#false} is VALID [2022-04-15 03:07:09,855 INFO L290 TraceCheckUtils]: 43: Hoare triple {4169#false} [118] L47-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] {4169#false} is VALID [2022-04-15 03:07:09,855 INFO L290 TraceCheckUtils]: 44: Hoare triple {4169#false} [121] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4169#false} is VALID [2022-04-15 03:07:09,856 INFO L272 TraceCheckUtils]: 45: Hoare triple {4169#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {4169#false} is VALID [2022-04-15 03:07:09,856 INFO L290 TraceCheckUtils]: 46: Hoare triple {4169#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4169#false} is VALID [2022-04-15 03:07:09,856 INFO L290 TraceCheckUtils]: 47: Hoare triple {4169#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4169#false} is VALID [2022-04-15 03:07:09,856 INFO L290 TraceCheckUtils]: 48: Hoare triple {4169#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4169#false} is VALID [2022-04-15 03:07:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 03:07:09,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:07:10,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {4169#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4169#false} is VALID [2022-04-15 03:07:10,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {4169#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4169#false} is VALID [2022-04-15 03:07:10,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {4169#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4169#false} is VALID [2022-04-15 03:07:10,213 INFO L272 TraceCheckUtils]: 45: Hoare triple {4169#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {4169#false} is VALID [2022-04-15 03:07:10,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {4169#false} [121] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4169#false} is VALID [2022-04-15 03:07:10,214 INFO L290 TraceCheckUtils]: 43: Hoare triple {4169#false} [118] L47-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] {4169#false} is VALID [2022-04-15 03:07:10,214 INFO L290 TraceCheckUtils]: 42: Hoare triple {4340#(< |main_#t~post8| 10)} [144] L47-->L47-3: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {4169#false} is VALID [2022-04-15 03:07:10,214 INFO L290 TraceCheckUtils]: 41: Hoare triple {4344#(< ~counter~0 10)} [137] L47-2-->L47: 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] {4340#(< |main_#t~post8| 10)} is VALID [2022-04-15 03:07:10,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {4344#(< ~counter~0 10)} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {4344#(< ~counter~0 10)} is VALID [2022-04-15 03:07:10,216 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4168#true} {4344#(< ~counter~0 10)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {4344#(< ~counter~0 10)} is VALID [2022-04-15 03:07:10,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {4168#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4168#true} is VALID [2022-04-15 03:07:10,216 INFO L290 TraceCheckUtils]: 37: Hoare triple {4168#true} [128] L12-->L12-2: Formula: (not (= 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[] {4168#true} is VALID [2022-04-15 03:07:10,216 INFO L290 TraceCheckUtils]: 36: Hoare triple {4168#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4168#true} is VALID [2022-04-15 03:07:10,216 INFO L272 TraceCheckUtils]: 35: Hoare triple {4344#(< ~counter~0 10)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {4168#true} is VALID [2022-04-15 03:07:10,217 INFO L290 TraceCheckUtils]: 34: Hoare triple {4344#(< ~counter~0 10)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {4344#(< ~counter~0 10)} is VALID [2022-04-15 03:07:10,217 INFO L290 TraceCheckUtils]: 33: Hoare triple {4369#(< ~counter~0 9)} [137] L47-2-->L47: 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] {4344#(< ~counter~0 10)} is VALID [2022-04-15 03:07:10,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {4369#(< ~counter~0 9)} [140] L40-1-->L47-2: Formula: (not (< 0 v_main_~r~0_7)) InVars {main_~r~0=v_main_~r~0_7} OutVars{main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[] {4369#(< ~counter~0 9)} is VALID [2022-04-15 03:07:10,218 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4168#true} {4369#(< ~counter~0 9)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {4369#(< ~counter~0 9)} is VALID [2022-04-15 03:07:10,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {4168#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4168#true} is VALID [2022-04-15 03:07:10,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {4168#true} [128] L12-->L12-2: Formula: (not (= 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[] {4168#true} is VALID [2022-04-15 03:07:10,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {4168#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4168#true} is VALID [2022-04-15 03:07:10,219 INFO L272 TraceCheckUtils]: 27: Hoare triple {4369#(< ~counter~0 9)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {4168#true} is VALID [2022-04-15 03:07:10,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {4369#(< ~counter~0 9)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4369#(< ~counter~0 9)} is VALID [2022-04-15 03:07:10,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {4394#(< ~counter~0 8)} [135] L39-3-->L39-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] {4369#(< ~counter~0 9)} is VALID [2022-04-15 03:07:10,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {4394#(< ~counter~0 8)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {4394#(< ~counter~0 8)} is VALID [2022-04-15 03:07:10,221 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4168#true} {4394#(< ~counter~0 8)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {4394#(< ~counter~0 8)} is VALID [2022-04-15 03:07:10,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {4168#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4168#true} is VALID [2022-04-15 03:07:10,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {4168#true} [128] L12-->L12-2: Formula: (not (= 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[] {4168#true} is VALID [2022-04-15 03:07:10,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {4168#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4168#true} is VALID [2022-04-15 03:07:10,221 INFO L272 TraceCheckUtils]: 19: Hoare triple {4394#(< ~counter~0 8)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {4168#true} is VALID [2022-04-15 03:07:10,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {4394#(< ~counter~0 8)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4394#(< ~counter~0 8)} is VALID [2022-04-15 03:07:10,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {4419#(< ~counter~0 7)} [118] L47-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] {4394#(< ~counter~0 8)} is VALID [2022-04-15 03:07:10,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {4419#(< ~counter~0 7)} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {4419#(< ~counter~0 7)} is VALID [2022-04-15 03:07:10,223 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4168#true} {4419#(< ~counter~0 7)} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {4419#(< ~counter~0 7)} is VALID [2022-04-15 03:07:10,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {4168#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4168#true} is VALID [2022-04-15 03:07:10,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {4168#true} [116] L9-->L9-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[] {4168#true} is VALID [2022-04-15 03:07:10,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {4168#true} [113] assume_abort_if_notENTRY-->L9: 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] {4168#true} is VALID [2022-04-15 03:07:10,224 INFO L272 TraceCheckUtils]: 11: Hoare triple {4419#(< ~counter~0 7)} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {4168#true} is VALID [2022-04-15 03:07:10,225 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4168#true} {4419#(< ~counter~0 7)} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {4419#(< ~counter~0 7)} is VALID [2022-04-15 03:07:10,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {4168#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4168#true} is VALID [2022-04-15 03:07:10,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {4168#true} [116] L9-->L9-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[] {4168#true} is VALID [2022-04-15 03:07:10,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {4168#true} [113] assume_abort_if_notENTRY-->L9: 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] {4168#true} is VALID [2022-04-15 03:07:10,225 INFO L272 TraceCheckUtils]: 6: Hoare triple {4419#(< ~counter~0 7)} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {4168#true} is VALID [2022-04-15 03:07:10,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {4419#(< ~counter~0 7)} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {4419#(< ~counter~0 7)} is VALID [2022-04-15 03:07:10,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {4419#(< ~counter~0 7)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4419#(< ~counter~0 7)} is VALID [2022-04-15 03:07:10,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4419#(< ~counter~0 7)} {4168#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4419#(< ~counter~0 7)} is VALID [2022-04-15 03:07:10,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {4419#(< ~counter~0 7)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4419#(< ~counter~0 7)} is VALID [2022-04-15 03:07:10,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {4168#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {4419#(< ~counter~0 7)} is VALID [2022-04-15 03:07:10,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {4168#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4168#true} is VALID [2022-04-15 03:07:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 03:07:10,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:07:10,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384812517] [2022-04-15 03:07:10,228 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:07:10,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718224413] [2022-04-15 03:07:10,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718224413] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 03:07:10,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 03:07:10,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 03:07:10,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677567269] [2022-04-15 03:07:10,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 03:07:10,230 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 49 [2022-04-15 03:07:10,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:07:10,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-15 03:07:10,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:10,333 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 03:07:10,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:07:10,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 03:07:10,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 03:07:10,334 INFO L87 Difference]: Start difference. First operand 113 states and 140 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-15 03:07:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:11,048 INFO L93 Difference]: Finished difference Result 223 states and 286 transitions. [2022-04-15 03:07:11,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 03:07:11,048 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 49 [2022-04-15 03:07:11,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:07:11,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-15 03:07:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-04-15 03:07:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-15 03:07:11,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-04-15 03:07:11,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 194 transitions. [2022-04-15 03:07:11,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:11,262 INFO L225 Difference]: With dead ends: 223 [2022-04-15 03:07:11,263 INFO L226 Difference]: Without dead ends: 176 [2022-04-15 03:07:11,263 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-04-15 03:07:11,264 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 118 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 03:07:11,264 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 264 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 03:07:11,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-04-15 03:07:11,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 157. [2022-04-15 03:07:11,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:07:11,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 157 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 116 states have internal predecessors, (142), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 03:07:11,345 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 157 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 116 states have internal predecessors, (142), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 03:07:11,346 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 157 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 116 states have internal predecessors, (142), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 03:07:11,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:11,351 INFO L93 Difference]: Finished difference Result 176 states and 216 transitions. [2022-04-15 03:07:11,351 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 216 transitions. [2022-04-15 03:07:11,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:11,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:11,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 116 states have internal predecessors, (142), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 176 states. [2022-04-15 03:07:11,352 INFO L87 Difference]: Start difference. First operand has 157 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 116 states have internal predecessors, (142), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 176 states. [2022-04-15 03:07:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:11,357 INFO L93 Difference]: Finished difference Result 176 states and 216 transitions. [2022-04-15 03:07:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 216 transitions. [2022-04-15 03:07:11,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:11,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:11,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:07:11,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:07:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 116 states have internal predecessors, (142), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 03:07:11,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 200 transitions. [2022-04-15 03:07:11,362 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 200 transitions. Word has length 49 [2022-04-15 03:07:11,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:07:11,362 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 200 transitions. [2022-04-15 03:07:11,362 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-15 03:07:11,362 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 200 transitions. [2022-04-15 03:07:11,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 03:07:11,363 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:07:11,363 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1] [2022-04-15 03:07:11,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 03:07:11,585 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:11,586 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:07:11,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:07:11,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2076394588, now seen corresponding path program 1 times [2022-04-15 03:07:11,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:07:11,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968636964] [2022-04-15 03:07:11,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:11,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:07:11,601 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:07:11,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [608129611] [2022-04-15 03:07:11,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:11,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:11,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:07:11,603 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:07:11,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 03:07:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:11,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 03:07:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:11,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:07:11,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {5363#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5363#true} is VALID [2022-04-15 03:07:11,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {5363#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {5371#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:11,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {5371#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5371#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:11,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5371#(<= ~counter~0 0)} {5363#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5371#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:11,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {5371#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5371#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:11,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {5371#(<= ~counter~0 0)} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {5371#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:11,976 INFO L272 TraceCheckUtils]: 6: Hoare triple {5371#(<= ~counter~0 0)} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {5371#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:11,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {5371#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: 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] {5371#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:11,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {5371#(<= ~counter~0 0)} [116] L9-->L9-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[] {5371#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:11,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {5371#(<= ~counter~0 0)} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5371#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:11,978 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5371#(<= ~counter~0 0)} {5371#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {5371#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:11,978 INFO L272 TraceCheckUtils]: 11: Hoare triple {5371#(<= ~counter~0 0)} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {5371#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:11,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {5371#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: 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] {5371#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:11,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {5371#(<= ~counter~0 0)} [116] L9-->L9-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[] {5371#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:11,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {5371#(<= ~counter~0 0)} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5371#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:11,979 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5371#(<= ~counter~0 0)} {5371#(<= ~counter~0 0)} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {5371#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:11,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {5371#(<= ~counter~0 0)} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {5371#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:11,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {5371#(<= ~counter~0 0)} [118] L47-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] {5420#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:11,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {5420#(<= ~counter~0 1)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5420#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:11,981 INFO L272 TraceCheckUtils]: 19: Hoare triple {5420#(<= ~counter~0 1)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {5420#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:11,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {5420#(<= ~counter~0 1)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5420#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:11,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {5420#(<= ~counter~0 1)} [128] L12-->L12-2: Formula: (not (= 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[] {5420#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:11,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {5420#(<= ~counter~0 1)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5420#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:11,983 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5420#(<= ~counter~0 1)} {5420#(<= ~counter~0 1)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {5420#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:11,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {5420#(<= ~counter~0 1)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {5420#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:11,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {5420#(<= ~counter~0 1)} [135] L39-3-->L39-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] {5445#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:11,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {5445#(<= ~counter~0 2)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {5445#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:11,984 INFO L272 TraceCheckUtils]: 27: Hoare triple {5445#(<= ~counter~0 2)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {5445#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:11,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {5445#(<= ~counter~0 2)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5445#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:11,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {5445#(<= ~counter~0 2)} [128] L12-->L12-2: Formula: (not (= 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[] {5445#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:11,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {5445#(<= ~counter~0 2)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5445#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:11,986 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5445#(<= ~counter~0 2)} {5445#(<= ~counter~0 2)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {5445#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:11,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {5445#(<= ~counter~0 2)} [140] L40-1-->L47-2: Formula: (not (< 0 v_main_~r~0_7)) InVars {main_~r~0=v_main_~r~0_7} OutVars{main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[] {5445#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:11,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {5445#(<= ~counter~0 2)} [137] L47-2-->L47: 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] {5470#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:11,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {5470#(<= ~counter~0 3)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {5470#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:11,996 INFO L272 TraceCheckUtils]: 35: Hoare triple {5470#(<= ~counter~0 3)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {5470#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:11,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {5470#(<= ~counter~0 3)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5470#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:11,997 INFO L290 TraceCheckUtils]: 37: Hoare triple {5470#(<= ~counter~0 3)} [128] L12-->L12-2: Formula: (not (= 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[] {5470#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:11,997 INFO L290 TraceCheckUtils]: 38: Hoare triple {5470#(<= ~counter~0 3)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5470#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:11,998 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5470#(<= ~counter~0 3)} {5470#(<= ~counter~0 3)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {5470#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:11,999 INFO L290 TraceCheckUtils]: 40: Hoare triple {5470#(<= ~counter~0 3)} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {5470#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:11,999 INFO L290 TraceCheckUtils]: 41: Hoare triple {5470#(<= ~counter~0 3)} [137] L47-2-->L47: 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] {5495#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:11,999 INFO L290 TraceCheckUtils]: 42: Hoare triple {5495#(<= ~counter~0 4)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {5495#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:12,000 INFO L272 TraceCheckUtils]: 43: Hoare triple {5495#(<= ~counter~0 4)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {5495#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:12,001 INFO L290 TraceCheckUtils]: 44: Hoare triple {5495#(<= ~counter~0 4)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5495#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:12,001 INFO L290 TraceCheckUtils]: 45: Hoare triple {5495#(<= ~counter~0 4)} [128] L12-->L12-2: Formula: (not (= 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[] {5495#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:12,001 INFO L290 TraceCheckUtils]: 46: Hoare triple {5495#(<= ~counter~0 4)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5495#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:12,004 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5495#(<= ~counter~0 4)} {5495#(<= ~counter~0 4)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {5495#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:12,004 INFO L290 TraceCheckUtils]: 48: Hoare triple {5495#(<= ~counter~0 4)} [142] L48-1-->L47-3: Formula: (not (< v_main_~r~0_11 0)) InVars {main_~r~0=v_main_~r~0_11} OutVars{main_~r~0=v_main_~r~0_11} AuxVars[] AssignedVars[] {5495#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:12,005 INFO L290 TraceCheckUtils]: 49: Hoare triple {5495#(<= ~counter~0 4)} [118] L47-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] {5520#(<= |main_#t~post6| 4)} is VALID [2022-04-15 03:07:12,005 INFO L290 TraceCheckUtils]: 50: Hoare triple {5520#(<= |main_#t~post6| 4)} [121] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5364#false} is VALID [2022-04-15 03:07:12,005 INFO L272 TraceCheckUtils]: 51: Hoare triple {5364#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {5364#false} is VALID [2022-04-15 03:07:12,005 INFO L290 TraceCheckUtils]: 52: Hoare triple {5364#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5364#false} is VALID [2022-04-15 03:07:12,006 INFO L290 TraceCheckUtils]: 53: Hoare triple {5364#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {5364#false} is VALID [2022-04-15 03:07:12,006 INFO L290 TraceCheckUtils]: 54: Hoare triple {5364#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5364#false} is VALID [2022-04-15 03:07:12,006 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 03:07:12,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:07:12,338 INFO L290 TraceCheckUtils]: 54: Hoare triple {5364#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5364#false} is VALID [2022-04-15 03:07:12,339 INFO L290 TraceCheckUtils]: 53: Hoare triple {5364#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {5364#false} is VALID [2022-04-15 03:07:12,339 INFO L290 TraceCheckUtils]: 52: Hoare triple {5364#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5364#false} is VALID [2022-04-15 03:07:12,339 INFO L272 TraceCheckUtils]: 51: Hoare triple {5364#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {5364#false} is VALID [2022-04-15 03:07:12,339 INFO L290 TraceCheckUtils]: 50: Hoare triple {5548#(< |main_#t~post6| 10)} [121] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5364#false} is VALID [2022-04-15 03:07:12,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {5552#(< ~counter~0 10)} [118] L47-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] {5548#(< |main_#t~post6| 10)} is VALID [2022-04-15 03:07:12,340 INFO L290 TraceCheckUtils]: 48: Hoare triple {5552#(< ~counter~0 10)} [142] L48-1-->L47-3: Formula: (not (< v_main_~r~0_11 0)) InVars {main_~r~0=v_main_~r~0_11} OutVars{main_~r~0=v_main_~r~0_11} AuxVars[] AssignedVars[] {5552#(< ~counter~0 10)} is VALID [2022-04-15 03:07:12,348 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5363#true} {5552#(< ~counter~0 10)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {5552#(< ~counter~0 10)} is VALID [2022-04-15 03:07:12,348 INFO L290 TraceCheckUtils]: 46: Hoare triple {5363#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5363#true} is VALID [2022-04-15 03:07:12,348 INFO L290 TraceCheckUtils]: 45: Hoare triple {5363#true} [128] L12-->L12-2: Formula: (not (= 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[] {5363#true} is VALID [2022-04-15 03:07:12,348 INFO L290 TraceCheckUtils]: 44: Hoare triple {5363#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5363#true} is VALID [2022-04-15 03:07:12,348 INFO L272 TraceCheckUtils]: 43: Hoare triple {5552#(< ~counter~0 10)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {5363#true} is VALID [2022-04-15 03:07:12,349 INFO L290 TraceCheckUtils]: 42: Hoare triple {5552#(< ~counter~0 10)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {5552#(< ~counter~0 10)} is VALID [2022-04-15 03:07:12,350 INFO L290 TraceCheckUtils]: 41: Hoare triple {5577#(< ~counter~0 9)} [137] L47-2-->L47: 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] {5552#(< ~counter~0 10)} is VALID [2022-04-15 03:07:12,350 INFO L290 TraceCheckUtils]: 40: Hoare triple {5577#(< ~counter~0 9)} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {5577#(< ~counter~0 9)} is VALID [2022-04-15 03:07:12,351 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5363#true} {5577#(< ~counter~0 9)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {5577#(< ~counter~0 9)} is VALID [2022-04-15 03:07:12,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {5363#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5363#true} is VALID [2022-04-15 03:07:12,352 INFO L290 TraceCheckUtils]: 37: Hoare triple {5363#true} [128] L12-->L12-2: Formula: (not (= 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[] {5363#true} is VALID [2022-04-15 03:07:12,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {5363#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5363#true} is VALID [2022-04-15 03:07:12,352 INFO L272 TraceCheckUtils]: 35: Hoare triple {5577#(< ~counter~0 9)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {5363#true} is VALID [2022-04-15 03:07:12,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {5577#(< ~counter~0 9)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {5577#(< ~counter~0 9)} is VALID [2022-04-15 03:07:12,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {5602#(< ~counter~0 8)} [137] L47-2-->L47: 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] {5577#(< ~counter~0 9)} is VALID [2022-04-15 03:07:12,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {5602#(< ~counter~0 8)} [140] L40-1-->L47-2: Formula: (not (< 0 v_main_~r~0_7)) InVars {main_~r~0=v_main_~r~0_7} OutVars{main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[] {5602#(< ~counter~0 8)} is VALID [2022-04-15 03:07:12,354 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5363#true} {5602#(< ~counter~0 8)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {5602#(< ~counter~0 8)} is VALID [2022-04-15 03:07:12,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {5363#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5363#true} is VALID [2022-04-15 03:07:12,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {5363#true} [128] L12-->L12-2: Formula: (not (= 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[] {5363#true} is VALID [2022-04-15 03:07:12,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {5363#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5363#true} is VALID [2022-04-15 03:07:12,354 INFO L272 TraceCheckUtils]: 27: Hoare triple {5602#(< ~counter~0 8)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {5363#true} is VALID [2022-04-15 03:07:12,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {5602#(< ~counter~0 8)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {5602#(< ~counter~0 8)} is VALID [2022-04-15 03:07:12,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {5627#(< ~counter~0 7)} [135] L39-3-->L39-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] {5602#(< ~counter~0 8)} is VALID [2022-04-15 03:07:12,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {5627#(< ~counter~0 7)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {5627#(< ~counter~0 7)} is VALID [2022-04-15 03:07:12,356 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5363#true} {5627#(< ~counter~0 7)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {5627#(< ~counter~0 7)} is VALID [2022-04-15 03:07:12,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {5363#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5363#true} is VALID [2022-04-15 03:07:12,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {5363#true} [128] L12-->L12-2: Formula: (not (= 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[] {5363#true} is VALID [2022-04-15 03:07:12,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {5363#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5363#true} is VALID [2022-04-15 03:07:12,357 INFO L272 TraceCheckUtils]: 19: Hoare triple {5627#(< ~counter~0 7)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {5363#true} is VALID [2022-04-15 03:07:12,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {5627#(< ~counter~0 7)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5627#(< ~counter~0 7)} is VALID [2022-04-15 03:07:12,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {5652#(< ~counter~0 6)} [118] L47-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] {5627#(< ~counter~0 7)} is VALID [2022-04-15 03:07:12,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {5652#(< ~counter~0 6)} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {5652#(< ~counter~0 6)} is VALID [2022-04-15 03:07:12,359 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5363#true} {5652#(< ~counter~0 6)} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {5652#(< ~counter~0 6)} is VALID [2022-04-15 03:07:12,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {5363#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5363#true} is VALID [2022-04-15 03:07:12,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {5363#true} [116] L9-->L9-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[] {5363#true} is VALID [2022-04-15 03:07:12,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {5363#true} [113] assume_abort_if_notENTRY-->L9: 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] {5363#true} is VALID [2022-04-15 03:07:12,359 INFO L272 TraceCheckUtils]: 11: Hoare triple {5652#(< ~counter~0 6)} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {5363#true} is VALID [2022-04-15 03:07:12,359 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5363#true} {5652#(< ~counter~0 6)} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {5652#(< ~counter~0 6)} is VALID [2022-04-15 03:07:12,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {5363#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5363#true} is VALID [2022-04-15 03:07:12,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {5363#true} [116] L9-->L9-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[] {5363#true} is VALID [2022-04-15 03:07:12,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {5363#true} [113] assume_abort_if_notENTRY-->L9: 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] {5363#true} is VALID [2022-04-15 03:07:12,360 INFO L272 TraceCheckUtils]: 6: Hoare triple {5652#(< ~counter~0 6)} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {5363#true} is VALID [2022-04-15 03:07:12,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {5652#(< ~counter~0 6)} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {5652#(< ~counter~0 6)} is VALID [2022-04-15 03:07:12,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {5652#(< ~counter~0 6)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5652#(< ~counter~0 6)} is VALID [2022-04-15 03:07:12,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5652#(< ~counter~0 6)} {5363#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5652#(< ~counter~0 6)} is VALID [2022-04-15 03:07:12,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {5652#(< ~counter~0 6)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5652#(< ~counter~0 6)} is VALID [2022-04-15 03:07:12,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {5363#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {5652#(< ~counter~0 6)} is VALID [2022-04-15 03:07:12,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {5363#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5363#true} is VALID [2022-04-15 03:07:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 03:07:12,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:07:12,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968636964] [2022-04-15 03:07:12,365 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:07:12,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608129611] [2022-04-15 03:07:12,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608129611] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 03:07:12,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 03:07:12,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 03:07:12,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303945398] [2022-04-15 03:07:12,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 03:07:12,381 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 55 [2022-04-15 03:07:12,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:07:12,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-15 03:07:12,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:12,461 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 03:07:12,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:07:12,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 03:07:12,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 03:07:12,462 INFO L87 Difference]: Start difference. First operand 157 states and 200 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-15 03:07:13,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:13,295 INFO L93 Difference]: Finished difference Result 215 states and 281 transitions. [2022-04-15 03:07:13,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 03:07:13,295 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 55 [2022-04-15 03:07:13,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:07:13,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-15 03:07:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2022-04-15 03:07:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-15 03:07:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2022-04-15 03:07:13,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 204 transitions. [2022-04-15 03:07:13,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:13,494 INFO L225 Difference]: With dead ends: 215 [2022-04-15 03:07:13,494 INFO L226 Difference]: Without dead ends: 210 [2022-04-15 03:07:13,495 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2022-04-15 03:07:13,495 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 222 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 03:07:13,495 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 232 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 03:07:13,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-15 03:07:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 202. [2022-04-15 03:07:13,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:07:13,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 202 states, 148 states have (on average 1.2297297297297298) internal successors, (182), 152 states have internal predecessors, (182), 40 states have call successors, (40), 15 states have call predecessors, (40), 13 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-15 03:07:13,608 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 202 states, 148 states have (on average 1.2297297297297298) internal successors, (182), 152 states have internal predecessors, (182), 40 states have call successors, (40), 15 states have call predecessors, (40), 13 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-15 03:07:13,609 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 202 states, 148 states have (on average 1.2297297297297298) internal successors, (182), 152 states have internal predecessors, (182), 40 states have call successors, (40), 15 states have call predecessors, (40), 13 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-15 03:07:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:13,615 INFO L93 Difference]: Finished difference Result 210 states and 270 transitions. [2022-04-15 03:07:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 270 transitions. [2022-04-15 03:07:13,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:13,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:13,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 202 states, 148 states have (on average 1.2297297297297298) internal successors, (182), 152 states have internal predecessors, (182), 40 states have call successors, (40), 15 states have call predecessors, (40), 13 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) Second operand 210 states. [2022-04-15 03:07:13,617 INFO L87 Difference]: Start difference. First operand has 202 states, 148 states have (on average 1.2297297297297298) internal successors, (182), 152 states have internal predecessors, (182), 40 states have call successors, (40), 15 states have call predecessors, (40), 13 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) Second operand 210 states. [2022-04-15 03:07:13,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:13,623 INFO L93 Difference]: Finished difference Result 210 states and 270 transitions. [2022-04-15 03:07:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 270 transitions. [2022-04-15 03:07:13,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:13,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:13,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:07:13,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:07:13,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 148 states have (on average 1.2297297297297298) internal successors, (182), 152 states have internal predecessors, (182), 40 states have call successors, (40), 15 states have call predecessors, (40), 13 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-15 03:07:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 260 transitions. [2022-04-15 03:07:13,631 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 260 transitions. Word has length 55 [2022-04-15 03:07:13,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:07:13,651 INFO L478 AbstractCegarLoop]: Abstraction has 202 states and 260 transitions. [2022-04-15 03:07:13,652 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-15 03:07:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 260 transitions. [2022-04-15 03:07:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 03:07:13,653 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:07:13,653 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:07:13,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 03:07:13,880 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 03:07:13,880 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:07:13,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:07:13,881 INFO L85 PathProgramCache]: Analyzing trace with hash -725338187, now seen corresponding path program 1 times [2022-04-15 03:07:13,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:07:13,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897508703] [2022-04-15 03:07:13,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:13,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:07:13,896 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:07:13,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [21671274] [2022-04-15 03:07:13,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:13,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:13,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:07:13,898 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-15 03:07:13,902 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-15 03:07:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:13,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 03:07:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:13,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:07:14,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {6719#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {6719#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {6719#true} is VALID [2022-04-15 03:07:14,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {6719#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6719#true} {6719#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {6719#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {6719#true} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {6719#true} is VALID [2022-04-15 03:07:14,253 INFO L272 TraceCheckUtils]: 6: Hoare triple {6719#true} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {6719#true} is VALID [2022-04-15 03:07:14,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {6719#true} [113] assume_abort_if_notENTRY-->L9: 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] {6719#true} is VALID [2022-04-15 03:07:14,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {6719#true} [116] L9-->L9-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[] {6719#true} is VALID [2022-04-15 03:07:14,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {6719#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,254 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6719#true} {6719#true} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {6719#true} is VALID [2022-04-15 03:07:14,254 INFO L272 TraceCheckUtils]: 11: Hoare triple {6719#true} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {6719#true} is VALID [2022-04-15 03:07:14,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {6719#true} [113] assume_abort_if_notENTRY-->L9: 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] {6719#true} is VALID [2022-04-15 03:07:14,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {6719#true} [116] L9-->L9-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[] {6719#true} is VALID [2022-04-15 03:07:14,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {6719#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,254 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6719#true} {6719#true} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {6719#true} is VALID [2022-04-15 03:07:14,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {6719#true} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {6772#(<= main_~v~0 1)} [118] L47-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] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {6772#(<= main_~v~0 1)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,256 INFO L272 TraceCheckUtils]: 19: Hoare triple {6772#(<= main_~v~0 1)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6719#true} is VALID [2022-04-15 03:07:14,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {6719#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6719#true} is VALID [2022-04-15 03:07:14,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {6719#true} [128] L12-->L12-2: Formula: (not (= 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[] {6719#true} is VALID [2022-04-15 03:07:14,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {6719#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,257 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6719#true} {6772#(<= main_~v~0 1)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {6772#(<= main_~v~0 1)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {6772#(<= main_~v~0 1)} [135] L39-3-->L39-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] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {6772#(<= main_~v~0 1)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,258 INFO L272 TraceCheckUtils]: 27: Hoare triple {6772#(<= main_~v~0 1)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6719#true} is VALID [2022-04-15 03:07:14,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {6719#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6719#true} is VALID [2022-04-15 03:07:14,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {6719#true} [128] L12-->L12-2: Formula: (not (= 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[] {6719#true} is VALID [2022-04-15 03:07:14,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {6719#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,259 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6719#true} {6772#(<= main_~v~0 1)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {6772#(<= main_~v~0 1)} [140] L40-1-->L47-2: Formula: (not (< 0 v_main_~r~0_7)) InVars {main_~r~0=v_main_~r~0_7} OutVars{main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {6772#(<= main_~v~0 1)} [137] L47-2-->L47: 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] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,260 INFO L290 TraceCheckUtils]: 34: Hoare triple {6772#(<= main_~v~0 1)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,260 INFO L272 TraceCheckUtils]: 35: Hoare triple {6772#(<= main_~v~0 1)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6719#true} is VALID [2022-04-15 03:07:14,260 INFO L290 TraceCheckUtils]: 36: Hoare triple {6719#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6719#true} is VALID [2022-04-15 03:07:14,260 INFO L290 TraceCheckUtils]: 37: Hoare triple {6719#true} [128] L12-->L12-2: Formula: (not (= 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[] {6719#true} is VALID [2022-04-15 03:07:14,260 INFO L290 TraceCheckUtils]: 38: Hoare triple {6719#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,261 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6719#true} {6772#(<= main_~v~0 1)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,261 INFO L290 TraceCheckUtils]: 40: Hoare triple {6772#(<= main_~v~0 1)} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,261 INFO L290 TraceCheckUtils]: 41: Hoare triple {6772#(<= main_~v~0 1)} [137] L47-2-->L47: 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] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,262 INFO L290 TraceCheckUtils]: 42: Hoare triple {6772#(<= main_~v~0 1)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,262 INFO L272 TraceCheckUtils]: 43: Hoare triple {6772#(<= main_~v~0 1)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6719#true} is VALID [2022-04-15 03:07:14,262 INFO L290 TraceCheckUtils]: 44: Hoare triple {6719#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6719#true} is VALID [2022-04-15 03:07:14,262 INFO L290 TraceCheckUtils]: 45: Hoare triple {6719#true} [128] L12-->L12-2: Formula: (not (= 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[] {6719#true} is VALID [2022-04-15 03:07:14,262 INFO L290 TraceCheckUtils]: 46: Hoare triple {6719#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,263 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6719#true} {6772#(<= main_~v~0 1)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,263 INFO L290 TraceCheckUtils]: 48: Hoare triple {6772#(<= main_~v~0 1)} [142] L48-1-->L47-3: Formula: (not (< v_main_~r~0_11 0)) InVars {main_~r~0=v_main_~r~0_11} OutVars{main_~r~0=v_main_~r~0_11} AuxVars[] AssignedVars[] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,263 INFO L290 TraceCheckUtils]: 49: Hoare triple {6772#(<= main_~v~0 1)} [118] L47-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] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,264 INFO L290 TraceCheckUtils]: 50: Hoare triple {6772#(<= main_~v~0 1)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,264 INFO L272 TraceCheckUtils]: 51: Hoare triple {6772#(<= main_~v~0 1)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6719#true} is VALID [2022-04-15 03:07:14,264 INFO L290 TraceCheckUtils]: 52: Hoare triple {6719#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6719#true} is VALID [2022-04-15 03:07:14,264 INFO L290 TraceCheckUtils]: 53: Hoare triple {6719#true} [128] L12-->L12-2: Formula: (not (= 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[] {6719#true} is VALID [2022-04-15 03:07:14,264 INFO L290 TraceCheckUtils]: 54: Hoare triple {6719#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,265 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6719#true} {6772#(<= main_~v~0 1)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,265 INFO L290 TraceCheckUtils]: 56: Hoare triple {6772#(<= main_~v~0 1)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,265 INFO L290 TraceCheckUtils]: 57: Hoare triple {6772#(<= main_~v~0 1)} [135] L39-3-->L39-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] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,266 INFO L290 TraceCheckUtils]: 58: Hoare triple {6772#(<= main_~v~0 1)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,266 INFO L272 TraceCheckUtils]: 59: Hoare triple {6772#(<= main_~v~0 1)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6719#true} is VALID [2022-04-15 03:07:14,266 INFO L290 TraceCheckUtils]: 60: Hoare triple {6719#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6719#true} is VALID [2022-04-15 03:07:14,266 INFO L290 TraceCheckUtils]: 61: Hoare triple {6719#true} [128] L12-->L12-2: Formula: (not (= 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[] {6719#true} is VALID [2022-04-15 03:07:14,266 INFO L290 TraceCheckUtils]: 62: Hoare triple {6719#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,267 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {6719#true} {6772#(<= main_~v~0 1)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,267 INFO L290 TraceCheckUtils]: 64: Hoare triple {6772#(<= main_~v~0 1)} [141] L40-1-->L39-3: Formula: (and (< 0 v_main_~r~0_9) (= v_main_~r~0_8 (+ (* (- 1) v_main_~v~0_7) v_main_~r~0_9)) (= v_main_~v~0_6 (+ v_main_~v~0_7 2))) InVars {main_~v~0=v_main_~v~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~v~0=v_main_~v~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {6917#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 03:07:14,268 INFO L290 TraceCheckUtils]: 65: Hoare triple {6917#(< 0 (+ main_~r~0 1))} [135] L39-3-->L39-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] {6917#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 03:07:14,268 INFO L290 TraceCheckUtils]: 66: Hoare triple {6917#(< 0 (+ main_~r~0 1))} [138] L39-1-->L47-2: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6917#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 03:07:14,268 INFO L290 TraceCheckUtils]: 67: Hoare triple {6917#(< 0 (+ main_~r~0 1))} [137] L47-2-->L47: 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] {6917#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 03:07:14,269 INFO L290 TraceCheckUtils]: 68: Hoare triple {6917#(< 0 (+ main_~r~0 1))} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {6917#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 03:07:14,269 INFO L272 TraceCheckUtils]: 69: Hoare triple {6917#(< 0 (+ main_~r~0 1))} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6719#true} is VALID [2022-04-15 03:07:14,269 INFO L290 TraceCheckUtils]: 70: Hoare triple {6719#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6719#true} is VALID [2022-04-15 03:07:14,269 INFO L290 TraceCheckUtils]: 71: Hoare triple {6719#true} [128] L12-->L12-2: Formula: (not (= 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[] {6719#true} is VALID [2022-04-15 03:07:14,269 INFO L290 TraceCheckUtils]: 72: Hoare triple {6719#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,270 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6719#true} {6917#(< 0 (+ main_~r~0 1))} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6917#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 03:07:14,270 INFO L290 TraceCheckUtils]: 74: Hoare triple {6917#(< 0 (+ main_~r~0 1))} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {6720#false} is VALID [2022-04-15 03:07:14,270 INFO L290 TraceCheckUtils]: 75: Hoare triple {6720#false} [137] L47-2-->L47: 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] {6720#false} is VALID [2022-04-15 03:07:14,270 INFO L290 TraceCheckUtils]: 76: Hoare triple {6720#false} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {6720#false} is VALID [2022-04-15 03:07:14,271 INFO L272 TraceCheckUtils]: 77: Hoare triple {6720#false} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6720#false} is VALID [2022-04-15 03:07:14,271 INFO L290 TraceCheckUtils]: 78: Hoare triple {6720#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6720#false} is VALID [2022-04-15 03:07:14,271 INFO L290 TraceCheckUtils]: 79: Hoare triple {6720#false} [128] L12-->L12-2: Formula: (not (= 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[] {6720#false} is VALID [2022-04-15 03:07:14,271 INFO L290 TraceCheckUtils]: 80: Hoare triple {6720#false} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6720#false} is VALID [2022-04-15 03:07:14,271 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6720#false} {6720#false} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6720#false} is VALID [2022-04-15 03:07:14,271 INFO L290 TraceCheckUtils]: 82: Hoare triple {6720#false} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {6720#false} is VALID [2022-04-15 03:07:14,271 INFO L290 TraceCheckUtils]: 83: Hoare triple {6720#false} [137] L47-2-->L47: 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] {6720#false} is VALID [2022-04-15 03:07:14,271 INFO L290 TraceCheckUtils]: 84: Hoare triple {6720#false} [144] L47-->L47-3: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {6720#false} is VALID [2022-04-15 03:07:14,271 INFO L290 TraceCheckUtils]: 85: Hoare triple {6720#false} [118] L47-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] {6720#false} is VALID [2022-04-15 03:07:14,271 INFO L290 TraceCheckUtils]: 86: Hoare triple {6720#false} [121] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6720#false} is VALID [2022-04-15 03:07:14,272 INFO L272 TraceCheckUtils]: 87: Hoare triple {6720#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {6720#false} is VALID [2022-04-15 03:07:14,272 INFO L290 TraceCheckUtils]: 88: Hoare triple {6720#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6720#false} is VALID [2022-04-15 03:07:14,272 INFO L290 TraceCheckUtils]: 89: Hoare triple {6720#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {6720#false} is VALID [2022-04-15 03:07:14,272 INFO L290 TraceCheckUtils]: 90: Hoare triple {6720#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6720#false} is VALID [2022-04-15 03:07:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 64 proven. 12 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-04-15 03:07:14,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:07:14,559 INFO L290 TraceCheckUtils]: 90: Hoare triple {6720#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6720#false} is VALID [2022-04-15 03:07:14,560 INFO L290 TraceCheckUtils]: 89: Hoare triple {6720#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {6720#false} is VALID [2022-04-15 03:07:14,560 INFO L290 TraceCheckUtils]: 88: Hoare triple {6720#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6720#false} is VALID [2022-04-15 03:07:14,560 INFO L272 TraceCheckUtils]: 87: Hoare triple {6720#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {6720#false} is VALID [2022-04-15 03:07:14,560 INFO L290 TraceCheckUtils]: 86: Hoare triple {6720#false} [121] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6720#false} is VALID [2022-04-15 03:07:14,560 INFO L290 TraceCheckUtils]: 85: Hoare triple {6720#false} [118] L47-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] {6720#false} is VALID [2022-04-15 03:07:14,560 INFO L290 TraceCheckUtils]: 84: Hoare triple {6720#false} [144] L47-->L47-3: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {6720#false} is VALID [2022-04-15 03:07:14,560 INFO L290 TraceCheckUtils]: 83: Hoare triple {6720#false} [137] L47-2-->L47: 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] {6720#false} is VALID [2022-04-15 03:07:14,560 INFO L290 TraceCheckUtils]: 82: Hoare triple {6720#false} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {6720#false} is VALID [2022-04-15 03:07:14,560 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6719#true} {6720#false} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6720#false} is VALID [2022-04-15 03:07:14,561 INFO L290 TraceCheckUtils]: 80: Hoare triple {6719#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,561 INFO L290 TraceCheckUtils]: 79: Hoare triple {6719#true} [128] L12-->L12-2: Formula: (not (= 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[] {6719#true} is VALID [2022-04-15 03:07:14,561 INFO L290 TraceCheckUtils]: 78: Hoare triple {6719#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6719#true} is VALID [2022-04-15 03:07:14,561 INFO L272 TraceCheckUtils]: 77: Hoare triple {6720#false} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6719#true} is VALID [2022-04-15 03:07:14,561 INFO L290 TraceCheckUtils]: 76: Hoare triple {6720#false} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {6720#false} is VALID [2022-04-15 03:07:14,561 INFO L290 TraceCheckUtils]: 75: Hoare triple {6720#false} [137] L47-2-->L47: 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] {6720#false} is VALID [2022-04-15 03:07:14,562 INFO L290 TraceCheckUtils]: 74: Hoare triple {6917#(< 0 (+ main_~r~0 1))} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {6720#false} is VALID [2022-04-15 03:07:14,562 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6719#true} {6917#(< 0 (+ main_~r~0 1))} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6917#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 03:07:14,562 INFO L290 TraceCheckUtils]: 72: Hoare triple {6719#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,563 INFO L290 TraceCheckUtils]: 71: Hoare triple {6719#true} [128] L12-->L12-2: Formula: (not (= 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[] {6719#true} is VALID [2022-04-15 03:07:14,563 INFO L290 TraceCheckUtils]: 70: Hoare triple {6719#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6719#true} is VALID [2022-04-15 03:07:14,563 INFO L272 TraceCheckUtils]: 69: Hoare triple {6917#(< 0 (+ main_~r~0 1))} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6719#true} is VALID [2022-04-15 03:07:14,564 INFO L290 TraceCheckUtils]: 68: Hoare triple {6917#(< 0 (+ main_~r~0 1))} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {6917#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 03:07:14,565 INFO L290 TraceCheckUtils]: 67: Hoare triple {6917#(< 0 (+ main_~r~0 1))} [137] L47-2-->L47: 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] {6917#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 03:07:14,565 INFO L290 TraceCheckUtils]: 66: Hoare triple {6917#(< 0 (+ main_~r~0 1))} [138] L39-1-->L47-2: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6917#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 03:07:14,566 INFO L290 TraceCheckUtils]: 65: Hoare triple {6917#(< 0 (+ main_~r~0 1))} [135] L39-3-->L39-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] {6917#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 03:07:14,566 INFO L290 TraceCheckUtils]: 64: Hoare triple {6772#(<= main_~v~0 1)} [141] L40-1-->L39-3: Formula: (and (< 0 v_main_~r~0_9) (= v_main_~r~0_8 (+ (* (- 1) v_main_~v~0_7) v_main_~r~0_9)) (= v_main_~v~0_6 (+ v_main_~v~0_7 2))) InVars {main_~v~0=v_main_~v~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~v~0=v_main_~v~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {6917#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 03:07:14,567 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {6719#true} {6772#(<= main_~v~0 1)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,567 INFO L290 TraceCheckUtils]: 62: Hoare triple {6719#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,567 INFO L290 TraceCheckUtils]: 61: Hoare triple {6719#true} [128] L12-->L12-2: Formula: (not (= 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[] {6719#true} is VALID [2022-04-15 03:07:14,567 INFO L290 TraceCheckUtils]: 60: Hoare triple {6719#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6719#true} is VALID [2022-04-15 03:07:14,567 INFO L272 TraceCheckUtils]: 59: Hoare triple {6772#(<= main_~v~0 1)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6719#true} is VALID [2022-04-15 03:07:14,568 INFO L290 TraceCheckUtils]: 58: Hoare triple {6772#(<= main_~v~0 1)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,568 INFO L290 TraceCheckUtils]: 57: Hoare triple {6772#(<= main_~v~0 1)} [135] L39-3-->L39-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] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,568 INFO L290 TraceCheckUtils]: 56: Hoare triple {6772#(<= main_~v~0 1)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,569 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6719#true} {6772#(<= main_~v~0 1)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,569 INFO L290 TraceCheckUtils]: 54: Hoare triple {6719#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,569 INFO L290 TraceCheckUtils]: 53: Hoare triple {6719#true} [128] L12-->L12-2: Formula: (not (= 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[] {6719#true} is VALID [2022-04-15 03:07:14,569 INFO L290 TraceCheckUtils]: 52: Hoare triple {6719#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6719#true} is VALID [2022-04-15 03:07:14,569 INFO L272 TraceCheckUtils]: 51: Hoare triple {6772#(<= main_~v~0 1)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6719#true} is VALID [2022-04-15 03:07:14,569 INFO L290 TraceCheckUtils]: 50: Hoare triple {6772#(<= main_~v~0 1)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,570 INFO L290 TraceCheckUtils]: 49: Hoare triple {6772#(<= main_~v~0 1)} [118] L47-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] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,570 INFO L290 TraceCheckUtils]: 48: Hoare triple {6772#(<= main_~v~0 1)} [142] L48-1-->L47-3: Formula: (not (< v_main_~r~0_11 0)) InVars {main_~r~0=v_main_~r~0_11} OutVars{main_~r~0=v_main_~r~0_11} AuxVars[] AssignedVars[] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,570 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6719#true} {6772#(<= main_~v~0 1)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,571 INFO L290 TraceCheckUtils]: 46: Hoare triple {6719#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,571 INFO L290 TraceCheckUtils]: 45: Hoare triple {6719#true} [128] L12-->L12-2: Formula: (not (= 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[] {6719#true} is VALID [2022-04-15 03:07:14,571 INFO L290 TraceCheckUtils]: 44: Hoare triple {6719#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6719#true} is VALID [2022-04-15 03:07:14,571 INFO L272 TraceCheckUtils]: 43: Hoare triple {6772#(<= main_~v~0 1)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6719#true} is VALID [2022-04-15 03:07:14,571 INFO L290 TraceCheckUtils]: 42: Hoare triple {6772#(<= main_~v~0 1)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,571 INFO L290 TraceCheckUtils]: 41: Hoare triple {6772#(<= main_~v~0 1)} [137] L47-2-->L47: 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] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {6772#(<= main_~v~0 1)} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,572 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6719#true} {6772#(<= main_~v~0 1)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {6719#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {6719#true} [128] L12-->L12-2: Formula: (not (= 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[] {6719#true} is VALID [2022-04-15 03:07:14,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {6719#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6719#true} is VALID [2022-04-15 03:07:14,573 INFO L272 TraceCheckUtils]: 35: Hoare triple {6772#(<= main_~v~0 1)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6719#true} is VALID [2022-04-15 03:07:14,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {6772#(<= main_~v~0 1)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {6772#(<= main_~v~0 1)} [137] L47-2-->L47: 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] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {6772#(<= main_~v~0 1)} [140] L40-1-->L47-2: Formula: (not (< 0 v_main_~r~0_7)) InVars {main_~r~0=v_main_~r~0_7} OutVars{main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,574 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6719#true} {6772#(<= main_~v~0 1)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {6719#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {6719#true} [128] L12-->L12-2: Formula: (not (= 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[] {6719#true} is VALID [2022-04-15 03:07:14,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {6719#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6719#true} is VALID [2022-04-15 03:07:14,574 INFO L272 TraceCheckUtils]: 27: Hoare triple {6772#(<= main_~v~0 1)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6719#true} is VALID [2022-04-15 03:07:14,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {6772#(<= main_~v~0 1)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {6772#(<= main_~v~0 1)} [135] L39-3-->L39-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] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {6772#(<= main_~v~0 1)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,576 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6719#true} {6772#(<= main_~v~0 1)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {6719#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {6719#true} [128] L12-->L12-2: Formula: (not (= 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[] {6719#true} is VALID [2022-04-15 03:07:14,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {6719#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6719#true} is VALID [2022-04-15 03:07:14,576 INFO L272 TraceCheckUtils]: 19: Hoare triple {6772#(<= main_~v~0 1)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {6719#true} is VALID [2022-04-15 03:07:14,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {6772#(<= main_~v~0 1)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {6772#(<= main_~v~0 1)} [118] L47-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] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {6719#true} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {6772#(<= main_~v~0 1)} is VALID [2022-04-15 03:07:14,577 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6719#true} {6719#true} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {6719#true} is VALID [2022-04-15 03:07:14,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {6719#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {6719#true} [116] L9-->L9-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[] {6719#true} is VALID [2022-04-15 03:07:14,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {6719#true} [113] assume_abort_if_notENTRY-->L9: 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] {6719#true} is VALID [2022-04-15 03:07:14,577 INFO L272 TraceCheckUtils]: 11: Hoare triple {6719#true} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {6719#true} is VALID [2022-04-15 03:07:14,577 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6719#true} {6719#true} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {6719#true} is VALID [2022-04-15 03:07:14,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {6719#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {6719#true} [116] L9-->L9-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[] {6719#true} is VALID [2022-04-15 03:07:14,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {6719#true} [113] assume_abort_if_notENTRY-->L9: 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] {6719#true} is VALID [2022-04-15 03:07:14,578 INFO L272 TraceCheckUtils]: 6: Hoare triple {6719#true} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {6719#true} is VALID [2022-04-15 03:07:14,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {6719#true} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {6719#true} is VALID [2022-04-15 03:07:14,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {6719#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6719#true} {6719#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {6719#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {6719#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {6719#true} is VALID [2022-04-15 03:07:14,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {6719#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6719#true} is VALID [2022-04-15 03:07:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-04-15 03:07:14,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:07:14,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897508703] [2022-04-15 03:07:14,579 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:07:14,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21671274] [2022-04-15 03:07:14,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21671274] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 03:07:14,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 03:07:14,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-15 03:07:14,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414048222] [2022-04-15 03:07:14,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 03:07:14,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 91 [2022-04-15 03:07:14,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:07:14,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-15 03:07:14,634 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-15 03:07:14,634 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 03:07:14,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:07:14,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 03:07:14,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 03:07:14,635 INFO L87 Difference]: Start difference. First operand 202 states and 260 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-15 03:07:15,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:15,091 INFO L93 Difference]: Finished difference Result 506 states and 700 transitions. [2022-04-15 03:07:15,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 03:07:15,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 91 [2022-04-15 03:07:15,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:07:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-15 03:07:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-15 03:07:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-15 03:07:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-15 03:07:15,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 129 transitions. [2022-04-15 03:07:15,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:15,220 INFO L225 Difference]: With dead ends: 506 [2022-04-15 03:07:15,221 INFO L226 Difference]: Without dead ends: 363 [2022-04-15 03:07:15,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 03:07:15,222 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 18 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:07:15,223 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 137 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:07:15,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-15 03:07:15,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 346. [2022-04-15 03:07:15,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:07:15,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 346 states, 258 states have (on average 1.2635658914728682) internal successors, (326), 264 states have internal predecessors, (326), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 03:07:15,431 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 346 states, 258 states have (on average 1.2635658914728682) internal successors, (326), 264 states have internal predecessors, (326), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 03:07:15,432 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 346 states, 258 states have (on average 1.2635658914728682) internal successors, (326), 264 states have internal predecessors, (326), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 03:07:15,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:15,444 INFO L93 Difference]: Finished difference Result 363 states and 493 transitions. [2022-04-15 03:07:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 493 transitions. [2022-04-15 03:07:15,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:15,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:15,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 346 states, 258 states have (on average 1.2635658914728682) internal successors, (326), 264 states have internal predecessors, (326), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 363 states. [2022-04-15 03:07:15,447 INFO L87 Difference]: Start difference. First operand has 346 states, 258 states have (on average 1.2635658914728682) internal successors, (326), 264 states have internal predecessors, (326), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 363 states. [2022-04-15 03:07:15,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:15,460 INFO L93 Difference]: Finished difference Result 363 states and 493 transitions. [2022-04-15 03:07:15,460 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 493 transitions. [2022-04-15 03:07:15,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:15,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:15,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:07:15,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:07:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 258 states have (on average 1.2635658914728682) internal successors, (326), 264 states have internal predecessors, (326), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 03:07:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 472 transitions. [2022-04-15 03:07:15,475 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 472 transitions. Word has length 91 [2022-04-15 03:07:15,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:07:15,475 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 472 transitions. [2022-04-15 03:07:15,475 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-15 03:07:15,476 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 472 transitions. [2022-04-15 03:07:15,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 03:07:15,477 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:07:15,477 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:07:15,504 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-15 03:07:15,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 03:07:15,691 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:07:15,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:07:15,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1986043633, now seen corresponding path program 2 times [2022-04-15 03:07:15,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:07:15,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469301976] [2022-04-15 03:07:15,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:15,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:07:15,707 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:07:15,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [998352115] [2022-04-15 03:07:15,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 03:07:15,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:15,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:07:15,708 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-15 03:07:15,720 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-15 03:07:15,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 03:07:15,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 03:07:15,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 03:07:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:15,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:07:16,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {9191#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9191#true} is VALID [2022-04-15 03:07:16,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {9191#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {9199#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:16,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {9199#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9199#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:16,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9199#(<= ~counter~0 0)} {9191#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9199#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:16,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {9199#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9199#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:16,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {9199#(<= ~counter~0 0)} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {9199#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:16,258 INFO L272 TraceCheckUtils]: 6: Hoare triple {9199#(<= ~counter~0 0)} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {9199#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:16,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {9199#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: 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] {9199#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:16,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {9199#(<= ~counter~0 0)} [116] L9-->L9-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[] {9199#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:16,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {9199#(<= ~counter~0 0)} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9199#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:16,259 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9199#(<= ~counter~0 0)} {9199#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {9199#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:16,260 INFO L272 TraceCheckUtils]: 11: Hoare triple {9199#(<= ~counter~0 0)} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {9199#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:16,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {9199#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: 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] {9199#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:16,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {9199#(<= ~counter~0 0)} [116] L9-->L9-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[] {9199#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:16,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {9199#(<= ~counter~0 0)} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9199#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:16,261 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9199#(<= ~counter~0 0)} {9199#(<= ~counter~0 0)} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {9199#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:16,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {9199#(<= ~counter~0 0)} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {9199#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:16,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {9199#(<= ~counter~0 0)} [118] L47-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] {9248#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:16,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {9248#(<= ~counter~0 1)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {9248#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:16,263 INFO L272 TraceCheckUtils]: 19: Hoare triple {9248#(<= ~counter~0 1)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9248#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:16,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {9248#(<= ~counter~0 1)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9248#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:16,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {9248#(<= ~counter~0 1)} [128] L12-->L12-2: Formula: (not (= 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[] {9248#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:16,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {9248#(<= ~counter~0 1)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9248#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:16,264 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9248#(<= ~counter~0 1)} {9248#(<= ~counter~0 1)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9248#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:16,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {9248#(<= ~counter~0 1)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {9248#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:16,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {9248#(<= ~counter~0 1)} [135] L39-3-->L39-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] {9273#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:16,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {9273#(<= ~counter~0 2)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {9273#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:16,266 INFO L272 TraceCheckUtils]: 27: Hoare triple {9273#(<= ~counter~0 2)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9273#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:16,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {9273#(<= ~counter~0 2)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9273#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:16,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {9273#(<= ~counter~0 2)} [128] L12-->L12-2: Formula: (not (= 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[] {9273#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:16,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {9273#(<= ~counter~0 2)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9273#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:16,267 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9273#(<= ~counter~0 2)} {9273#(<= ~counter~0 2)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9273#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:16,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {9273#(<= ~counter~0 2)} [140] L40-1-->L47-2: Formula: (not (< 0 v_main_~r~0_7)) InVars {main_~r~0=v_main_~r~0_7} OutVars{main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[] {9273#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:16,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {9273#(<= ~counter~0 2)} [137] L47-2-->L47: 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] {9298#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:16,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {9298#(<= ~counter~0 3)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {9298#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:16,269 INFO L272 TraceCheckUtils]: 35: Hoare triple {9298#(<= ~counter~0 3)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9298#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:16,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {9298#(<= ~counter~0 3)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9298#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:16,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {9298#(<= ~counter~0 3)} [128] L12-->L12-2: Formula: (not (= 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[] {9298#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:16,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {9298#(<= ~counter~0 3)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9298#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:16,270 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9298#(<= ~counter~0 3)} {9298#(<= ~counter~0 3)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9298#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:16,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {9298#(<= ~counter~0 3)} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {9298#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:16,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {9298#(<= ~counter~0 3)} [137] L47-2-->L47: 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] {9323#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:16,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {9323#(<= ~counter~0 4)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {9323#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:16,272 INFO L272 TraceCheckUtils]: 43: Hoare triple {9323#(<= ~counter~0 4)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9323#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:16,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {9323#(<= ~counter~0 4)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9323#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:16,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {9323#(<= ~counter~0 4)} [128] L12-->L12-2: Formula: (not (= 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[] {9323#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:16,272 INFO L290 TraceCheckUtils]: 46: Hoare triple {9323#(<= ~counter~0 4)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9323#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:16,273 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9323#(<= ~counter~0 4)} {9323#(<= ~counter~0 4)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9323#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:16,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {9323#(<= ~counter~0 4)} [142] L48-1-->L47-3: Formula: (not (< v_main_~r~0_11 0)) InVars {main_~r~0=v_main_~r~0_11} OutVars{main_~r~0=v_main_~r~0_11} AuxVars[] AssignedVars[] {9323#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:16,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {9323#(<= ~counter~0 4)} [118] L47-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] {9348#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:16,274 INFO L290 TraceCheckUtils]: 50: Hoare triple {9348#(<= ~counter~0 5)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {9348#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:16,275 INFO L272 TraceCheckUtils]: 51: Hoare triple {9348#(<= ~counter~0 5)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9348#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:16,275 INFO L290 TraceCheckUtils]: 52: Hoare triple {9348#(<= ~counter~0 5)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9348#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:16,275 INFO L290 TraceCheckUtils]: 53: Hoare triple {9348#(<= ~counter~0 5)} [128] L12-->L12-2: Formula: (not (= 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[] {9348#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:16,275 INFO L290 TraceCheckUtils]: 54: Hoare triple {9348#(<= ~counter~0 5)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9348#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:16,276 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9348#(<= ~counter~0 5)} {9348#(<= ~counter~0 5)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9348#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:16,276 INFO L290 TraceCheckUtils]: 56: Hoare triple {9348#(<= ~counter~0 5)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {9348#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:16,277 INFO L290 TraceCheckUtils]: 57: Hoare triple {9348#(<= ~counter~0 5)} [135] L39-3-->L39-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] {9373#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:16,277 INFO L290 TraceCheckUtils]: 58: Hoare triple {9373#(<= ~counter~0 6)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {9373#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:16,278 INFO L272 TraceCheckUtils]: 59: Hoare triple {9373#(<= ~counter~0 6)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9373#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:16,278 INFO L290 TraceCheckUtils]: 60: Hoare triple {9373#(<= ~counter~0 6)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9373#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:16,278 INFO L290 TraceCheckUtils]: 61: Hoare triple {9373#(<= ~counter~0 6)} [128] L12-->L12-2: Formula: (not (= 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[] {9373#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:16,278 INFO L290 TraceCheckUtils]: 62: Hoare triple {9373#(<= ~counter~0 6)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9373#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:16,279 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {9373#(<= ~counter~0 6)} {9373#(<= ~counter~0 6)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9373#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:16,279 INFO L290 TraceCheckUtils]: 64: Hoare triple {9373#(<= ~counter~0 6)} [141] L40-1-->L39-3: Formula: (and (< 0 v_main_~r~0_9) (= v_main_~r~0_8 (+ (* (- 1) v_main_~v~0_7) v_main_~r~0_9)) (= v_main_~v~0_6 (+ v_main_~v~0_7 2))) InVars {main_~v~0=v_main_~v~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~v~0=v_main_~v~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {9373#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:16,280 INFO L290 TraceCheckUtils]: 65: Hoare triple {9373#(<= ~counter~0 6)} [135] L39-3-->L39-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] {9398#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:16,280 INFO L290 TraceCheckUtils]: 66: Hoare triple {9398#(<= ~counter~0 7)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {9398#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:16,281 INFO L272 TraceCheckUtils]: 67: Hoare triple {9398#(<= ~counter~0 7)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9398#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:16,281 INFO L290 TraceCheckUtils]: 68: Hoare triple {9398#(<= ~counter~0 7)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9398#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:16,295 INFO L290 TraceCheckUtils]: 69: Hoare triple {9398#(<= ~counter~0 7)} [128] L12-->L12-2: Formula: (not (= 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[] {9398#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:16,295 INFO L290 TraceCheckUtils]: 70: Hoare triple {9398#(<= ~counter~0 7)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9398#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:16,296 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9398#(<= ~counter~0 7)} {9398#(<= ~counter~0 7)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9398#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:16,296 INFO L290 TraceCheckUtils]: 72: Hoare triple {9398#(<= ~counter~0 7)} [141] L40-1-->L39-3: Formula: (and (< 0 v_main_~r~0_9) (= v_main_~r~0_8 (+ (* (- 1) v_main_~v~0_7) v_main_~r~0_9)) (= v_main_~v~0_6 (+ v_main_~v~0_7 2))) InVars {main_~v~0=v_main_~v~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~v~0=v_main_~v~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {9398#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:16,297 INFO L290 TraceCheckUtils]: 73: Hoare triple {9398#(<= ~counter~0 7)} [135] L39-3-->L39-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] {9423#(<= |main_#t~post7| 7)} is VALID [2022-04-15 03:07:16,297 INFO L290 TraceCheckUtils]: 74: Hoare triple {9423#(<= |main_#t~post7| 7)} [138] L39-1-->L47-2: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {9192#false} is VALID [2022-04-15 03:07:16,298 INFO L290 TraceCheckUtils]: 75: Hoare triple {9192#false} [137] L47-2-->L47: 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] {9192#false} is VALID [2022-04-15 03:07:16,298 INFO L290 TraceCheckUtils]: 76: Hoare triple {9192#false} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {9192#false} is VALID [2022-04-15 03:07:16,298 INFO L272 TraceCheckUtils]: 77: Hoare triple {9192#false} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9192#false} is VALID [2022-04-15 03:07:16,298 INFO L290 TraceCheckUtils]: 78: Hoare triple {9192#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9192#false} is VALID [2022-04-15 03:07:16,298 INFO L290 TraceCheckUtils]: 79: Hoare triple {9192#false} [128] L12-->L12-2: Formula: (not (= 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[] {9192#false} is VALID [2022-04-15 03:07:16,298 INFO L290 TraceCheckUtils]: 80: Hoare triple {9192#false} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9192#false} is VALID [2022-04-15 03:07:16,298 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9192#false} {9192#false} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9192#false} is VALID [2022-04-15 03:07:16,298 INFO L290 TraceCheckUtils]: 82: Hoare triple {9192#false} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {9192#false} is VALID [2022-04-15 03:07:16,298 INFO L290 TraceCheckUtils]: 83: Hoare triple {9192#false} [137] L47-2-->L47: 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] {9192#false} is VALID [2022-04-15 03:07:16,299 INFO L290 TraceCheckUtils]: 84: Hoare triple {9192#false} [144] L47-->L47-3: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {9192#false} is VALID [2022-04-15 03:07:16,299 INFO L290 TraceCheckUtils]: 85: Hoare triple {9192#false} [118] L47-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] {9192#false} is VALID [2022-04-15 03:07:16,299 INFO L290 TraceCheckUtils]: 86: Hoare triple {9192#false} [121] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {9192#false} is VALID [2022-04-15 03:07:16,299 INFO L272 TraceCheckUtils]: 87: Hoare triple {9192#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {9192#false} is VALID [2022-04-15 03:07:16,299 INFO L290 TraceCheckUtils]: 88: Hoare triple {9192#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9192#false} is VALID [2022-04-15 03:07:16,299 INFO L290 TraceCheckUtils]: 89: Hoare triple {9192#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {9192#false} is VALID [2022-04-15 03:07:16,299 INFO L290 TraceCheckUtils]: 90: Hoare triple {9192#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9192#false} is VALID [2022-04-15 03:07:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 58 proven. 110 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 03:07:16,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:07:16,786 INFO L290 TraceCheckUtils]: 90: Hoare triple {9192#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9192#false} is VALID [2022-04-15 03:07:16,786 INFO L290 TraceCheckUtils]: 89: Hoare triple {9192#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {9192#false} is VALID [2022-04-15 03:07:16,787 INFO L290 TraceCheckUtils]: 88: Hoare triple {9192#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9192#false} is VALID [2022-04-15 03:07:16,787 INFO L272 TraceCheckUtils]: 87: Hoare triple {9192#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {9192#false} is VALID [2022-04-15 03:07:16,787 INFO L290 TraceCheckUtils]: 86: Hoare triple {9192#false} [121] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {9192#false} is VALID [2022-04-15 03:07:16,787 INFO L290 TraceCheckUtils]: 85: Hoare triple {9192#false} [118] L47-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] {9192#false} is VALID [2022-04-15 03:07:16,787 INFO L290 TraceCheckUtils]: 84: Hoare triple {9192#false} [144] L47-->L47-3: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {9192#false} is VALID [2022-04-15 03:07:16,787 INFO L290 TraceCheckUtils]: 83: Hoare triple {9192#false} [137] L47-2-->L47: 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] {9192#false} is VALID [2022-04-15 03:07:16,787 INFO L290 TraceCheckUtils]: 82: Hoare triple {9192#false} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {9192#false} is VALID [2022-04-15 03:07:16,787 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9191#true} {9192#false} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9192#false} is VALID [2022-04-15 03:07:16,787 INFO L290 TraceCheckUtils]: 80: Hoare triple {9191#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9191#true} is VALID [2022-04-15 03:07:16,788 INFO L290 TraceCheckUtils]: 79: Hoare triple {9191#true} [128] L12-->L12-2: Formula: (not (= 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[] {9191#true} is VALID [2022-04-15 03:07:16,788 INFO L290 TraceCheckUtils]: 78: Hoare triple {9191#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9191#true} is VALID [2022-04-15 03:07:16,788 INFO L272 TraceCheckUtils]: 77: Hoare triple {9192#false} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9191#true} is VALID [2022-04-15 03:07:16,788 INFO L290 TraceCheckUtils]: 76: Hoare triple {9192#false} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {9192#false} is VALID [2022-04-15 03:07:16,788 INFO L290 TraceCheckUtils]: 75: Hoare triple {9192#false} [137] L47-2-->L47: 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] {9192#false} is VALID [2022-04-15 03:07:16,788 INFO L290 TraceCheckUtils]: 74: Hoare triple {9523#(< |main_#t~post7| 10)} [138] L39-1-->L47-2: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {9192#false} is VALID [2022-04-15 03:07:16,789 INFO L290 TraceCheckUtils]: 73: Hoare triple {9527#(< ~counter~0 10)} [135] L39-3-->L39-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] {9523#(< |main_#t~post7| 10)} is VALID [2022-04-15 03:07:16,789 INFO L290 TraceCheckUtils]: 72: Hoare triple {9527#(< ~counter~0 10)} [141] L40-1-->L39-3: Formula: (and (< 0 v_main_~r~0_9) (= v_main_~r~0_8 (+ (* (- 1) v_main_~v~0_7) v_main_~r~0_9)) (= v_main_~v~0_6 (+ v_main_~v~0_7 2))) InVars {main_~v~0=v_main_~v~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~v~0=v_main_~v~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {9527#(< ~counter~0 10)} is VALID [2022-04-15 03:07:16,790 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9191#true} {9527#(< ~counter~0 10)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9527#(< ~counter~0 10)} is VALID [2022-04-15 03:07:16,790 INFO L290 TraceCheckUtils]: 70: Hoare triple {9191#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9191#true} is VALID [2022-04-15 03:07:16,790 INFO L290 TraceCheckUtils]: 69: Hoare triple {9191#true} [128] L12-->L12-2: Formula: (not (= 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[] {9191#true} is VALID [2022-04-15 03:07:16,790 INFO L290 TraceCheckUtils]: 68: Hoare triple {9191#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9191#true} is VALID [2022-04-15 03:07:16,790 INFO L272 TraceCheckUtils]: 67: Hoare triple {9527#(< ~counter~0 10)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9191#true} is VALID [2022-04-15 03:07:16,791 INFO L290 TraceCheckUtils]: 66: Hoare triple {9527#(< ~counter~0 10)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {9527#(< ~counter~0 10)} is VALID [2022-04-15 03:07:16,791 INFO L290 TraceCheckUtils]: 65: Hoare triple {9552#(< ~counter~0 9)} [135] L39-3-->L39-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] {9527#(< ~counter~0 10)} is VALID [2022-04-15 03:07:16,792 INFO L290 TraceCheckUtils]: 64: Hoare triple {9552#(< ~counter~0 9)} [141] L40-1-->L39-3: Formula: (and (< 0 v_main_~r~0_9) (= v_main_~r~0_8 (+ (* (- 1) v_main_~v~0_7) v_main_~r~0_9)) (= v_main_~v~0_6 (+ v_main_~v~0_7 2))) InVars {main_~v~0=v_main_~v~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~v~0=v_main_~v~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {9552#(< ~counter~0 9)} is VALID [2022-04-15 03:07:16,793 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {9191#true} {9552#(< ~counter~0 9)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9552#(< ~counter~0 9)} is VALID [2022-04-15 03:07:16,793 INFO L290 TraceCheckUtils]: 62: Hoare triple {9191#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9191#true} is VALID [2022-04-15 03:07:16,793 INFO L290 TraceCheckUtils]: 61: Hoare triple {9191#true} [128] L12-->L12-2: Formula: (not (= 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[] {9191#true} is VALID [2022-04-15 03:07:16,793 INFO L290 TraceCheckUtils]: 60: Hoare triple {9191#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9191#true} is VALID [2022-04-15 03:07:16,793 INFO L272 TraceCheckUtils]: 59: Hoare triple {9552#(< ~counter~0 9)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9191#true} is VALID [2022-04-15 03:07:16,793 INFO L290 TraceCheckUtils]: 58: Hoare triple {9552#(< ~counter~0 9)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {9552#(< ~counter~0 9)} is VALID [2022-04-15 03:07:16,794 INFO L290 TraceCheckUtils]: 57: Hoare triple {9398#(<= ~counter~0 7)} [135] L39-3-->L39-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] {9552#(< ~counter~0 9)} is VALID [2022-04-15 03:07:16,794 INFO L290 TraceCheckUtils]: 56: Hoare triple {9398#(<= ~counter~0 7)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {9398#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:16,795 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9191#true} {9398#(<= ~counter~0 7)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9398#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:16,795 INFO L290 TraceCheckUtils]: 54: Hoare triple {9191#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9191#true} is VALID [2022-04-15 03:07:16,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {9191#true} [128] L12-->L12-2: Formula: (not (= 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[] {9191#true} is VALID [2022-04-15 03:07:16,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {9191#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9191#true} is VALID [2022-04-15 03:07:16,796 INFO L272 TraceCheckUtils]: 51: Hoare triple {9398#(<= ~counter~0 7)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9191#true} is VALID [2022-04-15 03:07:16,796 INFO L290 TraceCheckUtils]: 50: Hoare triple {9398#(<= ~counter~0 7)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {9398#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:16,797 INFO L290 TraceCheckUtils]: 49: Hoare triple {9373#(<= ~counter~0 6)} [118] L47-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] {9398#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:16,797 INFO L290 TraceCheckUtils]: 48: Hoare triple {9373#(<= ~counter~0 6)} [142] L48-1-->L47-3: Formula: (not (< v_main_~r~0_11 0)) InVars {main_~r~0=v_main_~r~0_11} OutVars{main_~r~0=v_main_~r~0_11} AuxVars[] AssignedVars[] {9373#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:16,798 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9191#true} {9373#(<= ~counter~0 6)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9373#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:16,798 INFO L290 TraceCheckUtils]: 46: Hoare triple {9191#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9191#true} is VALID [2022-04-15 03:07:16,798 INFO L290 TraceCheckUtils]: 45: Hoare triple {9191#true} [128] L12-->L12-2: Formula: (not (= 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[] {9191#true} is VALID [2022-04-15 03:07:16,798 INFO L290 TraceCheckUtils]: 44: Hoare triple {9191#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9191#true} is VALID [2022-04-15 03:07:16,798 INFO L272 TraceCheckUtils]: 43: Hoare triple {9373#(<= ~counter~0 6)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9191#true} is VALID [2022-04-15 03:07:16,799 INFO L290 TraceCheckUtils]: 42: Hoare triple {9373#(<= ~counter~0 6)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {9373#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:16,799 INFO L290 TraceCheckUtils]: 41: Hoare triple {9348#(<= ~counter~0 5)} [137] L47-2-->L47: 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] {9373#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:16,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {9348#(<= ~counter~0 5)} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {9348#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:16,801 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9191#true} {9348#(<= ~counter~0 5)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9348#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:16,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {9191#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9191#true} is VALID [2022-04-15 03:07:16,801 INFO L290 TraceCheckUtils]: 37: Hoare triple {9191#true} [128] L12-->L12-2: Formula: (not (= 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[] {9191#true} is VALID [2022-04-15 03:07:16,801 INFO L290 TraceCheckUtils]: 36: Hoare triple {9191#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9191#true} is VALID [2022-04-15 03:07:16,801 INFO L272 TraceCheckUtils]: 35: Hoare triple {9348#(<= ~counter~0 5)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9191#true} is VALID [2022-04-15 03:07:16,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {9348#(<= ~counter~0 5)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {9348#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:16,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {9323#(<= ~counter~0 4)} [137] L47-2-->L47: 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] {9348#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:16,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {9323#(<= ~counter~0 4)} [140] L40-1-->L47-2: Formula: (not (< 0 v_main_~r~0_7)) InVars {main_~r~0=v_main_~r~0_7} OutVars{main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[] {9323#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:16,803 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9191#true} {9323#(<= ~counter~0 4)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9323#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:16,803 INFO L290 TraceCheckUtils]: 30: Hoare triple {9191#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9191#true} is VALID [2022-04-15 03:07:16,803 INFO L290 TraceCheckUtils]: 29: Hoare triple {9191#true} [128] L12-->L12-2: Formula: (not (= 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[] {9191#true} is VALID [2022-04-15 03:07:16,803 INFO L290 TraceCheckUtils]: 28: Hoare triple {9191#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9191#true} is VALID [2022-04-15 03:07:16,803 INFO L272 TraceCheckUtils]: 27: Hoare triple {9323#(<= ~counter~0 4)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9191#true} is VALID [2022-04-15 03:07:16,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {9323#(<= ~counter~0 4)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {9323#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:16,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {9298#(<= ~counter~0 3)} [135] L39-3-->L39-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] {9323#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:16,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {9298#(<= ~counter~0 3)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {9298#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:16,805 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9191#true} {9298#(<= ~counter~0 3)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9298#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:16,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {9191#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9191#true} is VALID [2022-04-15 03:07:16,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {9191#true} [128] L12-->L12-2: Formula: (not (= 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[] {9191#true} is VALID [2022-04-15 03:07:16,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {9191#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9191#true} is VALID [2022-04-15 03:07:16,805 INFO L272 TraceCheckUtils]: 19: Hoare triple {9298#(<= ~counter~0 3)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {9191#true} is VALID [2022-04-15 03:07:16,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {9298#(<= ~counter~0 3)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {9298#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:16,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {9273#(<= ~counter~0 2)} [118] L47-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] {9298#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:16,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {9273#(<= ~counter~0 2)} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {9273#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:16,807 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9191#true} {9273#(<= ~counter~0 2)} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {9273#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:16,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {9191#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9191#true} is VALID [2022-04-15 03:07:16,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {9191#true} [116] L9-->L9-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[] {9191#true} is VALID [2022-04-15 03:07:16,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {9191#true} [113] assume_abort_if_notENTRY-->L9: 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] {9191#true} is VALID [2022-04-15 03:07:16,807 INFO L272 TraceCheckUtils]: 11: Hoare triple {9273#(<= ~counter~0 2)} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {9191#true} is VALID [2022-04-15 03:07:16,808 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9191#true} {9273#(<= ~counter~0 2)} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {9273#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:16,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {9191#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9191#true} is VALID [2022-04-15 03:07:16,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {9191#true} [116] L9-->L9-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[] {9191#true} is VALID [2022-04-15 03:07:16,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {9191#true} [113] assume_abort_if_notENTRY-->L9: 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] {9191#true} is VALID [2022-04-15 03:07:16,808 INFO L272 TraceCheckUtils]: 6: Hoare triple {9273#(<= ~counter~0 2)} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {9191#true} is VALID [2022-04-15 03:07:16,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {9273#(<= ~counter~0 2)} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {9273#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:16,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {9273#(<= ~counter~0 2)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9273#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:16,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9273#(<= ~counter~0 2)} {9191#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9273#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:16,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {9273#(<= ~counter~0 2)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9273#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:16,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {9191#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {9273#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:16,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {9191#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9191#true} is VALID [2022-04-15 03:07:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-04-15 03:07:16,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:07:16,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469301976] [2022-04-15 03:07:16,810 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:07:16,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998352115] [2022-04-15 03:07:16,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998352115] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 03:07:16,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 03:07:16,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-15 03:07:16,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661970260] [2022-04-15 03:07:16,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 03:07:16,812 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 12 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) Word has length 91 [2022-04-15 03:07:16,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:07:16,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 12 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) [2022-04-15 03:07:16,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:16,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 03:07:16,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:07:16,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 03:07:16,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 03:07:16,921 INFO L87 Difference]: Start difference. First operand 346 states and 472 transitions. Second operand has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 12 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) [2022-04-15 03:07:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:17,876 INFO L93 Difference]: Finished difference Result 475 states and 653 transitions. [2022-04-15 03:07:17,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 03:07:17,877 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 12 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) Word has length 91 [2022-04-15 03:07:17,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:07:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 12 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) [2022-04-15 03:07:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 221 transitions. [2022-04-15 03:07:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 12 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) [2022-04-15 03:07:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 221 transitions. [2022-04-15 03:07:17,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 221 transitions. [2022-04-15 03:07:18,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:18,074 INFO L225 Difference]: With dead ends: 475 [2022-04-15 03:07:18,074 INFO L226 Difference]: Without dead ends: 356 [2022-04-15 03:07:18,075 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=166, Invalid=296, Unknown=0, NotChecked=0, Total=462 [2022-04-15 03:07:18,076 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 168 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 03:07:18,076 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 282 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 03:07:18,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-04-15 03:07:18,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 352. [2022-04-15 03:07:18,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:07:18,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 356 states. Second operand has 352 states, 266 states have (on average 1.2218045112781954) internal successors, (325), 266 states have internal predecessors, (325), 72 states have call successors, (72), 15 states have call predecessors, (72), 13 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2022-04-15 03:07:18,314 INFO L74 IsIncluded]: Start isIncluded. First operand 356 states. Second operand has 352 states, 266 states have (on average 1.2218045112781954) internal successors, (325), 266 states have internal predecessors, (325), 72 states have call successors, (72), 15 states have call predecessors, (72), 13 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2022-04-15 03:07:18,315 INFO L87 Difference]: Start difference. First operand 356 states. Second operand has 352 states, 266 states have (on average 1.2218045112781954) internal successors, (325), 266 states have internal predecessors, (325), 72 states have call successors, (72), 15 states have call predecessors, (72), 13 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2022-04-15 03:07:18,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:18,326 INFO L93 Difference]: Finished difference Result 356 states and 471 transitions. [2022-04-15 03:07:18,326 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 471 transitions. [2022-04-15 03:07:18,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:18,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:18,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 352 states, 266 states have (on average 1.2218045112781954) internal successors, (325), 266 states have internal predecessors, (325), 72 states have call successors, (72), 15 states have call predecessors, (72), 13 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) Second operand 356 states. [2022-04-15 03:07:18,328 INFO L87 Difference]: Start difference. First operand has 352 states, 266 states have (on average 1.2218045112781954) internal successors, (325), 266 states have internal predecessors, (325), 72 states have call successors, (72), 15 states have call predecessors, (72), 13 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) Second operand 356 states. [2022-04-15 03:07:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:18,338 INFO L93 Difference]: Finished difference Result 356 states and 471 transitions. [2022-04-15 03:07:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 471 transitions. [2022-04-15 03:07:18,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:18,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:18,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:07:18,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:07:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 266 states have (on average 1.2218045112781954) internal successors, (325), 266 states have internal predecessors, (325), 72 states have call successors, (72), 15 states have call predecessors, (72), 13 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2022-04-15 03:07:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 467 transitions. [2022-04-15 03:07:18,352 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 467 transitions. Word has length 91 [2022-04-15 03:07:18,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:07:18,352 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 467 transitions. [2022-04-15 03:07:18,353 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 12 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) [2022-04-15 03:07:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 467 transitions. [2022-04-15 03:07:18,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 03:07:18,357 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:07:18,357 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:07:18,384 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-15 03:07:18,581 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 03:07:18,581 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:07:18,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:07:18,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1282125772, now seen corresponding path program 1 times [2022-04-15 03:07:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:07:18,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769578474] [2022-04-15 03:07:18,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:07:18,597 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:07:18,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [367211831] [2022-04-15 03:07:18,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:18,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:18,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:07:18,599 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-15 03:07:18,612 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-15 03:07:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:18,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 03:07:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:07:18,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:07:19,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {11635#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11635#true} is VALID [2022-04-15 03:07:19,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {11635#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {11643#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11643#(<= ~counter~0 0)} {11635#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {11643#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {11643#(<= ~counter~0 0)} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,328 INFO L272 TraceCheckUtils]: 6: Hoare triple {11643#(<= ~counter~0 0)} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {11643#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: 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] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {11643#(<= ~counter~0 0)} [116] L9-->L9-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[] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {11643#(<= ~counter~0 0)} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,331 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11643#(<= ~counter~0 0)} {11643#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,332 INFO L272 TraceCheckUtils]: 11: Hoare triple {11643#(<= ~counter~0 0)} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {11643#(<= ~counter~0 0)} [113] assume_abort_if_notENTRY-->L9: 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] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {11643#(<= ~counter~0 0)} [116] L9-->L9-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[] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {11643#(<= ~counter~0 0)} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,333 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11643#(<= ~counter~0 0)} {11643#(<= ~counter~0 0)} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {11643#(<= ~counter~0 0)} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {11643#(<= ~counter~0 0)} [118] L47-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] {11692#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:19,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {11692#(<= ~counter~0 1)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {11692#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:19,335 INFO L272 TraceCheckUtils]: 19: Hoare triple {11692#(<= ~counter~0 1)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11692#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:19,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {11692#(<= ~counter~0 1)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11692#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:19,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {11692#(<= ~counter~0 1)} [128] L12-->L12-2: Formula: (not (= 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[] {11692#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:19,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {11692#(<= ~counter~0 1)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11692#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:19,336 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11692#(<= ~counter~0 1)} {11692#(<= ~counter~0 1)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11692#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:19,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {11692#(<= ~counter~0 1)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {11692#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:19,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {11692#(<= ~counter~0 1)} [135] L39-3-->L39-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] {11717#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:19,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {11717#(<= ~counter~0 2)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {11717#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:19,338 INFO L272 TraceCheckUtils]: 27: Hoare triple {11717#(<= ~counter~0 2)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11717#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:19,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {11717#(<= ~counter~0 2)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11717#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:19,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {11717#(<= ~counter~0 2)} [128] L12-->L12-2: Formula: (not (= 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[] {11717#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:19,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {11717#(<= ~counter~0 2)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11717#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:19,339 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11717#(<= ~counter~0 2)} {11717#(<= ~counter~0 2)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11717#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:19,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {11717#(<= ~counter~0 2)} [140] L40-1-->L47-2: Formula: (not (< 0 v_main_~r~0_7)) InVars {main_~r~0=v_main_~r~0_7} OutVars{main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[] {11717#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:19,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {11717#(<= ~counter~0 2)} [137] L47-2-->L47: 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] {11742#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:19,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {11742#(<= ~counter~0 3)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {11742#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:19,341 INFO L272 TraceCheckUtils]: 35: Hoare triple {11742#(<= ~counter~0 3)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11742#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:19,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {11742#(<= ~counter~0 3)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11742#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:19,341 INFO L290 TraceCheckUtils]: 37: Hoare triple {11742#(<= ~counter~0 3)} [128] L12-->L12-2: Formula: (not (= 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[] {11742#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:19,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {11742#(<= ~counter~0 3)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11742#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:19,342 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11742#(<= ~counter~0 3)} {11742#(<= ~counter~0 3)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11742#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:19,342 INFO L290 TraceCheckUtils]: 40: Hoare triple {11742#(<= ~counter~0 3)} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {11742#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:19,343 INFO L290 TraceCheckUtils]: 41: Hoare triple {11742#(<= ~counter~0 3)} [137] L47-2-->L47: 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] {11767#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:19,343 INFO L290 TraceCheckUtils]: 42: Hoare triple {11767#(<= ~counter~0 4)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {11767#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:19,344 INFO L272 TraceCheckUtils]: 43: Hoare triple {11767#(<= ~counter~0 4)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11767#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:19,344 INFO L290 TraceCheckUtils]: 44: Hoare triple {11767#(<= ~counter~0 4)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11767#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:19,344 INFO L290 TraceCheckUtils]: 45: Hoare triple {11767#(<= ~counter~0 4)} [128] L12-->L12-2: Formula: (not (= 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[] {11767#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:19,345 INFO L290 TraceCheckUtils]: 46: Hoare triple {11767#(<= ~counter~0 4)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11767#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:19,345 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11767#(<= ~counter~0 4)} {11767#(<= ~counter~0 4)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11767#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:19,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {11767#(<= ~counter~0 4)} [142] L48-1-->L47-3: Formula: (not (< v_main_~r~0_11 0)) InVars {main_~r~0=v_main_~r~0_11} OutVars{main_~r~0=v_main_~r~0_11} AuxVars[] AssignedVars[] {11767#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:19,346 INFO L290 TraceCheckUtils]: 49: Hoare triple {11767#(<= ~counter~0 4)} [118] L47-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] {11792#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:19,346 INFO L290 TraceCheckUtils]: 50: Hoare triple {11792#(<= ~counter~0 5)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {11792#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:19,347 INFO L272 TraceCheckUtils]: 51: Hoare triple {11792#(<= ~counter~0 5)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11792#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:19,347 INFO L290 TraceCheckUtils]: 52: Hoare triple {11792#(<= ~counter~0 5)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11792#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:19,348 INFO L290 TraceCheckUtils]: 53: Hoare triple {11792#(<= ~counter~0 5)} [128] L12-->L12-2: Formula: (not (= 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[] {11792#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:19,348 INFO L290 TraceCheckUtils]: 54: Hoare triple {11792#(<= ~counter~0 5)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11792#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:19,348 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11792#(<= ~counter~0 5)} {11792#(<= ~counter~0 5)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11792#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:19,349 INFO L290 TraceCheckUtils]: 56: Hoare triple {11792#(<= ~counter~0 5)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {11792#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:19,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {11792#(<= ~counter~0 5)} [135] L39-3-->L39-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] {11817#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:19,350 INFO L290 TraceCheckUtils]: 58: Hoare triple {11817#(<= ~counter~0 6)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {11817#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:19,350 INFO L272 TraceCheckUtils]: 59: Hoare triple {11817#(<= ~counter~0 6)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11817#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:19,350 INFO L290 TraceCheckUtils]: 60: Hoare triple {11817#(<= ~counter~0 6)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11817#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:19,351 INFO L290 TraceCheckUtils]: 61: Hoare triple {11817#(<= ~counter~0 6)} [128] L12-->L12-2: Formula: (not (= 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[] {11817#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:19,351 INFO L290 TraceCheckUtils]: 62: Hoare triple {11817#(<= ~counter~0 6)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11817#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:19,352 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11817#(<= ~counter~0 6)} {11817#(<= ~counter~0 6)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11817#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:19,352 INFO L290 TraceCheckUtils]: 64: Hoare triple {11817#(<= ~counter~0 6)} [141] L40-1-->L39-3: Formula: (and (< 0 v_main_~r~0_9) (= v_main_~r~0_8 (+ (* (- 1) v_main_~v~0_7) v_main_~r~0_9)) (= v_main_~v~0_6 (+ v_main_~v~0_7 2))) InVars {main_~v~0=v_main_~v~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~v~0=v_main_~v~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {11817#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:19,352 INFO L290 TraceCheckUtils]: 65: Hoare triple {11817#(<= ~counter~0 6)} [135] L39-3-->L39-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] {11842#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:19,353 INFO L290 TraceCheckUtils]: 66: Hoare triple {11842#(<= ~counter~0 7)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {11842#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:19,353 INFO L272 TraceCheckUtils]: 67: Hoare triple {11842#(<= ~counter~0 7)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11842#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:19,353 INFO L290 TraceCheckUtils]: 68: Hoare triple {11842#(<= ~counter~0 7)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11842#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:19,354 INFO L290 TraceCheckUtils]: 69: Hoare triple {11842#(<= ~counter~0 7)} [128] L12-->L12-2: Formula: (not (= 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[] {11842#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:19,354 INFO L290 TraceCheckUtils]: 70: Hoare triple {11842#(<= ~counter~0 7)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11842#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:19,354 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11842#(<= ~counter~0 7)} {11842#(<= ~counter~0 7)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11842#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:19,355 INFO L290 TraceCheckUtils]: 72: Hoare triple {11842#(<= ~counter~0 7)} [141] L40-1-->L39-3: Formula: (and (< 0 v_main_~r~0_9) (= v_main_~r~0_8 (+ (* (- 1) v_main_~v~0_7) v_main_~r~0_9)) (= v_main_~v~0_6 (+ v_main_~v~0_7 2))) InVars {main_~v~0=v_main_~v~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~v~0=v_main_~v~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {11842#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:19,355 INFO L290 TraceCheckUtils]: 73: Hoare triple {11842#(<= ~counter~0 7)} [135] L39-3-->L39-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] {11867#(<= ~counter~0 8)} is VALID [2022-04-15 03:07:19,356 INFO L290 TraceCheckUtils]: 74: Hoare triple {11867#(<= ~counter~0 8)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {11867#(<= ~counter~0 8)} is VALID [2022-04-15 03:07:19,356 INFO L272 TraceCheckUtils]: 75: Hoare triple {11867#(<= ~counter~0 8)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11867#(<= ~counter~0 8)} is VALID [2022-04-15 03:07:19,356 INFO L290 TraceCheckUtils]: 76: Hoare triple {11867#(<= ~counter~0 8)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11867#(<= ~counter~0 8)} is VALID [2022-04-15 03:07:19,357 INFO L290 TraceCheckUtils]: 77: Hoare triple {11867#(<= ~counter~0 8)} [128] L12-->L12-2: Formula: (not (= 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[] {11867#(<= ~counter~0 8)} is VALID [2022-04-15 03:07:19,357 INFO L290 TraceCheckUtils]: 78: Hoare triple {11867#(<= ~counter~0 8)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11867#(<= ~counter~0 8)} is VALID [2022-04-15 03:07:19,358 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {11867#(<= ~counter~0 8)} {11867#(<= ~counter~0 8)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11867#(<= ~counter~0 8)} is VALID [2022-04-15 03:07:19,358 INFO L290 TraceCheckUtils]: 80: Hoare triple {11867#(<= ~counter~0 8)} [140] L40-1-->L47-2: Formula: (not (< 0 v_main_~r~0_7)) InVars {main_~r~0=v_main_~r~0_7} OutVars{main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[] {11867#(<= ~counter~0 8)} is VALID [2022-04-15 03:07:19,358 INFO L290 TraceCheckUtils]: 81: Hoare triple {11867#(<= ~counter~0 8)} [137] L47-2-->L47: 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] {11892#(<= ~counter~0 9)} is VALID [2022-04-15 03:07:19,359 INFO L290 TraceCheckUtils]: 82: Hoare triple {11892#(<= ~counter~0 9)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {11892#(<= ~counter~0 9)} is VALID [2022-04-15 03:07:19,359 INFO L272 TraceCheckUtils]: 83: Hoare triple {11892#(<= ~counter~0 9)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11892#(<= ~counter~0 9)} is VALID [2022-04-15 03:07:19,359 INFO L290 TraceCheckUtils]: 84: Hoare triple {11892#(<= ~counter~0 9)} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11892#(<= ~counter~0 9)} is VALID [2022-04-15 03:07:19,360 INFO L290 TraceCheckUtils]: 85: Hoare triple {11892#(<= ~counter~0 9)} [128] L12-->L12-2: Formula: (not (= 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[] {11892#(<= ~counter~0 9)} is VALID [2022-04-15 03:07:19,360 INFO L290 TraceCheckUtils]: 86: Hoare triple {11892#(<= ~counter~0 9)} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11892#(<= ~counter~0 9)} is VALID [2022-04-15 03:07:19,361 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {11892#(<= ~counter~0 9)} {11892#(<= ~counter~0 9)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11892#(<= ~counter~0 9)} is VALID [2022-04-15 03:07:19,361 INFO L290 TraceCheckUtils]: 88: Hoare triple {11892#(<= ~counter~0 9)} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {11892#(<= ~counter~0 9)} is VALID [2022-04-15 03:07:19,361 INFO L290 TraceCheckUtils]: 89: Hoare triple {11892#(<= ~counter~0 9)} [137] L47-2-->L47: 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] {11917#(<= |main_#t~post8| 9)} is VALID [2022-04-15 03:07:19,362 INFO L290 TraceCheckUtils]: 90: Hoare triple {11917#(<= |main_#t~post8| 9)} [144] L47-->L47-3: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {11636#false} is VALID [2022-04-15 03:07:19,362 INFO L290 TraceCheckUtils]: 91: Hoare triple {11636#false} [118] L47-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] {11636#false} is VALID [2022-04-15 03:07:19,362 INFO L290 TraceCheckUtils]: 92: Hoare triple {11636#false} [121] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {11636#false} is VALID [2022-04-15 03:07:19,362 INFO L272 TraceCheckUtils]: 93: Hoare triple {11636#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {11636#false} is VALID [2022-04-15 03:07:19,362 INFO L290 TraceCheckUtils]: 94: Hoare triple {11636#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11636#false} is VALID [2022-04-15 03:07:19,362 INFO L290 TraceCheckUtils]: 95: Hoare triple {11636#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {11636#false} is VALID [2022-04-15 03:07:19,362 INFO L290 TraceCheckUtils]: 96: Hoare triple {11636#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11636#false} is VALID [2022-04-15 03:07:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 03:07:19,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:07:19,856 INFO L290 TraceCheckUtils]: 96: Hoare triple {11636#false} [131] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11636#false} is VALID [2022-04-15 03:07:19,857 INFO L290 TraceCheckUtils]: 95: Hoare triple {11636#false} [127] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {11636#false} is VALID [2022-04-15 03:07:19,857 INFO L290 TraceCheckUtils]: 94: Hoare triple {11636#false} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11636#false} is VALID [2022-04-15 03:07:19,857 INFO L272 TraceCheckUtils]: 93: Hoare triple {11636#false} [120] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_12 (- 2)) (* v_main_~v~0_12 2) (* v_main_~u~0_12 v_main_~u~0_12) (* (- 1) (* v_main_~v~0_12 v_main_~v~0_12))) (* v_main_~A~0_16 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~v~0=v_main_~v~0_12, main_~A~0=v_main_~A~0_16, main_~u~0=v_main_~u~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {11636#false} is VALID [2022-04-15 03:07:19,857 INFO L290 TraceCheckUtils]: 92: Hoare triple {11636#false} [121] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {11636#false} is VALID [2022-04-15 03:07:19,857 INFO L290 TraceCheckUtils]: 91: Hoare triple {11636#false} [118] L47-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] {11636#false} is VALID [2022-04-15 03:07:19,857 INFO L290 TraceCheckUtils]: 90: Hoare triple {11917#(<= |main_#t~post8| 9)} [144] L47-->L47-3: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {11636#false} is VALID [2022-04-15 03:07:19,858 INFO L290 TraceCheckUtils]: 89: Hoare triple {11892#(<= ~counter~0 9)} [137] L47-2-->L47: 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] {11917#(<= |main_#t~post8| 9)} is VALID [2022-04-15 03:07:19,858 INFO L290 TraceCheckUtils]: 88: Hoare triple {11892#(<= ~counter~0 9)} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {11892#(<= ~counter~0 9)} is VALID [2022-04-15 03:07:19,859 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {11635#true} {11892#(<= ~counter~0 9)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11892#(<= ~counter~0 9)} is VALID [2022-04-15 03:07:19,859 INFO L290 TraceCheckUtils]: 86: Hoare triple {11635#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11635#true} is VALID [2022-04-15 03:07:19,859 INFO L290 TraceCheckUtils]: 85: Hoare triple {11635#true} [128] L12-->L12-2: Formula: (not (= 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[] {11635#true} is VALID [2022-04-15 03:07:19,859 INFO L290 TraceCheckUtils]: 84: Hoare triple {11635#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11635#true} is VALID [2022-04-15 03:07:19,859 INFO L272 TraceCheckUtils]: 83: Hoare triple {11892#(<= ~counter~0 9)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11635#true} is VALID [2022-04-15 03:07:19,859 INFO L290 TraceCheckUtils]: 82: Hoare triple {11892#(<= ~counter~0 9)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {11892#(<= ~counter~0 9)} is VALID [2022-04-15 03:07:19,860 INFO L290 TraceCheckUtils]: 81: Hoare triple {11867#(<= ~counter~0 8)} [137] L47-2-->L47: 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] {11892#(<= ~counter~0 9)} is VALID [2022-04-15 03:07:19,863 INFO L290 TraceCheckUtils]: 80: Hoare triple {11867#(<= ~counter~0 8)} [140] L40-1-->L47-2: Formula: (not (< 0 v_main_~r~0_7)) InVars {main_~r~0=v_main_~r~0_7} OutVars{main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[] {11867#(<= ~counter~0 8)} is VALID [2022-04-15 03:07:19,864 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {11635#true} {11867#(<= ~counter~0 8)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11867#(<= ~counter~0 8)} is VALID [2022-04-15 03:07:19,864 INFO L290 TraceCheckUtils]: 78: Hoare triple {11635#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11635#true} is VALID [2022-04-15 03:07:19,864 INFO L290 TraceCheckUtils]: 77: Hoare triple {11635#true} [128] L12-->L12-2: Formula: (not (= 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[] {11635#true} is VALID [2022-04-15 03:07:19,864 INFO L290 TraceCheckUtils]: 76: Hoare triple {11635#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11635#true} is VALID [2022-04-15 03:07:19,864 INFO L272 TraceCheckUtils]: 75: Hoare triple {11867#(<= ~counter~0 8)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11635#true} is VALID [2022-04-15 03:07:19,865 INFO L290 TraceCheckUtils]: 74: Hoare triple {11867#(<= ~counter~0 8)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {11867#(<= ~counter~0 8)} is VALID [2022-04-15 03:07:19,865 INFO L290 TraceCheckUtils]: 73: Hoare triple {11842#(<= ~counter~0 7)} [135] L39-3-->L39-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] {11867#(<= ~counter~0 8)} is VALID [2022-04-15 03:07:19,866 INFO L290 TraceCheckUtils]: 72: Hoare triple {11842#(<= ~counter~0 7)} [141] L40-1-->L39-3: Formula: (and (< 0 v_main_~r~0_9) (= v_main_~r~0_8 (+ (* (- 1) v_main_~v~0_7) v_main_~r~0_9)) (= v_main_~v~0_6 (+ v_main_~v~0_7 2))) InVars {main_~v~0=v_main_~v~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~v~0=v_main_~v~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {11842#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:19,867 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11635#true} {11842#(<= ~counter~0 7)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11842#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:19,867 INFO L290 TraceCheckUtils]: 70: Hoare triple {11635#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11635#true} is VALID [2022-04-15 03:07:19,867 INFO L290 TraceCheckUtils]: 69: Hoare triple {11635#true} [128] L12-->L12-2: Formula: (not (= 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[] {11635#true} is VALID [2022-04-15 03:07:19,867 INFO L290 TraceCheckUtils]: 68: Hoare triple {11635#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11635#true} is VALID [2022-04-15 03:07:19,867 INFO L272 TraceCheckUtils]: 67: Hoare triple {11842#(<= ~counter~0 7)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11635#true} is VALID [2022-04-15 03:07:19,867 INFO L290 TraceCheckUtils]: 66: Hoare triple {11842#(<= ~counter~0 7)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {11842#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:19,868 INFO L290 TraceCheckUtils]: 65: Hoare triple {11817#(<= ~counter~0 6)} [135] L39-3-->L39-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] {11842#(<= ~counter~0 7)} is VALID [2022-04-15 03:07:19,868 INFO L290 TraceCheckUtils]: 64: Hoare triple {11817#(<= ~counter~0 6)} [141] L40-1-->L39-3: Formula: (and (< 0 v_main_~r~0_9) (= v_main_~r~0_8 (+ (* (- 1) v_main_~v~0_7) v_main_~r~0_9)) (= v_main_~v~0_6 (+ v_main_~v~0_7 2))) InVars {main_~v~0=v_main_~v~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~v~0=v_main_~v~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {11817#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:19,869 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11635#true} {11817#(<= ~counter~0 6)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11817#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:19,869 INFO L290 TraceCheckUtils]: 62: Hoare triple {11635#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11635#true} is VALID [2022-04-15 03:07:19,869 INFO L290 TraceCheckUtils]: 61: Hoare triple {11635#true} [128] L12-->L12-2: Formula: (not (= 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[] {11635#true} is VALID [2022-04-15 03:07:19,869 INFO L290 TraceCheckUtils]: 60: Hoare triple {11635#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11635#true} is VALID [2022-04-15 03:07:19,870 INFO L272 TraceCheckUtils]: 59: Hoare triple {11817#(<= ~counter~0 6)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11635#true} is VALID [2022-04-15 03:07:19,870 INFO L290 TraceCheckUtils]: 58: Hoare triple {11817#(<= ~counter~0 6)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {11817#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:19,871 INFO L290 TraceCheckUtils]: 57: Hoare triple {11792#(<= ~counter~0 5)} [135] L39-3-->L39-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] {11817#(<= ~counter~0 6)} is VALID [2022-04-15 03:07:19,871 INFO L290 TraceCheckUtils]: 56: Hoare triple {11792#(<= ~counter~0 5)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {11792#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:19,872 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11635#true} {11792#(<= ~counter~0 5)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11792#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:19,872 INFO L290 TraceCheckUtils]: 54: Hoare triple {11635#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11635#true} is VALID [2022-04-15 03:07:19,872 INFO L290 TraceCheckUtils]: 53: Hoare triple {11635#true} [128] L12-->L12-2: Formula: (not (= 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[] {11635#true} is VALID [2022-04-15 03:07:19,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {11635#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11635#true} is VALID [2022-04-15 03:07:19,872 INFO L272 TraceCheckUtils]: 51: Hoare triple {11792#(<= ~counter~0 5)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11635#true} is VALID [2022-04-15 03:07:19,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {11792#(<= ~counter~0 5)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {11792#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:19,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {11767#(<= ~counter~0 4)} [118] L47-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] {11792#(<= ~counter~0 5)} is VALID [2022-04-15 03:07:19,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {11767#(<= ~counter~0 4)} [142] L48-1-->L47-3: Formula: (not (< v_main_~r~0_11 0)) InVars {main_~r~0=v_main_~r~0_11} OutVars{main_~r~0=v_main_~r~0_11} AuxVars[] AssignedVars[] {11767#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:19,874 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11635#true} {11767#(<= ~counter~0 4)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11767#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:19,874 INFO L290 TraceCheckUtils]: 46: Hoare triple {11635#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11635#true} is VALID [2022-04-15 03:07:19,874 INFO L290 TraceCheckUtils]: 45: Hoare triple {11635#true} [128] L12-->L12-2: Formula: (not (= 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[] {11635#true} is VALID [2022-04-15 03:07:19,875 INFO L290 TraceCheckUtils]: 44: Hoare triple {11635#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11635#true} is VALID [2022-04-15 03:07:19,875 INFO L272 TraceCheckUtils]: 43: Hoare triple {11767#(<= ~counter~0 4)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11635#true} is VALID [2022-04-15 03:07:19,875 INFO L290 TraceCheckUtils]: 42: Hoare triple {11767#(<= ~counter~0 4)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {11767#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:19,876 INFO L290 TraceCheckUtils]: 41: Hoare triple {11742#(<= ~counter~0 3)} [137] L47-2-->L47: 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] {11767#(<= ~counter~0 4)} is VALID [2022-04-15 03:07:19,876 INFO L290 TraceCheckUtils]: 40: Hoare triple {11742#(<= ~counter~0 3)} [143] L48-1-->L47-2: Formula: (and (< v_main_~r~0_13 0) (= v_main_~r~0_12 (+ v_main_~r~0_13 v_main_~u~0_8)) (= v_main_~u~0_7 (+ v_main_~u~0_8 2))) InVars {main_~u~0=v_main_~u~0_8, main_~r~0=v_main_~r~0_13} OutVars{main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_12} AuxVars[] AssignedVars[main_~u~0, main_~r~0] {11742#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:19,877 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11635#true} {11742#(<= ~counter~0 3)} [154] __VERIFIER_assertEXIT-->L48-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11742#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:19,877 INFO L290 TraceCheckUtils]: 38: Hoare triple {11635#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11635#true} is VALID [2022-04-15 03:07:19,877 INFO L290 TraceCheckUtils]: 37: Hoare triple {11635#true} [128] L12-->L12-2: Formula: (not (= 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[] {11635#true} is VALID [2022-04-15 03:07:19,877 INFO L290 TraceCheckUtils]: 36: Hoare triple {11635#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11635#true} is VALID [2022-04-15 03:07:19,877 INFO L272 TraceCheckUtils]: 35: Hoare triple {11742#(<= ~counter~0 3)} [147] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~v~0_11 2) (* v_main_~u~0_11 (- 2)) (* (- 1) (* v_main_~v~0_11 v_main_~v~0_11)) (* v_main_~u~0_11 v_main_~u~0_11)) (+ (* v_main_~r~0_16 4) (* v_main_~A~0_15 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~v~0=v_main_~v~0_11, main_~A~0=v_main_~A~0_15, main_~u~0=v_main_~u~0_11, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11635#true} is VALID [2022-04-15 03:07:19,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {11742#(<= ~counter~0 3)} [145] L47-->L48: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {11742#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:19,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {11717#(<= ~counter~0 2)} [137] L47-2-->L47: 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] {11742#(<= ~counter~0 3)} is VALID [2022-04-15 03:07:19,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {11717#(<= ~counter~0 2)} [140] L40-1-->L47-2: Formula: (not (< 0 v_main_~r~0_7)) InVars {main_~r~0=v_main_~r~0_7} OutVars{main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[] {11717#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:19,879 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11635#true} {11717#(<= ~counter~0 2)} [153] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11717#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:19,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {11635#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11635#true} is VALID [2022-04-15 03:07:19,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {11635#true} [128] L12-->L12-2: Formula: (not (= 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[] {11635#true} is VALID [2022-04-15 03:07:19,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {11635#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11635#true} is VALID [2022-04-15 03:07:19,879 INFO L272 TraceCheckUtils]: 27: Hoare triple {11717#(<= ~counter~0 2)} [146] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~v~0_10 2) (* (- 1) (* v_main_~v~0_10 v_main_~v~0_10)) (* v_main_~u~0_10 (- 2)) (* v_main_~u~0_10 v_main_~u~0_10)) (+ (* v_main_~A~0_14 4) (* v_main_~r~0_15 4))) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_10, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11635#true} is VALID [2022-04-15 03:07:19,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {11717#(<= ~counter~0 2)} [139] L39-1-->L40: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {11717#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:19,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {11692#(<= ~counter~0 1)} [135] L39-3-->L39-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] {11717#(<= ~counter~0 2)} is VALID [2022-04-15 03:07:19,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {11692#(<= ~counter~0 1)} [130] L35-1-->L39-3: Formula: (not (= v_main_~r~0_5 0)) InVars {main_~r~0=v_main_~r~0_5} OutVars{main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[] {11692#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:19,881 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11635#true} {11692#(<= ~counter~0 1)} [152] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11692#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:19,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {11635#true} [133] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11635#true} is VALID [2022-04-15 03:07:19,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {11635#true} [128] L12-->L12-2: Formula: (not (= 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[] {11635#true} is VALID [2022-04-15 03:07:19,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {11635#true} [124] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11635#true} is VALID [2022-04-15 03:07:19,882 INFO L272 TraceCheckUtils]: 19: Hoare triple {11692#(<= ~counter~0 1)} [125] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_9) (* v_main_~u~0_9 v_main_~u~0_9) (* (- 1) (* v_main_~v~0_9 v_main_~v~0_9)) (* v_main_~v~0_9 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_14 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_9, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_9, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {11635#true} is VALID [2022-04-15 03:07:19,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {11692#(<= ~counter~0 1)} [122] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {11692#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:19,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {11643#(<= ~counter~0 0)} [118] L47-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] {11692#(<= ~counter~0 1)} is VALID [2022-04-15 03:07:19,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {11643#(<= ~counter~0 0)} [114] L27-->L47-3: Formula: (and (= v_main_~v~0_3 1) (= v_main_~r~0_2 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7))) (= v_main_~u~0_3 (+ (* v_main_~R~0_5 2) 1))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_3, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,883 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11635#true} {11643#(<= ~counter~0 0)} [150] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {11635#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11635#true} is VALID [2022-04-15 03:07:19,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {11635#true} [116] L9-->L9-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[] {11635#true} is VALID [2022-04-15 03:07:19,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {11635#true} [113] assume_abort_if_notENTRY-->L9: 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] {11635#true} is VALID [2022-04-15 03:07:19,884 INFO L272 TraceCheckUtils]: 11: Hoare triple {11643#(<= ~counter~0 0)} [112] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {11635#true} is VALID [2022-04-15 03:07:19,884 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11635#true} {11643#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {11635#true} [119] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11635#true} is VALID [2022-04-15 03:07:19,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {11635#true} [116] L9-->L9-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[] {11635#true} is VALID [2022-04-15 03:07:19,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {11635#true} [113] assume_abort_if_notENTRY-->L9: 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] {11635#true} is VALID [2022-04-15 03:07:19,885 INFO L272 TraceCheckUtils]: 6: Hoare triple {11643#(<= ~counter~0 0)} [111] L25-->assume_abort_if_notENTRY: Formula: (= (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_11)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {11635#true} is VALID [2022-04-15 03:07:19,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {11643#(<= ~counter~0 0)} [109] mainENTRY-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_2, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_2, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {11643#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11643#(<= ~counter~0 0)} {11635#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {11643#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {11635#true} [107] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select |v_#length_1| 2) 13) (= (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] {11643#(<= ~counter~0 0)} is VALID [2022-04-15 03:07:19,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {11635#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11635#true} is VALID [2022-04-15 03:07:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-15 03:07:19,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:07:19,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769578474] [2022-04-15 03:07:19,888 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:07:19,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367211831] [2022-04-15 03:07:19,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367211831] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 03:07:19,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 03:07:19,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-15 03:07:19,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109331387] [2022-04-15 03:07:19,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 03:07:19,889 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) Word has length 97 [2022-04-15 03:07:19,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:07:19,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) [2022-04-15 03:07:20,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:20,035 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 03:07:20,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:07:20,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 03:07:20,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-15 03:07:20,036 INFO L87 Difference]: Start difference. First operand 352 states and 467 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) [2022-04-15 03:07:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:21,000 INFO L93 Difference]: Finished difference Result 461 states and 629 transitions. [2022-04-15 03:07:21,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 03:07:21,001 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) Word has length 97 [2022-04-15 03:07:21,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:07:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) [2022-04-15 03:07:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-15 03:07:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) [2022-04-15 03:07:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-15 03:07:21,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 218 transitions. [2022-04-15 03:07:21,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:07:21,213 INFO L225 Difference]: With dead ends: 461 [2022-04-15 03:07:21,213 INFO L226 Difference]: Without dead ends: 350 [2022-04-15 03:07:21,214 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2022-04-15 03:07:21,216 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 118 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 03:07:21,216 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 247 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 03:07:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-04-15 03:07:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2022-04-15 03:07:21,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:07:21,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 350 states. Second operand has 350 states, 264 states have (on average 1.196969696969697) internal successors, (316), 264 states have internal predecessors, (316), 72 states have call successors, (72), 15 states have call predecessors, (72), 13 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2022-04-15 03:07:21,494 INFO L74 IsIncluded]: Start isIncluded. First operand 350 states. Second operand has 350 states, 264 states have (on average 1.196969696969697) internal successors, (316), 264 states have internal predecessors, (316), 72 states have call successors, (72), 15 states have call predecessors, (72), 13 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2022-04-15 03:07:21,494 INFO L87 Difference]: Start difference. First operand 350 states. Second operand has 350 states, 264 states have (on average 1.196969696969697) internal successors, (316), 264 states have internal predecessors, (316), 72 states have call successors, (72), 15 states have call predecessors, (72), 13 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2022-04-15 03:07:21,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:21,504 INFO L93 Difference]: Finished difference Result 350 states and 458 transitions. [2022-04-15 03:07:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 458 transitions. [2022-04-15 03:07:21,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:21,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:21,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 350 states, 264 states have (on average 1.196969696969697) internal successors, (316), 264 states have internal predecessors, (316), 72 states have call successors, (72), 15 states have call predecessors, (72), 13 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) Second operand 350 states. [2022-04-15 03:07:21,507 INFO L87 Difference]: Start difference. First operand has 350 states, 264 states have (on average 1.196969696969697) internal successors, (316), 264 states have internal predecessors, (316), 72 states have call successors, (72), 15 states have call predecessors, (72), 13 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) Second operand 350 states. [2022-04-15 03:07:21,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:07:21,518 INFO L93 Difference]: Finished difference Result 350 states and 458 transitions. [2022-04-15 03:07:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 458 transitions. [2022-04-15 03:07:21,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:07:21,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:07:21,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:07:21,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:07:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 264 states have (on average 1.196969696969697) internal successors, (316), 264 states have internal predecessors, (316), 72 states have call successors, (72), 15 states have call predecessors, (72), 13 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2022-04-15 03:07:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 458 transitions. [2022-04-15 03:07:21,535 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 458 transitions. Word has length 97 [2022-04-15 03:07:21,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:07:21,536 INFO L478 AbstractCegarLoop]: Abstraction has 350 states and 458 transitions. [2022-04-15 03:07:21,536 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) [2022-04-15 03:07:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 458 transitions. [2022-04-15 03:07:21,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 03:07:21,538 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:07:21,538 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:07:21,567 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-15 03:07:21,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 03:07:21,760 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:07:21,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:07:21,760 INFO L85 PathProgramCache]: Analyzing trace with hash -708686281, now seen corresponding path program 1 times [2022-04-15 03:07:21,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:07:21,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276570436] [2022-04-15 03:07:21,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:21,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:07:21,781 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:07:21,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1899225847] [2022-04-15 03:07:21,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:07:21,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:21,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:07:21,795 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-15 03:07:21,796 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-15 03:07:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 03:07:21,958 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 03:07:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 03:07:22,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 03:07:22,077 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 03:07:22,078 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 03:07:22,106 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-15 03:07:22,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:07:22,298 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:07:22,301 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 03:07:22,381 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 03:07:22,381 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 03:07:22,381 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 03:07:22,381 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 03:07:22,381 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 03:07:22,381 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 03:07:22,381 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 03:07:22,381 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 03:07:22,381 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 03:07:22,381 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 03:07:22,381 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 03:07:22,381 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 03:07:22,381 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-15 03:07:22,381 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-15 03:07:22,382 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 03:07:22,383 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 03:07:22,383 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 03:07:22,383 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-15 03:07:22,383 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-15 03:07:22,383 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-15 03:07:22,383 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-15 03:07:22,383 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 03:07:22,383 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 03:07:22,383 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 03:07:22,383 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 03:07:22,383 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 03:07:22,383 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-15 03:07:22,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:07:22 BasicIcfg [2022-04-15 03:07:22,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 03:07:22,384 INFO L158 Benchmark]: Toolchain (without parser) took 49579.27ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 125.6MB in the beginning and 182.3MB in the end (delta: -56.7MB). Peak memory consumption was 96.1MB. Max. memory is 8.0GB. [2022-04-15 03:07:22,385 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 03:07:22,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.56ms. Allocated memory is still 176.2MB. Free memory was 125.4MB in the beginning and 153.2MB in the end (delta: -27.8MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-04-15 03:07:22,385 INFO L158 Benchmark]: Boogie Preprocessor took 50.01ms. Allocated memory is still 176.2MB. Free memory was 153.2MB in the beginning and 151.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 03:07:22,385 INFO L158 Benchmark]: RCFGBuilder took 280.12ms. Allocated memory is still 176.2MB. Free memory was 151.5MB in the beginning and 139.3MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 03:07:22,385 INFO L158 Benchmark]: IcfgTransformer took 72.62ms. Allocated memory is still 176.2MB. Free memory was 139.3MB in the beginning and 137.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 03:07:22,386 INFO L158 Benchmark]: TraceAbstraction took 48876.50ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 136.4MB in the beginning and 182.3MB in the end (delta: -45.8MB). Peak memory consumption was 107.5MB. Max. memory is 8.0GB. [2022-04-15 03:07:22,386 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.12ms. Allocated memory is still 176.2MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 293.56ms. Allocated memory is still 176.2MB. Free memory was 125.4MB in the beginning and 153.2MB in the end (delta: -27.8MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.01ms. Allocated memory is still 176.2MB. Free memory was 153.2MB in the beginning and 151.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 280.12ms. Allocated memory is still 176.2MB. Free memory was 151.5MB in the beginning and 139.3MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 72.62ms. Allocated memory is still 176.2MB. Free memory was 139.3MB in the beginning and 137.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 48876.50ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 136.4MB in the beginning and 182.3MB in the end (delta: -45.8MB). Peak memory consumption was 107.5MB. 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: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [\old(counter)=14, counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] CALL assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(counter)=0, A=7, counter=0, R=2] [L27] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L27] RET assume_abort_if_not(A % 2 == 1) VAL [\old(counter)=0, A=7, counter=0, R=2] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [\old(counter)=0, A=7, counter=0, R=2, r=-3, u=5, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=7, counter=1, counter++=0, r=-3, R=2, u=5, v=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=1, r=-3, R=2, u=5, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=7, counter=1, R=2, r=-3, u=5, v=1] [L39] EXPR counter++ VAL [\old(counter)=0, A=7, counter=2, counter++=1, r=-3, R=2, u=5, v=1] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=2, r=-3, R=2, u=5, v=1] [L41] COND TRUE !(r > 0) VAL [\old(counter)=0, A=7, counter=2, r=-3, R=2, u=5, v=1] [L47] EXPR counter++ VAL [\old(counter)=0, A=7, counter=3, counter++=2, R=2, r=-3, u=5, v=1] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=3, r=-3, R=2, u=5, v=1] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [\old(counter)=0, A=7, counter=3, R=2, r=2, u=7, v=1] [L47] EXPR counter++ VAL [\old(counter)=0, A=7, counter=4, counter++=3, R=2, r=2, u=7, v=1] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=4, R=2, r=2, u=7, v=1] [L49] COND TRUE !(r < 0) VAL [\old(counter)=0, A=7, counter=4, r=2, R=2, u=7, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=7, counter=5, counter++=4, R=2, r=2, u=7, v=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=5, R=2, r=2, u=7, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=7, counter=5, r=2, R=2, u=7, v=1] [L39] EXPR counter++ VAL [\old(counter)=0, A=7, counter=6, counter++=5, R=2, r=2, u=7, v=1] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=6, R=2, r=2, u=7, v=1] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [\old(counter)=0, A=7, counter=6, r=1, R=2, u=7, v=3] [L39] EXPR counter++ VAL [\old(counter)=0, A=7, counter=7, counter++=6, R=2, r=1, u=7, v=3] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=7, r=1, R=2, u=7, v=3] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [\old(counter)=0, A=7, counter=7, R=2, r=-2, u=7, v=5] [L39] EXPR counter++ VAL [\old(counter)=0, A=7, counter=8, counter++=7, R=2, r=-2, u=7, v=5] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=8, r=-2, R=2, u=7, v=5] [L41] COND TRUE !(r > 0) VAL [\old(counter)=0, A=7, counter=8, r=-2, R=2, u=7, v=5] [L47] EXPR counter++ VAL [\old(counter)=0, A=7, counter=9, counter++=8, r=-2, R=2, u=7, v=5] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=9, r=-2, R=2, u=7, v=5] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [\old(counter)=0, A=7, counter=9, r=5, R=2, u=9, v=5] [L47] EXPR counter++ VAL [\old(counter)=0, A=7, counter=10, counter++=9, R=2, r=5, u=9, v=5] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=10, R=2, r=5, u=9, v=5] [L49] COND TRUE !(r < 0) VAL [\old(counter)=0, A=7, counter=10, r=5, R=2, u=9, v=5] [L34] EXPR counter++ VAL [\old(counter)=0, A=7, counter=11, counter++=10, R=2, r=5, u=9, v=5] [L34] COND FALSE !(counter++<10) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, \old(counter)=0, counter=11] [L12] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] [L14] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.7s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 832 SdHoareTripleChecker+Valid, 13.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 821 mSDsluCounter, 2130 SdHoareTripleChecker+Invalid, 13.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1517 mSDsCounter, 440 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 772 IncrementalHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 440 mSolverCounterUnsat, 613 mSDtfsCounter, 772 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1164 GetRequests, 1044 SyntacticMatches, 4 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=352occurred in iteration=12, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 74 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1121 ConstructedInterpolants, 0 QuantifiedInterpolants, 2555 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1931 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 934/1396 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-15 03:07:22,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...