/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 17:39:33,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 17:39:33,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 17:39:33,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 17:39:33,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 17:39:33,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 17:39:33,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 17:39:33,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 17:39:33,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 17:39:33,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 17:39:33,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 17:39:33,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 17:39:33,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 17:39:33,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 17:39:33,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 17:39:33,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 17:39:33,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 17:39:33,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 17:39:33,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 17:39:33,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 17:39:33,970 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 17:39:33,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 17:39:33,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 17:39:33,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 17:39:33,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 17:39:33,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 17:39:33,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 17:39:33,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 17:39:33,980 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 17:39:33,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 17:39:33,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 17:39:33,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 17:39:33,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 17:39:33,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 17:39:33,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 17:39:33,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 17:39:33,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 17:39:33,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 17:39:33,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 17:39:33,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 17:39:33,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 17:39:33,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 17:39:33,999 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 17:39:34,017 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 17:39:34,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 17:39:34,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 17:39:34,018 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 17:39:34,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 17:39:34,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 17:39:34,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 17:39:34,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 17:39:34,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 17:39:34,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 17:39:34,019 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 17:39:34,019 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 17:39:34,019 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 17:39:34,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 17:39:34,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 17:39:34,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 17:39:34,020 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 17:39:34,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 17:39:34,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:39:34,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 17:39:34,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 17:39:34,021 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 17:39:34,021 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 17:39:34,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 17:39:34,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 17:39:34,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 17:39:34,235 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 17:39:34,236 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 17:39:34,237 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound100.c [2022-04-27 17:39:34,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ddbe29a4/32a2d75409a049d3bc54e82eb60ab578/FLAG54680be60 [2022-04-27 17:39:34,708 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 17:39:34,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound100.c [2022-04-27 17:39:34,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ddbe29a4/32a2d75409a049d3bc54e82eb60ab578/FLAG54680be60 [2022-04-27 17:39:34,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ddbe29a4/32a2d75409a049d3bc54e82eb60ab578 [2022-04-27 17:39:34,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 17:39:34,729 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 17:39:34,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 17:39:34,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 17:39:34,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 17:39:34,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:39:34" (1/1) ... [2022-04-27 17:39:34,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3543a10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:39:34, skipping insertion in model container [2022-04-27 17:39:34,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:39:34" (1/1) ... [2022-04-27 17:39:34,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 17:39:34,748 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 17:39:34,881 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/cohendiv-ll_unwindbound100.c[576,589] [2022-04-27 17:39:34,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:39:34,915 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 17:39:34,924 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/cohendiv-ll_unwindbound100.c[576,589] [2022-04-27 17:39:34,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:39:34,943 INFO L208 MainTranslator]: Completed translation [2022-04-27 17:39:34,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:39:34 WrapperNode [2022-04-27 17:39:34,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 17:39:34,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 17:39:34,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 17:39:34,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 17:39:34,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:39:34" (1/1) ... [2022-04-27 17:39:34,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:39:34" (1/1) ... [2022-04-27 17:39:34,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:39:34" (1/1) ... [2022-04-27 17:39:34,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:39:34" (1/1) ... [2022-04-27 17:39:34,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:39:34" (1/1) ... [2022-04-27 17:39:34,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:39:34" (1/1) ... [2022-04-27 17:39:34,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:39:34" (1/1) ... [2022-04-27 17:39:34,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 17:39:34,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 17:39:34,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 17:39:34,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 17:39:34,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:39:34" (1/1) ... [2022-04-27 17:39:34,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:39:35,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:39:35,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 17:39:35,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 17:39:35,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 17:39:35,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 17:39:35,054 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 17:39:35,054 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 17:39:35,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 17:39:35,055 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 17:39:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 17:39:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 17:39:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 17:39:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 17:39:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 17:39:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 17:39:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 17:39:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 17:39:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 17:39:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 17:39:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 17:39:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 17:39:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 17:39:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 17:39:35,115 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 17:39:35,116 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 17:39:35,238 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 17:39:35,244 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 17:39:35,245 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 17:39:35,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:39:35 BoogieIcfgContainer [2022-04-27 17:39:35,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 17:39:35,247 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 17:39:35,247 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 17:39:35,247 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 17:39:35,250 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:39:35" (1/1) ... [2022-04-27 17:39:35,252 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 17:39:35,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:39:35 BasicIcfg [2022-04-27 17:39:35,277 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 17:39:35,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 17:39:35,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 17:39:35,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 17:39:35,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 05:39:34" (1/4) ... [2022-04-27 17:39:35,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a243718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:39:35, skipping insertion in model container [2022-04-27 17:39:35,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:39:34" (2/4) ... [2022-04-27 17:39:35,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a243718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:39:35, skipping insertion in model container [2022-04-27 17:39:35,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:39:35" (3/4) ... [2022-04-27 17:39:35,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a243718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:39:35, skipping insertion in model container [2022-04-27 17:39:35,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:39:35" (4/4) ... [2022-04-27 17:39:35,283 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound100.cJordan [2022-04-27 17:39:35,293 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 17:39:35,293 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 17:39:35,326 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 17:39:35,331 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c89e966, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@657e698b [2022-04-27 17:39:35,331 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 17:39:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 17:39:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 17:39:35,343 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:39:35,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:39:35,344 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:39:35,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:39:35,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1213541379, now seen corresponding path program 1 times [2022-04-27 17:39:35,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:39:35,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327224195] [2022-04-27 17:39:35,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:39:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:35,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:39:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:35,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {41#true} is VALID [2022-04-27 17:39:35,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 17:39:35,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 17:39:35,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 17:39:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:35,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} [104] assume_abort_if_notENTRY-->L12: 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#true} is VALID [2022-04-27 17:39:35,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [107] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:39:35,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:39:35,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 17:39:35,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:39:35,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {41#true} is VALID [2022-04-27 17:39:35,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 17:39:35,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 17:39:35,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 17:39:35,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {41#true} is VALID [2022-04-27 17:39:35,634 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-27 17:39:35,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} [104] assume_abort_if_notENTRY-->L12: 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#true} is VALID [2022-04-27 17:39:35,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} [107] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:39:35,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:39:35,637 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 17:39:35,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {42#false} is VALID [2022-04-27 17:39:35,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#false} [105] L37-3-->L37-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:39:35,637 INFO L272 TraceCheckUtils]: 13: Hoare triple {42#false} [109] L37-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_10 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_19))) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_19, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {42#false} is VALID [2022-04-27 17:39:35,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {42#false} is VALID [2022-04-27 17:39:35,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:39:35,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 17:39:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:39:35,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:39:35,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327224195] [2022-04-27 17:39:35,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327224195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:39:35,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:39:35,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 17:39:35,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824915710] [2022-04-27 17:39:35,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:39:35,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 17:39:35,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:39:35,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 17:39:35,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:39:35,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 17:39:35,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:39:35,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 17:39:35,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 17:39:35,712 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 17:39:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:35,910 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-04-27 17:39:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 17:39:35,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 17:39:35,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:39:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 17:39:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-27 17:39:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 17:39:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-27 17:39:35,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2022-04-27 17:39:35,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:39:36,000 INFO L225 Difference]: With dead ends: 39 [2022-04-27 17:39:36,000 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 17:39:36,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 17:39:36,004 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:39:36,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:39:36,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 17:39:36,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-27 17:39:36,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:39:36,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 17:39:36,031 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 17:39:36,031 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 17:39:36,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:36,036 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 17:39:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 17:39:36,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:36,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:36,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-27 17:39:36,038 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-27 17:39:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:36,042 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 17:39:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 17:39:36,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:36,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:36,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:39:36,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:39:36,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 17:39:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-04-27 17:39:36,048 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2022-04-27 17:39:36,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:39:36,049 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-04-27 17:39:36,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 17:39:36,049 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-04-27 17:39:36,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 17:39:36,050 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:39:36,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:39:36,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 17:39:36,051 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:39:36,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:39:36,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1202035559, now seen corresponding path program 1 times [2022-04-27 17:39:36,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:39:36,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626423606] [2022-04-27 17:39:36,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:36,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:39:36,070 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:39:36,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269523336] [2022-04-27 17:39:36,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:36,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:39:36,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:39:36,075 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:39:36,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 17:39:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:36,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 17:39:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:36,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:39:36,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {193#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#true} is VALID [2022-04-27 17:39:36,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {201#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:36,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {201#(<= ~counter~0 0)} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {201#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:36,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {201#(<= ~counter~0 0)} {193#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {201#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:36,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {201#(<= ~counter~0 0)} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {201#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:36,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {201#(<= ~counter~0 0)} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {201#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:36,332 INFO L272 TraceCheckUtils]: 6: Hoare triple {201#(<= ~counter~0 0)} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {201#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:36,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {201#(<= ~counter~0 0)} [104] assume_abort_if_notENTRY-->L12: 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] {201#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:36,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {201#(<= ~counter~0 0)} [108] L12-->L12-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[] {201#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:36,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {201#(<= ~counter~0 0)} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {201#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:36,334 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {201#(<= ~counter~0 0)} {201#(<= ~counter~0 0)} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {201#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:36,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {201#(<= ~counter~0 0)} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {201#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:36,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {201#(<= ~counter~0 0)} [106] L37-3-->L37-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] {235#(<= |main_#t~post6| 0)} is VALID [2022-04-27 17:39:36,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {235#(<= |main_#t~post6| 0)} [110] L37-1-->L37-4: Formula: (not (< |v_main_#t~post6_3| 100)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {194#false} is VALID [2022-04-27 17:39:36,337 INFO L272 TraceCheckUtils]: 14: Hoare triple {194#false} [109] L37-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_10 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_19))) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_19, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {194#false} is VALID [2022-04-27 17:39:36,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {194#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {194#false} is VALID [2022-04-27 17:39:36,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {194#false} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {194#false} is VALID [2022-04-27 17:39:36,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {194#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#false} is VALID [2022-04-27 17:39:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:39:36,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:39:36,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:39:36,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626423606] [2022-04-27 17:39:36,340 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:39:36,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269523336] [2022-04-27 17:39:36,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269523336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:39:36,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:39:36,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 17:39:36,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851507716] [2022-04-27 17:39:36,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:39:36,348 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 17:39:36,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:39:36,349 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 17:39:36,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:39:36,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 17:39:36,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:39:36,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 17:39:36,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 17:39:36,368 INFO L87 Difference]: Start difference. First operand 33 states and 42 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 17:39:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:36,459 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 17:39:36,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 17:39:36,460 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 17:39:36,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:39:36,460 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 17:39:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-27 17:39:36,463 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 17:39:36,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-27 17:39:36,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-04-27 17:39:36,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:39:36,504 INFO L225 Difference]: With dead ends: 35 [2022-04-27 17:39:36,505 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 17:39:36,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 17:39:36,506 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:39:36,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:39:36,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 17:39:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 17:39:36,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:39:36,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 17:39:36,511 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 17:39:36,512 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 17:39:36,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:36,514 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 17:39:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 17:39:36,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:36,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:36,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-27 17:39:36,516 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-27 17:39:36,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:36,519 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 17:39:36,519 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 17:39:36,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:36,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:36,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:39:36,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:39:36,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 17:39:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-27 17:39:36,523 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 18 [2022-04-27 17:39:36,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:39:36,523 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-27 17:39:36,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 17:39:36,524 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 17:39:36,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 17:39:36,524 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:39:36,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:39:36,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 17:39:36,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:39:36,740 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:39:36,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:39:36,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1200933292, now seen corresponding path program 1 times [2022-04-27 17:39:36,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:39:36,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920639716] [2022-04-27 17:39:36,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:36,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:39:36,757 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:39:36,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2037416977] [2022-04-27 17:39:36,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:36,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:39:36,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:39:36,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:39:36,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 17:39:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:36,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 17:39:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:36,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:39:39,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-27 17:39:39,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {390#true} is VALID [2022-04-27 17:39:39,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-27 17:39:39,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-27 17:39:39,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-27 17:39:39,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {390#true} is VALID [2022-04-27 17:39:39,221 INFO L272 TraceCheckUtils]: 6: Hoare triple {390#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {390#true} is VALID [2022-04-27 17:39:39,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#true} [104] assume_abort_if_notENTRY-->L12: 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] {390#true} is VALID [2022-04-27 17:39:39,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {390#true} [108] L12-->L12-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[] {390#true} is VALID [2022-04-27 17:39:39,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {390#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-27 17:39:39,222 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {390#true} {390#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {390#true} is VALID [2022-04-27 17:39:39,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {390#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {428#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-27 17:39:39,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {428#(and (= main_~a~0 0) (= main_~b~0 0))} [106] L37-3-->L37-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] {428#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-27 17:39:39,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {428#(and (= main_~a~0 0) (= main_~b~0 0))} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {428#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-27 17:39:39,224 INFO L272 TraceCheckUtils]: 14: Hoare triple {428#(and (= main_~a~0 0) (= main_~b~0 0))} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {438#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:39:39,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {438#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {442#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:39:39,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {442#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {391#false} is VALID [2022-04-27 17:39:39,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {391#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {391#false} is VALID [2022-04-27 17:39:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:39:39,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:39:39,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:39:39,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920639716] [2022-04-27 17:39:39,227 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:39:39,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037416977] [2022-04-27 17:39:39,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037416977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:39:39,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:39:39,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:39:39,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821822151] [2022-04-27 17:39:39,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:39:39,228 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 17:39:39,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:39:39,228 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 17:39:39,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:39:39,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:39:39,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:39:39,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:39:39,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:39:39,244 INFO L87 Difference]: Start difference. First operand 35 states and 44 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 17:39:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:39,439 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-27 17:39:39,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:39:39,440 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 17:39:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:39:39,441 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 17:39:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-27 17:39:39,445 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 17:39:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-27 17:39:39,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-27 17:39:39,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:39:39,506 INFO L225 Difference]: With dead ends: 43 [2022-04-27 17:39:39,506 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 17:39:39,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 17:39:39,509 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:39:39,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 145 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:39:39,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 17:39:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-27 17:39:39,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:39:39,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 17:39:39,521 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 17:39:39,521 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 17:39:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:39,531 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-27 17:39:39,531 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-27 17:39:39,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:39,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:39,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-27 17:39:39,532 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-27 17:39:39,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:39,541 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-27 17:39:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-27 17:39:39,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:39,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:39,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:39:39,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:39:39,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 17:39:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-27 17:39:39,546 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 18 [2022-04-27 17:39:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:39:39,546 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-27 17:39:39,547 INFO L496 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 17:39:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-27 17:39:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 17:39:39,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:39:39,549 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:39:39,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 17:39:39,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 17:39:39,772 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:39:39,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:39:39,772 INFO L85 PathProgramCache]: Analyzing trace with hash -944097291, now seen corresponding path program 1 times [2022-04-27 17:39:39,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:39:39,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905681796] [2022-04-27 17:39:39,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:39,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:39:39,788 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:39:39,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2079481939] [2022-04-27 17:39:39,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:39,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:39:39,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:39:39,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:39:39,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 17:39:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:39,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 17:39:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:39,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:39:43,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {619#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 17:39:43,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {619#true} is VALID [2022-04-27 17:39:43,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 17:39:43,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {619#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 17:39:43,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {619#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 17:39:43,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {619#true} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {619#true} is VALID [2022-04-27 17:39:43,997 INFO L272 TraceCheckUtils]: 6: Hoare triple {619#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {619#true} is VALID [2022-04-27 17:39:43,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {619#true} [104] assume_abort_if_notENTRY-->L12: 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] {619#true} is VALID [2022-04-27 17:39:43,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {619#true} [108] L12-->L12-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[] {619#true} is VALID [2022-04-27 17:39:43,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {619#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 17:39:43,998 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {619#true} {619#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {619#true} is VALID [2022-04-27 17:39:43,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {619#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:39:44,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [106] L37-3-->L37-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] {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:39:44,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:39:44,005 INFO L272 TraceCheckUtils]: 14: Hoare triple {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {619#true} is VALID [2022-04-27 17:39:44,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {619#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {619#true} is VALID [2022-04-27 17:39:44,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {619#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 17:39:44,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {619#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#true} is VALID [2022-04-27 17:39:44,011 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {619#true} {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:39:44,014 INFO L272 TraceCheckUtils]: 19: Hoare triple {657#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {682#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:39:44,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {686#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:39:44,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {686#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {620#false} is VALID [2022-04-27 17:39:44,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {620#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {620#false} is VALID [2022-04-27 17:39:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:39:44,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:39:44,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:39:44,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905681796] [2022-04-27 17:39:44,018 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:39:44,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079481939] [2022-04-27 17:39:44,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079481939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:39:44,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:39:44,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:39:44,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3947914] [2022-04-27 17:39:44,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:39:44,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 17:39:44,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:39:44,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 17:39:44,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:39:44,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:39:44,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:39:44,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:39:44,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:39:44,044 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 17:39:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:44,287 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2022-04-27 17:39:44,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:39:44,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 17:39:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:39:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 17:39:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 17:39:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 17:39:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 17:39:44,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-27 17:39:44,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:39:44,365 INFO L225 Difference]: With dead ends: 56 [2022-04-27 17:39:44,365 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 17:39:44,365 INFO L412 NwaCegarLoop]: 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-27 17:39:44,366 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:39:44,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:39:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 17:39:44,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-27 17:39:44,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:39:44,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 17:39:44,372 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 17:39:44,372 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 17:39:44,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:44,375 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 17:39:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 17:39:44,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:44,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:44,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-27 17:39:44,377 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-27 17:39:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:44,382 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 17:39:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 17:39:44,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:44,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:44,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:39:44,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:39:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 17:39:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-27 17:39:44,386 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 23 [2022-04-27 17:39:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:39:44,386 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-27 17:39:44,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 17:39:44,387 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-27 17:39:44,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 17:39:44,387 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:39:44,387 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:39:44,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 17:39:44,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:39:44,604 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:39:44,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:39:44,604 INFO L85 PathProgramCache]: Analyzing trace with hash -653220550, now seen corresponding path program 1 times [2022-04-27 17:39:44,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:39:44,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570434747] [2022-04-27 17:39:44,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:44,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:39:44,621 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:39:44,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394309233] [2022-04-27 17:39:44,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:44,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:39:44,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:39:44,623 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:39:44,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 17:39:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:44,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 17:39:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:44,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:39:44,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {914#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 17:39:44,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {914#true} is VALID [2022-04-27 17:39:44,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 17:39:44,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {914#true} {914#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 17:39:44,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {914#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 17:39:44,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#true} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {914#true} is VALID [2022-04-27 17:39:44,810 INFO L272 TraceCheckUtils]: 6: Hoare triple {914#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {914#true} is VALID [2022-04-27 17:39:44,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {914#true} [104] assume_abort_if_notENTRY-->L12: 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] {914#true} is VALID [2022-04-27 17:39:44,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {914#true} [108] L12-->L12-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[] {914#true} is VALID [2022-04-27 17:39:44,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {914#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 17:39:44,811 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {914#true} {914#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {914#true} is VALID [2022-04-27 17:39:44,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {914#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {914#true} is VALID [2022-04-27 17:39:44,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {914#true} [106] L37-3-->L37-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] {914#true} is VALID [2022-04-27 17:39:44,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {914#true} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {914#true} is VALID [2022-04-27 17:39:44,811 INFO L272 TraceCheckUtils]: 14: Hoare triple {914#true} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {914#true} is VALID [2022-04-27 17:39:44,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {914#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {914#true} is VALID [2022-04-27 17:39:44,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {914#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 17:39:44,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {914#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 17:39:44,812 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {914#true} {914#true} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {914#true} is VALID [2022-04-27 17:39:44,815 INFO L272 TraceCheckUtils]: 19: Hoare triple {914#true} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {914#true} is VALID [2022-04-27 17:39:44,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {914#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {914#true} is VALID [2022-04-27 17:39:44,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {914#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 17:39:44,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {914#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 17:39:44,816 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {914#true} {914#true} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {914#true} is VALID [2022-04-27 17:39:44,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {914#true} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {991#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-27 17:39:44,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {991#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} [126] L46-3-->L46-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] {991#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-27 17:39:44,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {991#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 100) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {991#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-27 17:39:44,819 INFO L272 TraceCheckUtils]: 27: Hoare triple {991#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1001#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:39:44,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {1001#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1005#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:39:44,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {1005#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {915#false} is VALID [2022-04-27 17:39:44,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {915#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {915#false} is VALID [2022-04-27 17:39:44,820 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-27 17:39:44,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:39:44,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:39:44,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570434747] [2022-04-27 17:39:44,823 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:39:44,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394309233] [2022-04-27 17:39:44,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394309233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:39:44,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:39:44,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:39:44,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853716195] [2022-04-27 17:39:44,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:39:44,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-27 17:39:44,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:39:44,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 17:39:44,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:39:44,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:39:44,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:39:44,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:39:44,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:39:44,847 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 17:39:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:45,036 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-27 17:39:45,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:39:45,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-27 17:39:45,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:39:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 17:39:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 17:39:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 17:39:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 17:39:45,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-27 17:39:45,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:39:45,099 INFO L225 Difference]: With dead ends: 81 [2022-04-27 17:39:45,099 INFO L226 Difference]: Without dead ends: 81 [2022-04-27 17:39:45,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 17:39:45,100 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:39:45,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 145 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:39:45,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-27 17:39:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-04-27 17:39:45,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:39:45,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 17:39:45,108 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 17:39:45,108 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 17:39:45,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:45,112 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-27 17:39:45,112 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-27 17:39:45,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:45,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:45,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-27 17:39:45,114 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-27 17:39:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:45,118 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-27 17:39:45,118 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-27 17:39:45,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:45,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:45,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:39:45,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:39:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 17:39:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2022-04-27 17:39:45,122 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 31 [2022-04-27 17:39:45,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:39:45,122 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2022-04-27 17:39:45,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 17:39:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2022-04-27 17:39:45,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 17:39:45,123 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:39:45,123 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:39:45,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 17:39:45,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:39:45,340 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:39:45,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:39:45,341 INFO L85 PathProgramCache]: Analyzing trace with hash -830156892, now seen corresponding path program 1 times [2022-04-27 17:39:45,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:39:45,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143691629] [2022-04-27 17:39:45,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:45,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:39:45,356 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:39:45,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1279078873] [2022-04-27 17:39:45,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:45,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:39:45,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:39:45,358 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:39:45,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 17:39:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:45,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 17:39:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:45,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:39:45,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {1330#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1330#true} is VALID [2022-04-27 17:39:45,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {1330#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {1338#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:45,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {1338#(<= ~counter~0 0)} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1338#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:45,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1338#(<= ~counter~0 0)} {1330#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1338#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:45,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {1338#(<= ~counter~0 0)} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1338#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:45,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {1338#(<= ~counter~0 0)} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1338#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:45,600 INFO L272 TraceCheckUtils]: 6: Hoare triple {1338#(<= ~counter~0 0)} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1338#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:45,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {1338#(<= ~counter~0 0)} [104] assume_abort_if_notENTRY-->L12: 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] {1338#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:45,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {1338#(<= ~counter~0 0)} [108] L12-->L12-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[] {1338#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:45,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {1338#(<= ~counter~0 0)} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1338#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:45,604 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1338#(<= ~counter~0 0)} {1338#(<= ~counter~0 0)} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1338#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:45,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {1338#(<= ~counter~0 0)} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1338#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:45,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {1338#(<= ~counter~0 0)} [106] L37-3-->L37-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] {1372#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:45,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {1372#(<= ~counter~0 1)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1372#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:45,606 INFO L272 TraceCheckUtils]: 14: Hoare triple {1372#(<= ~counter~0 1)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1372#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:45,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {1372#(<= ~counter~0 1)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1372#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:45,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {1372#(<= ~counter~0 1)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1372#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:45,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {1372#(<= ~counter~0 1)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1372#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:45,610 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1372#(<= ~counter~0 1)} {1372#(<= ~counter~0 1)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1372#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:45,611 INFO L272 TraceCheckUtils]: 19: Hoare triple {1372#(<= ~counter~0 1)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1372#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:45,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {1372#(<= ~counter~0 1)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1372#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:45,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {1372#(<= ~counter~0 1)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1372#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:45,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {1372#(<= ~counter~0 1)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1372#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:45,612 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1372#(<= ~counter~0 1)} {1372#(<= ~counter~0 1)} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1372#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:45,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {1372#(<= ~counter~0 1)} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1372#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:45,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {1372#(<= ~counter~0 1)} [126] L46-3-->L46-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] {1412#(<= |main_#t~post7| 1)} is VALID [2022-04-27 17:39:45,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {1412#(<= |main_#t~post7| 1)} [133] L46-1-->L46-4: Formula: (not (< |v_main_#t~post7_3| 100)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1331#false} is VALID [2022-04-27 17:39:45,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {1331#false} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {1331#false} is VALID [2022-04-27 17:39:45,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {1331#false} [106] L37-3-->L37-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] {1331#false} is VALID [2022-04-27 17:39:45,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {1331#false} [110] L37-1-->L37-4: Formula: (not (< |v_main_#t~post6_3| 100)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1331#false} is VALID [2022-04-27 17:39:45,614 INFO L272 TraceCheckUtils]: 30: Hoare triple {1331#false} [109] L37-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_10 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_19))) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_19, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1331#false} is VALID [2022-04-27 17:39:45,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {1331#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1331#false} is VALID [2022-04-27 17:39:45,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {1331#false} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1331#false} is VALID [2022-04-27 17:39:45,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {1331#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1331#false} is VALID [2022-04-27 17:39:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 17:39:45,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:39:45,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:39:45,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143691629] [2022-04-27 17:39:45,615 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:39:45,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279078873] [2022-04-27 17:39:45,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279078873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:39:45,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:39:45,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:39:45,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326084578] [2022-04-27 17:39:45,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:39:45,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 34 [2022-04-27 17:39:45,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:39:45,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-27 17:39:45,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:39:45,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:39:45,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:39:45,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:39:45,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:39:45,637 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-27 17:39:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:45,740 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-27 17:39:45,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:39:45,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 34 [2022-04-27 17:39:45,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:39:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-27 17:39:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-27 17:39:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-27 17:39:45,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-27 17:39:45,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-27 17:39:45,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:39:45,787 INFO L225 Difference]: With dead ends: 78 [2022-04-27 17:39:45,787 INFO L226 Difference]: Without dead ends: 78 [2022-04-27 17:39:45,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:39:45,788 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:39:45,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:39:45,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-27 17:39:45,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-27 17:39:45,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:39:45,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 17:39:45,794 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 17:39:45,795 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 17:39:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:45,798 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-27 17:39:45,798 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-27 17:39:45,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:45,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:45,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-27 17:39:45,800 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-27 17:39:45,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:45,803 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-27 17:39:45,803 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-27 17:39:45,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:45,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:45,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:39:45,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:39:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 17:39:45,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2022-04-27 17:39:45,807 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 34 [2022-04-27 17:39:45,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:39:45,808 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2022-04-27 17:39:45,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-27 17:39:45,808 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-27 17:39:45,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 17:39:45,809 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:39:45,809 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:39:45,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 17:39:46,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:39:46,024 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:39:46,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:39:46,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1527688582, now seen corresponding path program 1 times [2022-04-27 17:39:46,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:39:46,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075402800] [2022-04-27 17:39:46,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:46,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:39:46,037 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:39:46,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [862157961] [2022-04-27 17:39:46,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:46,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:39:46,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:39:46,038 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:39:46,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 17:39:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:46,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 17:39:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:46,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:39:46,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {1748#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1748#true} is VALID [2022-04-27 17:39:46,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {1748#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {1748#true} is VALID [2022-04-27 17:39:46,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {1748#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1748#true} is VALID [2022-04-27 17:39:46,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1748#true} {1748#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1748#true} is VALID [2022-04-27 17:39:46,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {1748#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1748#true} is VALID [2022-04-27 17:39:46,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {1748#true} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1748#true} is VALID [2022-04-27 17:39:46,304 INFO L272 TraceCheckUtils]: 6: Hoare triple {1748#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1748#true} is VALID [2022-04-27 17:39:46,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {1748#true} [104] assume_abort_if_notENTRY-->L12: 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#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 17:39:46,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {1774#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [108] L12-->L12-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[] {1778#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 17:39:46,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {1778#(not (= |assume_abort_if_not_#in~cond| 0))} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1778#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 17:39:46,309 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1778#(not (= |assume_abort_if_not_#in~cond| 0))} {1748#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1785#(<= 1 main_~y~0)} is VALID [2022-04-27 17:39:46,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {1785#(<= 1 main_~y~0)} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1785#(<= 1 main_~y~0)} is VALID [2022-04-27 17:39:46,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {1785#(<= 1 main_~y~0)} [106] L37-3-->L37-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] {1785#(<= 1 main_~y~0)} is VALID [2022-04-27 17:39:46,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {1785#(<= 1 main_~y~0)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1785#(<= 1 main_~y~0)} is VALID [2022-04-27 17:39:46,310 INFO L272 TraceCheckUtils]: 14: Hoare triple {1785#(<= 1 main_~y~0)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1748#true} is VALID [2022-04-27 17:39:46,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {1748#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1748#true} is VALID [2022-04-27 17:39:46,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {1748#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1748#true} is VALID [2022-04-27 17:39:46,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {1748#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1748#true} is VALID [2022-04-27 17:39:46,311 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1748#true} {1785#(<= 1 main_~y~0)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1785#(<= 1 main_~y~0)} is VALID [2022-04-27 17:39:46,312 INFO L272 TraceCheckUtils]: 19: Hoare triple {1785#(<= 1 main_~y~0)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1748#true} is VALID [2022-04-27 17:39:46,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {1748#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1748#true} is VALID [2022-04-27 17:39:46,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {1748#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1748#true} is VALID [2022-04-27 17:39:46,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {1748#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1748#true} is VALID [2022-04-27 17:39:46,314 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1748#true} {1785#(<= 1 main_~y~0)} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1785#(<= 1 main_~y~0)} is VALID [2022-04-27 17:39:46,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {1785#(<= 1 main_~y~0)} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1828#(<= 1 main_~r~0)} is VALID [2022-04-27 17:39:46,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {1828#(<= 1 main_~r~0)} [126] L46-3-->L46-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] {1828#(<= 1 main_~r~0)} is VALID [2022-04-27 17:39:46,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {1828#(<= 1 main_~r~0)} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 100) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1828#(<= 1 main_~r~0)} is VALID [2022-04-27 17:39:46,315 INFO L272 TraceCheckUtils]: 27: Hoare triple {1828#(<= 1 main_~r~0)} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1748#true} is VALID [2022-04-27 17:39:46,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {1748#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1748#true} is VALID [2022-04-27 17:39:46,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {1748#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1748#true} is VALID [2022-04-27 17:39:46,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {1748#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1748#true} is VALID [2022-04-27 17:39:46,316 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1748#true} {1828#(<= 1 main_~r~0)} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1828#(<= 1 main_~r~0)} is VALID [2022-04-27 17:39:46,316 INFO L272 TraceCheckUtils]: 32: Hoare triple {1828#(<= 1 main_~r~0)} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1748#true} is VALID [2022-04-27 17:39:46,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {1748#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1748#true} is VALID [2022-04-27 17:39:46,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {1748#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1748#true} is VALID [2022-04-27 17:39:46,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {1748#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1748#true} is VALID [2022-04-27 17:39:46,317 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1748#true} {1828#(<= 1 main_~r~0)} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1828#(<= 1 main_~r~0)} is VALID [2022-04-27 17:39:46,318 INFO L272 TraceCheckUtils]: 37: Hoare triple {1828#(<= 1 main_~r~0)} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1868#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:39:46,318 INFO L290 TraceCheckUtils]: 38: Hoare triple {1868#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1872#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:39:46,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {1872#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1749#false} is VALID [2022-04-27 17:39:46,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {1749#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1749#false} is VALID [2022-04-27 17:39:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 17:39:46,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:39:46,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:39:46,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075402800] [2022-04-27 17:39:46,319 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:39:46,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862157961] [2022-04-27 17:39:46,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862157961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:39:46,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:39:46,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 17:39:46,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914028719] [2022-04-27 17:39:46,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:39:46,321 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-27 17:39:46,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:39:46,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 17:39:46,345 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-27 17:39:46,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 17:39:46,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:39:46,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 17:39:46,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-27 17:39:46,346 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 17:39:46,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:46,629 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-27 17:39:46,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 17:39:46,629 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-27 17:39:46,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:39:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 17:39:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-27 17:39:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 17:39:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-27 17:39:46,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-27 17:39:46,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:39:46,674 INFO L225 Difference]: With dead ends: 82 [2022-04-27 17:39:46,674 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 17:39:46,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 17:39:46,675 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:39:46,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:39:46,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 17:39:46,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-27 17:39:46,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:39:46,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 17:39:46,680 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 17:39:46,681 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 17:39:46,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:46,684 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-27 17:39:46,684 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-27 17:39:46,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:46,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:46,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-27 17:39:46,685 INFO L87 Difference]: Start difference. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-27 17:39:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:46,691 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-27 17:39:46,691 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-27 17:39:46,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:46,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:46,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:39:46,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:39:46,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 17:39:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2022-04-27 17:39:46,697 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 41 [2022-04-27 17:39:46,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:39:46,698 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2022-04-27 17:39:46,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 17:39:46,698 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-27 17:39:46,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 17:39:46,712 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:39:46,712 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:39:46,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 17:39:46,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:39:46,930 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:39:46,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:39:46,931 INFO L85 PathProgramCache]: Analyzing trace with hash 800232443, now seen corresponding path program 1 times [2022-04-27 17:39:46,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:39:46,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566901684] [2022-04-27 17:39:46,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:46,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:39:46,947 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:39:46,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2080369720] [2022-04-27 17:39:46,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:46,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:39:46,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:39:46,948 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:39:46,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 17:39:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:47,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 17:39:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:47,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:39:47,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {2212#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:47,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {2212#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {2212#true} is VALID [2022-04-27 17:39:47,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {2212#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:47,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2212#true} {2212#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:47,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {2212#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:47,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {2212#true} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {2212#true} is VALID [2022-04-27 17:39:47,224 INFO L272 TraceCheckUtils]: 6: Hoare triple {2212#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2212#true} is VALID [2022-04-27 17:39:47,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {2212#true} [104] assume_abort_if_notENTRY-->L12: 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] {2212#true} is VALID [2022-04-27 17:39:47,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {2212#true} [108] L12-->L12-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[] {2212#true} is VALID [2022-04-27 17:39:47,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {2212#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:47,224 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2212#true} {2212#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2212#true} is VALID [2022-04-27 17:39:47,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {2212#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {2212#true} is VALID [2022-04-27 17:39:47,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {2212#true} [106] L37-3-->L37-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] {2212#true} is VALID [2022-04-27 17:39:47,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {2212#true} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2212#true} is VALID [2022-04-27 17:39:47,225 INFO L272 TraceCheckUtils]: 14: Hoare triple {2212#true} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2212#true} is VALID [2022-04-27 17:39:47,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {2212#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2212#true} is VALID [2022-04-27 17:39:47,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {2212#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:47,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {2212#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:47,226 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2212#true} {2212#true} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2212#true} is VALID [2022-04-27 17:39:47,226 INFO L272 TraceCheckUtils]: 19: Hoare triple {2212#true} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2212#true} is VALID [2022-04-27 17:39:47,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {2212#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2212#true} is VALID [2022-04-27 17:39:47,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {2212#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:47,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {2212#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:47,226 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2212#true} {2212#true} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2212#true} is VALID [2022-04-27 17:39:47,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {2212#true} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2212#true} is VALID [2022-04-27 17:39:47,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {2212#true} [126] L46-3-->L46-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] {2212#true} is VALID [2022-04-27 17:39:47,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {2212#true} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 100) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2212#true} is VALID [2022-04-27 17:39:47,227 INFO L272 TraceCheckUtils]: 27: Hoare triple {2212#true} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2212#true} is VALID [2022-04-27 17:39:47,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {2212#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2301#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:39:47,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {2301#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2305#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:39:47,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {2305#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2305#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:39:47,230 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2305#(not (= |__VERIFIER_assert_#in~cond| 0))} {2212#true} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2312#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-27 17:39:47,230 INFO L272 TraceCheckUtils]: 32: Hoare triple {2312#(= main_~b~0 (* main_~a~0 main_~y~0))} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2212#true} is VALID [2022-04-27 17:39:47,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {2212#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2212#true} is VALID [2022-04-27 17:39:47,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {2212#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:47,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {2212#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:47,231 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2212#true} {2312#(= main_~b~0 (* main_~a~0 main_~y~0))} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2312#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-27 17:39:47,232 INFO L272 TraceCheckUtils]: 37: Hoare triple {2312#(= main_~b~0 (* main_~a~0 main_~y~0))} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2212#true} is VALID [2022-04-27 17:39:47,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {2212#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2212#true} is VALID [2022-04-27 17:39:47,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {2212#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:47,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {2212#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:47,234 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2212#true} {2312#(= main_~b~0 (* main_~a~0 main_~y~0))} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2312#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-27 17:39:47,234 INFO L290 TraceCheckUtils]: 42: Hoare triple {2312#(= main_~b~0 (* main_~a~0 main_~y~0))} [130] L49-->L54: Formula: (<= (* v_main_~b~0_7 2) v_main_~r~0_9) InVars {main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2346#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-27 17:39:47,235 INFO L272 TraceCheckUtils]: 43: Hoare triple {2346#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} [135] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {2350#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:39:47,235 INFO L290 TraceCheckUtils]: 44: Hoare triple {2350#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2354#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:39:47,236 INFO L290 TraceCheckUtils]: 45: Hoare triple {2354#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2213#false} is VALID [2022-04-27 17:39:47,236 INFO L290 TraceCheckUtils]: 46: Hoare triple {2213#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2213#false} is VALID [2022-04-27 17:39:47,236 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 17:39:47,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 17:39:50,214 INFO L290 TraceCheckUtils]: 46: Hoare triple {2213#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2213#false} is VALID [2022-04-27 17:39:50,215 INFO L290 TraceCheckUtils]: 45: Hoare triple {2354#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2213#false} is VALID [2022-04-27 17:39:50,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {2350#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2354#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:39:50,216 INFO L272 TraceCheckUtils]: 43: Hoare triple {2346#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} [135] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {2350#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:39:50,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {2373#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [130] L49-->L54: Formula: (<= (* v_main_~b~0_7 2) v_main_~r~0_9) InVars {main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {2346#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-27 17:39:50,217 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2212#true} {2373#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2373#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-27 17:39:50,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {2212#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:50,218 INFO L290 TraceCheckUtils]: 39: Hoare triple {2212#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:50,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {2212#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2212#true} is VALID [2022-04-27 17:39:50,218 INFO L272 TraceCheckUtils]: 37: Hoare triple {2373#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2212#true} is VALID [2022-04-27 17:39:50,223 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2212#true} {2373#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2373#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-27 17:39:50,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {2212#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:50,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {2212#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:50,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {2212#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2212#true} is VALID [2022-04-27 17:39:50,224 INFO L272 TraceCheckUtils]: 32: Hoare triple {2373#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2212#true} is VALID [2022-04-27 17:39:50,225 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2305#(not (= |__VERIFIER_assert_#in~cond| 0))} {2212#true} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2373#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-27 17:39:50,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {2305#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2305#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:39:50,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {2416#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2305#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:39:50,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {2212#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2416#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 17:39:50,226 INFO L272 TraceCheckUtils]: 27: Hoare triple {2212#true} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2212#true} is VALID [2022-04-27 17:39:50,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {2212#true} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 100) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2212#true} is VALID [2022-04-27 17:39:50,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {2212#true} [126] L46-3-->L46-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] {2212#true} is VALID [2022-04-27 17:39:50,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {2212#true} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2212#true} is VALID [2022-04-27 17:39:50,227 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2212#true} {2212#true} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2212#true} is VALID [2022-04-27 17:39:50,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {2212#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:50,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {2212#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:50,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {2212#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2212#true} is VALID [2022-04-27 17:39:50,227 INFO L272 TraceCheckUtils]: 19: Hoare triple {2212#true} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2212#true} is VALID [2022-04-27 17:39:50,228 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2212#true} {2212#true} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2212#true} is VALID [2022-04-27 17:39:50,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {2212#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:50,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {2212#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:50,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {2212#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2212#true} is VALID [2022-04-27 17:39:50,228 INFO L272 TraceCheckUtils]: 14: Hoare triple {2212#true} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2212#true} is VALID [2022-04-27 17:39:50,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {2212#true} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2212#true} is VALID [2022-04-27 17:39:50,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {2212#true} [106] L37-3-->L37-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] {2212#true} is VALID [2022-04-27 17:39:50,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {2212#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {2212#true} is VALID [2022-04-27 17:39:50,228 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2212#true} {2212#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2212#true} is VALID [2022-04-27 17:39:50,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {2212#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:50,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {2212#true} [108] L12-->L12-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[] {2212#true} is VALID [2022-04-27 17:39:50,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {2212#true} [104] assume_abort_if_notENTRY-->L12: 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] {2212#true} is VALID [2022-04-27 17:39:50,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {2212#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2212#true} is VALID [2022-04-27 17:39:50,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {2212#true} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {2212#true} is VALID [2022-04-27 17:39:50,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {2212#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:50,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2212#true} {2212#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:50,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {2212#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:50,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {2212#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {2212#true} is VALID [2022-04-27 17:39:50,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {2212#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2212#true} is VALID [2022-04-27 17:39:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 17:39:50,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:39:50,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566901684] [2022-04-27 17:39:50,230 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:39:50,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080369720] [2022-04-27 17:39:50,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080369720] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 17:39:50,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 17:39:50,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 17:39:50,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988274802] [2022-04-27 17:39:50,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 17:39:50,232 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 47 [2022-04-27 17:39:50,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:39:50,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 17:39:50,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:39:50,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 17:39:50,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:39:50,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 17:39:50,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 17:39:50,265 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 17:39:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:50,540 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-27 17:39:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 17:39:50,540 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 47 [2022-04-27 17:39:50,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:39:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 17:39:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-27 17:39:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 17:39:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-27 17:39:50,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-27 17:39:50,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:39:50,591 INFO L225 Difference]: With dead ends: 86 [2022-04-27 17:39:50,591 INFO L226 Difference]: Without dead ends: 86 [2022-04-27 17:39:50,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-27 17:39:50,592 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 37 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:39:50,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 98 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:39:50,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-27 17:39:50,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-27 17:39:50,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:39:50,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 17:39:50,597 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 17:39:50,597 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 17:39:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:50,605 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-27 17:39:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-27 17:39:50,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:50,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:50,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-27 17:39:50,606 INFO L87 Difference]: Start difference. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-27 17:39:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:50,610 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-27 17:39:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-27 17:39:50,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:50,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:50,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:39:50,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:39:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 17:39:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2022-04-27 17:39:50,615 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 47 [2022-04-27 17:39:50,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:39:50,615 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2022-04-27 17:39:50,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 17:39:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-27 17:39:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 17:39:50,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:39:50,616 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:39:50,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 17:39:50,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:39:50,832 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:39:50,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:39:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1984817020, now seen corresponding path program 1 times [2022-04-27 17:39:50,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:39:50,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836068527] [2022-04-27 17:39:50,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:50,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:39:50,845 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:39:50,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [92285185] [2022-04-27 17:39:50,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:50,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:39:50,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:39:50,847 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:39:50,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 17:39:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:50,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 17:39:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:50,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:39:51,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {2853#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2853#true} is VALID [2022-04-27 17:39:51,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {2853#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {2861#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:51,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {2861#(<= ~counter~0 0)} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2861#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:51,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2861#(<= ~counter~0 0)} {2853#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2861#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:51,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {2861#(<= ~counter~0 0)} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2861#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:51,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {2861#(<= ~counter~0 0)} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {2861#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:51,186 INFO L272 TraceCheckUtils]: 6: Hoare triple {2861#(<= ~counter~0 0)} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2861#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:51,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {2861#(<= ~counter~0 0)} [104] assume_abort_if_notENTRY-->L12: 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] {2861#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:51,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {2861#(<= ~counter~0 0)} [108] L12-->L12-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[] {2861#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:51,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {2861#(<= ~counter~0 0)} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2861#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:51,187 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2861#(<= ~counter~0 0)} {2861#(<= ~counter~0 0)} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2861#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:51,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {2861#(<= ~counter~0 0)} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {2861#(<= ~counter~0 0)} is VALID [2022-04-27 17:39:51,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {2861#(<= ~counter~0 0)} [106] L37-3-->L37-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] {2895#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:51,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {2895#(<= ~counter~0 1)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2895#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:51,190 INFO L272 TraceCheckUtils]: 14: Hoare triple {2895#(<= ~counter~0 1)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2895#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:51,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {2895#(<= ~counter~0 1)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2895#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:51,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {2895#(<= ~counter~0 1)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2895#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:51,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {2895#(<= ~counter~0 1)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2895#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:51,191 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2895#(<= ~counter~0 1)} {2895#(<= ~counter~0 1)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2895#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:51,192 INFO L272 TraceCheckUtils]: 19: Hoare triple {2895#(<= ~counter~0 1)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2895#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:51,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {2895#(<= ~counter~0 1)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2895#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:51,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {2895#(<= ~counter~0 1)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2895#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:51,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {2895#(<= ~counter~0 1)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2895#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:51,194 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2895#(<= ~counter~0 1)} {2895#(<= ~counter~0 1)} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2895#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:51,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {2895#(<= ~counter~0 1)} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2895#(<= ~counter~0 1)} is VALID [2022-04-27 17:39:51,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {2895#(<= ~counter~0 1)} [126] L46-3-->L46-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] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {2935#(<= ~counter~0 2)} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 100) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,195 INFO L272 TraceCheckUtils]: 27: Hoare triple {2935#(<= ~counter~0 2)} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {2935#(<= ~counter~0 2)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {2935#(<= ~counter~0 2)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {2935#(<= ~counter~0 2)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,197 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2935#(<= ~counter~0 2)} {2935#(<= ~counter~0 2)} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,198 INFO L272 TraceCheckUtils]: 32: Hoare triple {2935#(<= ~counter~0 2)} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,198 INFO L290 TraceCheckUtils]: 33: Hoare triple {2935#(<= ~counter~0 2)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {2935#(<= ~counter~0 2)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {2935#(<= ~counter~0 2)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,200 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2935#(<= ~counter~0 2)} {2935#(<= ~counter~0 2)} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,200 INFO L272 TraceCheckUtils]: 37: Hoare triple {2935#(<= ~counter~0 2)} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,200 INFO L290 TraceCheckUtils]: 38: Hoare triple {2935#(<= ~counter~0 2)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,201 INFO L290 TraceCheckUtils]: 39: Hoare triple {2935#(<= ~counter~0 2)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {2935#(<= ~counter~0 2)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,201 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2935#(<= ~counter~0 2)} {2935#(<= ~counter~0 2)} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {2935#(<= ~counter~0 2)} [129] L49-->L46-4: Formula: (not (<= (* v_main_~b~0_6 2) v_main_~r~0_8)) InVars {main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,202 INFO L290 TraceCheckUtils]: 43: Hoare triple {2935#(<= ~counter~0 2)} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {2935#(<= ~counter~0 2)} is VALID [2022-04-27 17:39:51,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {2935#(<= ~counter~0 2)} [106] L37-3-->L37-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] {2993#(<= |main_#t~post6| 2)} is VALID [2022-04-27 17:39:51,203 INFO L290 TraceCheckUtils]: 45: Hoare triple {2993#(<= |main_#t~post6| 2)} [110] L37-1-->L37-4: Formula: (not (< |v_main_#t~post6_3| 100)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2854#false} is VALID [2022-04-27 17:39:51,204 INFO L272 TraceCheckUtils]: 46: Hoare triple {2854#false} [109] L37-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_10 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_19))) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_19, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2854#false} is VALID [2022-04-27 17:39:51,204 INFO L290 TraceCheckUtils]: 47: Hoare triple {2854#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2854#false} is VALID [2022-04-27 17:39:51,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {2854#false} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2854#false} is VALID [2022-04-27 17:39:51,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {2854#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2854#false} is VALID [2022-04-27 17:39:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 17:39:51,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 17:39:51,445 INFO L290 TraceCheckUtils]: 49: Hoare triple {2854#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2854#false} is VALID [2022-04-27 17:39:51,445 INFO L290 TraceCheckUtils]: 48: Hoare triple {2854#false} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2854#false} is VALID [2022-04-27 17:39:51,445 INFO L290 TraceCheckUtils]: 47: Hoare triple {2854#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2854#false} is VALID [2022-04-27 17:39:51,446 INFO L272 TraceCheckUtils]: 46: Hoare triple {2854#false} [109] L37-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_10 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_19))) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_19, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2854#false} is VALID [2022-04-27 17:39:51,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {3021#(< |main_#t~post6| 100)} [110] L37-1-->L37-4: Formula: (not (< |v_main_#t~post6_3| 100)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2854#false} is VALID [2022-04-27 17:39:51,447 INFO L290 TraceCheckUtils]: 44: Hoare triple {3025#(< ~counter~0 100)} [106] L37-3-->L37-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] {3021#(< |main_#t~post6| 100)} is VALID [2022-04-27 17:39:51,447 INFO L290 TraceCheckUtils]: 43: Hoare triple {3025#(< ~counter~0 100)} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {3025#(< ~counter~0 100)} is VALID [2022-04-27 17:39:51,447 INFO L290 TraceCheckUtils]: 42: Hoare triple {3025#(< ~counter~0 100)} [129] L49-->L46-4: Formula: (not (<= (* v_main_~b~0_6 2) v_main_~r~0_8)) InVars {main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {3025#(< ~counter~0 100)} is VALID [2022-04-27 17:39:51,448 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2853#true} {3025#(< ~counter~0 100)} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {3025#(< ~counter~0 100)} is VALID [2022-04-27 17:39:51,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {2853#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2853#true} is VALID [2022-04-27 17:39:51,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {2853#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2853#true} is VALID [2022-04-27 17:39:51,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {2853#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2853#true} is VALID [2022-04-27 17:39:51,449 INFO L272 TraceCheckUtils]: 37: Hoare triple {3025#(< ~counter~0 100)} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2853#true} is VALID [2022-04-27 17:39:51,449 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2853#true} {3025#(< ~counter~0 100)} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3025#(< ~counter~0 100)} is VALID [2022-04-27 17:39:51,449 INFO L290 TraceCheckUtils]: 35: Hoare triple {2853#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2853#true} is VALID [2022-04-27 17:39:51,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {2853#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2853#true} is VALID [2022-04-27 17:39:51,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {2853#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2853#true} is VALID [2022-04-27 17:39:51,450 INFO L272 TraceCheckUtils]: 32: Hoare triple {3025#(< ~counter~0 100)} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2853#true} is VALID [2022-04-27 17:39:51,450 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2853#true} {3025#(< ~counter~0 100)} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3025#(< ~counter~0 100)} is VALID [2022-04-27 17:39:51,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {2853#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2853#true} is VALID [2022-04-27 17:39:51,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {2853#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2853#true} is VALID [2022-04-27 17:39:51,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {2853#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2853#true} is VALID [2022-04-27 17:39:51,451 INFO L272 TraceCheckUtils]: 27: Hoare triple {3025#(< ~counter~0 100)} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2853#true} is VALID [2022-04-27 17:39:51,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {3025#(< ~counter~0 100)} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 100) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3025#(< ~counter~0 100)} is VALID [2022-04-27 17:39:51,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {3083#(< ~counter~0 99)} [126] L46-3-->L46-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] {3025#(< ~counter~0 100)} is VALID [2022-04-27 17:39:51,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {3083#(< ~counter~0 99)} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {3083#(< ~counter~0 99)} is VALID [2022-04-27 17:39:51,453 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2853#true} {3083#(< ~counter~0 99)} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3083#(< ~counter~0 99)} is VALID [2022-04-27 17:39:51,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {2853#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2853#true} is VALID [2022-04-27 17:39:51,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {2853#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2853#true} is VALID [2022-04-27 17:39:51,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {2853#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2853#true} is VALID [2022-04-27 17:39:51,454 INFO L272 TraceCheckUtils]: 19: Hoare triple {3083#(< ~counter~0 99)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2853#true} is VALID [2022-04-27 17:39:51,454 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2853#true} {3083#(< ~counter~0 99)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3083#(< ~counter~0 99)} is VALID [2022-04-27 17:39:51,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {2853#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2853#true} is VALID [2022-04-27 17:39:51,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {2853#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2853#true} is VALID [2022-04-27 17:39:51,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {2853#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2853#true} is VALID [2022-04-27 17:39:51,455 INFO L272 TraceCheckUtils]: 14: Hoare triple {3083#(< ~counter~0 99)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2853#true} is VALID [2022-04-27 17:39:51,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {3083#(< ~counter~0 99)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3083#(< ~counter~0 99)} is VALID [2022-04-27 17:39:51,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {3123#(< ~counter~0 98)} [106] L37-3-->L37-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] {3083#(< ~counter~0 99)} is VALID [2022-04-27 17:39:51,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {3123#(< ~counter~0 98)} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {3123#(< ~counter~0 98)} is VALID [2022-04-27 17:39:51,457 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2853#true} {3123#(< ~counter~0 98)} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3123#(< ~counter~0 98)} is VALID [2022-04-27 17:39:51,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {2853#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2853#true} is VALID [2022-04-27 17:39:51,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {2853#true} [108] L12-->L12-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[] {2853#true} is VALID [2022-04-27 17:39:51,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {2853#true} [104] assume_abort_if_notENTRY-->L12: 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] {2853#true} is VALID [2022-04-27 17:39:51,457 INFO L272 TraceCheckUtils]: 6: Hoare triple {3123#(< ~counter~0 98)} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2853#true} is VALID [2022-04-27 17:39:51,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {3123#(< ~counter~0 98)} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {3123#(< ~counter~0 98)} is VALID [2022-04-27 17:39:51,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {3123#(< ~counter~0 98)} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3123#(< ~counter~0 98)} is VALID [2022-04-27 17:39:51,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3123#(< ~counter~0 98)} {2853#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3123#(< ~counter~0 98)} is VALID [2022-04-27 17:39:51,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {3123#(< ~counter~0 98)} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3123#(< ~counter~0 98)} is VALID [2022-04-27 17:39:51,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {2853#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {3123#(< ~counter~0 98)} is VALID [2022-04-27 17:39:51,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {2853#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2853#true} is VALID [2022-04-27 17:39:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 17:39:51,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:39:51,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836068527] [2022-04-27 17:39:51,460 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:39:51,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92285185] [2022-04-27 17:39:51,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92285185] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 17:39:51,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 17:39:51,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 17:39:51,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28189518] [2022-04-27 17:39:51,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 17:39:51,461 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 50 [2022-04-27 17:39:51,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:39:51,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 17:39:51,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:39:51,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 17:39:51,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:39:51,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 17:39:51,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 17:39:51,519 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 17:39:51,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:51,972 INFO L93 Difference]: Finished difference Result 250 states and 299 transitions. [2022-04-27 17:39:51,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 17:39:51,972 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 50 [2022-04-27 17:39:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:39:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 17:39:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 163 transitions. [2022-04-27 17:39:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 17:39:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 163 transitions. [2022-04-27 17:39:51,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 163 transitions. [2022-04-27 17:39:52,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:39:52,111 INFO L225 Difference]: With dead ends: 250 [2022-04-27 17:39:52,112 INFO L226 Difference]: Without dead ends: 250 [2022-04-27 17:39:52,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-04-27 17:39:52,112 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 96 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:39:52,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 234 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:39:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-04-27 17:39:52,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 239. [2022-04-27 17:39:52,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:39:52,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand has 239 states, 153 states have (on average 1.1895424836601307) internal successors, (182), 161 states have internal predecessors, (182), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 17:39:52,125 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand has 239 states, 153 states have (on average 1.1895424836601307) internal successors, (182), 161 states have internal predecessors, (182), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 17:39:52,125 INFO L87 Difference]: Start difference. First operand 250 states. Second operand has 239 states, 153 states have (on average 1.1895424836601307) internal successors, (182), 161 states have internal predecessors, (182), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 17:39:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:52,133 INFO L93 Difference]: Finished difference Result 250 states and 299 transitions. [2022-04-27 17:39:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 299 transitions. [2022-04-27 17:39:52,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:52,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:52,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 153 states have (on average 1.1895424836601307) internal successors, (182), 161 states have internal predecessors, (182), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) Second operand 250 states. [2022-04-27 17:39:52,135 INFO L87 Difference]: Start difference. First operand has 239 states, 153 states have (on average 1.1895424836601307) internal successors, (182), 161 states have internal predecessors, (182), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) Second operand 250 states. [2022-04-27 17:39:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:39:52,142 INFO L93 Difference]: Finished difference Result 250 states and 299 transitions. [2022-04-27 17:39:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 299 transitions. [2022-04-27 17:39:52,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:39:52,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:39:52,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:39:52,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:39:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 153 states have (on average 1.1895424836601307) internal successors, (182), 161 states have internal predecessors, (182), 57 states have call successors, (57), 29 states have call predecessors, (57), 28 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 17:39:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 291 transitions. [2022-04-27 17:39:52,150 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 291 transitions. Word has length 50 [2022-04-27 17:39:52,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:39:52,150 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 291 transitions. [2022-04-27 17:39:52,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 17:39:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 291 transitions. [2022-04-27 17:39:52,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 17:39:52,151 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:39:52,151 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:39:52,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 17:39:52,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 17:39:52,367 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:39:52,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:39:52,368 INFO L85 PathProgramCache]: Analyzing trace with hash 960315114, now seen corresponding path program 1 times [2022-04-27 17:39:52,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:39:52,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186106980] [2022-04-27 17:39:52,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:52,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:39:52,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:39:52,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939430677] [2022-04-27 17:39:52,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:39:52,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:39:52,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:39:52,382 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:39:52,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 17:39:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:52,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 17:39:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:39:52,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:39:52,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {4159#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4159#true} is VALID [2022-04-27 17:39:52,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {4159#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {4159#true} is VALID [2022-04-27 17:39:52,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {4159#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4159#true} is VALID [2022-04-27 17:39:52,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4159#true} {4159#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4159#true} is VALID [2022-04-27 17:39:52,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {4159#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4159#true} is VALID [2022-04-27 17:39:52,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {4159#true} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {4159#true} is VALID [2022-04-27 17:39:52,986 INFO L272 TraceCheckUtils]: 6: Hoare triple {4159#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4159#true} is VALID [2022-04-27 17:39:52,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {4159#true} [104] assume_abort_if_notENTRY-->L12: 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] {4159#true} is VALID [2022-04-27 17:39:52,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {4159#true} [108] L12-->L12-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[] {4159#true} is VALID [2022-04-27 17:39:52,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {4159#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4159#true} is VALID [2022-04-27 17:39:52,987 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4159#true} {4159#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4159#true} is VALID [2022-04-27 17:39:52,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {4159#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {4197#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:39:52,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {4197#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [106] L37-3-->L37-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] {4197#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:39:52,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {4197#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4197#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:39:52,990 INFO L272 TraceCheckUtils]: 14: Hoare triple {4197#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {4159#true} is VALID [2022-04-27 17:39:52,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {4159#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4159#true} is VALID [2022-04-27 17:39:52,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {4159#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4159#true} is VALID [2022-04-27 17:39:52,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {4159#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4159#true} is VALID [2022-04-27 17:39:52,991 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4159#true} {4197#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {4197#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:39:52,991 INFO L272 TraceCheckUtils]: 19: Hoare triple {4197#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {4159#true} is VALID [2022-04-27 17:39:52,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {4159#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4159#true} is VALID [2022-04-27 17:39:52,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {4159#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4159#true} is VALID [2022-04-27 17:39:52,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {4159#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4159#true} is VALID [2022-04-27 17:39:52,992 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4159#true} {4197#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {4197#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:39:52,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {4197#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {4237#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:39:52,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {4237#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [126] L46-3-->L46-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] {4237#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:39:52,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {4237#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 100) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4237#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:39:52,993 INFO L272 TraceCheckUtils]: 27: Hoare triple {4237#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {4159#true} is VALID [2022-04-27 17:39:52,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {4159#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4159#true} is VALID [2022-04-27 17:39:52,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {4159#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4159#true} is VALID [2022-04-27 17:39:52,994 INFO L290 TraceCheckUtils]: 30: Hoare triple {4159#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4159#true} is VALID [2022-04-27 17:39:52,994 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4159#true} {4237#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {4237#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:39:52,995 INFO L272 TraceCheckUtils]: 32: Hoare triple {4237#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {4159#true} is VALID [2022-04-27 17:39:52,995 INFO L290 TraceCheckUtils]: 33: Hoare triple {4159#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4159#true} is VALID [2022-04-27 17:39:52,995 INFO L290 TraceCheckUtils]: 34: Hoare triple {4159#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4159#true} is VALID [2022-04-27 17:39:52,995 INFO L290 TraceCheckUtils]: 35: Hoare triple {4159#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4159#true} is VALID [2022-04-27 17:39:52,996 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4159#true} {4237#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {4237#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:39:52,996 INFO L272 TraceCheckUtils]: 37: Hoare triple {4237#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {4159#true} is VALID [2022-04-27 17:39:52,996 INFO L290 TraceCheckUtils]: 38: Hoare triple {4159#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4159#true} is VALID [2022-04-27 17:39:52,996 INFO L290 TraceCheckUtils]: 39: Hoare triple {4159#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4159#true} is VALID [2022-04-27 17:39:52,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {4159#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4159#true} is VALID [2022-04-27 17:39:52,997 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4159#true} {4237#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {4237#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:39:52,997 INFO L290 TraceCheckUtils]: 42: Hoare triple {4237#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [129] L49-->L46-4: Formula: (not (<= (* v_main_~b~0_6 2) v_main_~r~0_8)) InVars {main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {4292#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:39:52,998 INFO L290 TraceCheckUtils]: 43: Hoare triple {4292#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {4296#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (not (<= (* main_~b~0 2) main_~x~0)) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-27 17:39:52,999 INFO L290 TraceCheckUtils]: 44: Hoare triple {4296#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (not (<= (* main_~b~0 2) main_~x~0)) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0) (<= main_~y~0 main_~x~0))} [106] L37-3-->L37-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] {4296#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (not (<= (* main_~b~0 2) main_~x~0)) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-27 17:39:52,999 INFO L290 TraceCheckUtils]: 45: Hoare triple {4296#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (not (<= (* main_~b~0 2) main_~x~0)) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0) (<= main_~y~0 main_~x~0))} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4296#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (not (<= (* main_~b~0 2) main_~x~0)) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-27 17:39:52,999 INFO L272 TraceCheckUtils]: 46: Hoare triple {4296#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (not (<= (* main_~b~0 2) main_~x~0)) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0) (<= main_~y~0 main_~x~0))} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {4159#true} is VALID [2022-04-27 17:39:53,000 INFO L290 TraceCheckUtils]: 47: Hoare triple {4159#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4309#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:39:53,000 INFO L290 TraceCheckUtils]: 48: Hoare triple {4309#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4313#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:39:53,000 INFO L290 TraceCheckUtils]: 49: Hoare triple {4313#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4313#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:39:53,001 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4313#(not (= |__VERIFIER_assert_#in~cond| 0))} {4296#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (not (<= (* main_~b~0 2) main_~x~0)) (= main_~b~0 main_~y~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0) (<= main_~y~0 main_~x~0))} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {4320#(and (< main_~x~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} is VALID [2022-04-27 17:39:53,002 INFO L272 TraceCheckUtils]: 51: Hoare triple {4320#(and (< main_~x~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {4324#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:39:53,002 INFO L290 TraceCheckUtils]: 52: Hoare triple {4324#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4328#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:39:53,003 INFO L290 TraceCheckUtils]: 53: Hoare triple {4328#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {4160#false} is VALID [2022-04-27 17:39:53,003 INFO L290 TraceCheckUtils]: 54: Hoare triple {4160#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4160#false} is VALID [2022-04-27 17:39:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 17:39:53,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 17:40:42,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:40:42,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186106980] [2022-04-27 17:40:42,233 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:40:42,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939430677] [2022-04-27 17:40:42,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939430677] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 17:40:42,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 17:40:42,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 17:40:42,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671934755] [2022-04-27 17:40:42,233 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 17:40:42,234 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-27 17:40:42,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:40:42,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 17:40:42,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:40:42,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 17:40:42,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:40:42,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 17:40:42,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-27 17:40:42,283 INFO L87 Difference]: Start difference. First operand 239 states and 291 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 17:40:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:40:42,973 INFO L93 Difference]: Finished difference Result 218 states and 257 transitions. [2022-04-27 17:40:42,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 17:40:42,973 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-27 17:40:42,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:40:42,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 17:40:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-27 17:40:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 17:40:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-27 17:40:42,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 91 transitions. [2022-04-27 17:40:43,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:40:43,067 INFO L225 Difference]: With dead ends: 218 [2022-04-27 17:40:43,067 INFO L226 Difference]: Without dead ends: 203 [2022-04-27 17:40:43,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-27 17:40:43,068 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 24 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 17:40:43,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 183 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 17:40:43,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-04-27 17:40:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2022-04-27 17:40:43,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:40:43,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 202 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 136 states have internal predecessors, (152), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 17:40:43,078 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 202 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 136 states have internal predecessors, (152), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 17:40:43,078 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 202 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 136 states have internal predecessors, (152), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 17:40:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:40:43,083 INFO L93 Difference]: Finished difference Result 203 states and 241 transitions. [2022-04-27 17:40:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 241 transitions. [2022-04-27 17:40:43,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:40:43,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:40:43,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 202 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 136 states have internal predecessors, (152), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) Second operand 203 states. [2022-04-27 17:40:43,085 INFO L87 Difference]: Start difference. First operand has 202 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 136 states have internal predecessors, (152), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) Second operand 203 states. [2022-04-27 17:40:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:40:43,111 INFO L93 Difference]: Finished difference Result 203 states and 241 transitions. [2022-04-27 17:40:43,112 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 241 transitions. [2022-04-27 17:40:43,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:40:43,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:40:43,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:40:43,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:40:43,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 136 states have internal predecessors, (152), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 17:40:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 240 transitions. [2022-04-27 17:40:43,117 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 240 transitions. Word has length 55 [2022-04-27 17:40:43,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:40:43,117 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 240 transitions. [2022-04-27 17:40:43,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 17:40:43,118 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 240 transitions. [2022-04-27 17:40:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 17:40:43,118 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:40:43,118 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:40:43,143 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-27 17:40:43,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 17:40:43,325 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:40:43,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:40:43,326 INFO L85 PathProgramCache]: Analyzing trace with hash 136506131, now seen corresponding path program 1 times [2022-04-27 17:40:43,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:40:43,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781639779] [2022-04-27 17:40:43,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:40:43,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:40:43,347 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:40:43,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1119932507] [2022-04-27 17:40:43,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:40:43,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:40:43,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:40:43,352 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:40:43,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 17:40:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:40:43,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 17:40:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:40:43,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:40:43,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {5265#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:43,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {5265#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {5273#(<= ~counter~0 0)} is VALID [2022-04-27 17:40:43,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {5273#(<= ~counter~0 0)} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5273#(<= ~counter~0 0)} is VALID [2022-04-27 17:40:43,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5273#(<= ~counter~0 0)} {5265#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5273#(<= ~counter~0 0)} is VALID [2022-04-27 17:40:43,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {5273#(<= ~counter~0 0)} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5273#(<= ~counter~0 0)} is VALID [2022-04-27 17:40:43,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {5273#(<= ~counter~0 0)} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {5273#(<= ~counter~0 0)} is VALID [2022-04-27 17:40:43,672 INFO L272 TraceCheckUtils]: 6: Hoare triple {5273#(<= ~counter~0 0)} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5273#(<= ~counter~0 0)} is VALID [2022-04-27 17:40:43,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {5273#(<= ~counter~0 0)} [104] assume_abort_if_notENTRY-->L12: 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] {5273#(<= ~counter~0 0)} is VALID [2022-04-27 17:40:43,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {5273#(<= ~counter~0 0)} [108] L12-->L12-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[] {5273#(<= ~counter~0 0)} is VALID [2022-04-27 17:40:43,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {5273#(<= ~counter~0 0)} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5273#(<= ~counter~0 0)} is VALID [2022-04-27 17:40:43,673 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5273#(<= ~counter~0 0)} {5273#(<= ~counter~0 0)} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5273#(<= ~counter~0 0)} is VALID [2022-04-27 17:40:43,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {5273#(<= ~counter~0 0)} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {5273#(<= ~counter~0 0)} is VALID [2022-04-27 17:40:43,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {5273#(<= ~counter~0 0)} [106] L37-3-->L37-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] {5307#(<= ~counter~0 1)} is VALID [2022-04-27 17:40:43,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {5307#(<= ~counter~0 1)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5307#(<= ~counter~0 1)} is VALID [2022-04-27 17:40:43,675 INFO L272 TraceCheckUtils]: 14: Hoare triple {5307#(<= ~counter~0 1)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {5307#(<= ~counter~0 1)} is VALID [2022-04-27 17:40:43,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {5307#(<= ~counter~0 1)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5307#(<= ~counter~0 1)} is VALID [2022-04-27 17:40:43,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {5307#(<= ~counter~0 1)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5307#(<= ~counter~0 1)} is VALID [2022-04-27 17:40:43,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {5307#(<= ~counter~0 1)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5307#(<= ~counter~0 1)} is VALID [2022-04-27 17:40:43,677 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5307#(<= ~counter~0 1)} {5307#(<= ~counter~0 1)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {5307#(<= ~counter~0 1)} is VALID [2022-04-27 17:40:43,678 INFO L272 TraceCheckUtils]: 19: Hoare triple {5307#(<= ~counter~0 1)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {5307#(<= ~counter~0 1)} is VALID [2022-04-27 17:40:43,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {5307#(<= ~counter~0 1)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5307#(<= ~counter~0 1)} is VALID [2022-04-27 17:40:43,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {5307#(<= ~counter~0 1)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5307#(<= ~counter~0 1)} is VALID [2022-04-27 17:40:43,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {5307#(<= ~counter~0 1)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5307#(<= ~counter~0 1)} is VALID [2022-04-27 17:40:43,679 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5307#(<= ~counter~0 1)} {5307#(<= ~counter~0 1)} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {5307#(<= ~counter~0 1)} is VALID [2022-04-27 17:40:43,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {5307#(<= ~counter~0 1)} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {5307#(<= ~counter~0 1)} is VALID [2022-04-27 17:40:43,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {5307#(<= ~counter~0 1)} [126] L46-3-->L46-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] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {5347#(<= ~counter~0 2)} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 100) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,681 INFO L272 TraceCheckUtils]: 27: Hoare triple {5347#(<= ~counter~0 2)} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {5347#(<= ~counter~0 2)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {5347#(<= ~counter~0 2)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {5347#(<= ~counter~0 2)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,683 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5347#(<= ~counter~0 2)} {5347#(<= ~counter~0 2)} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,684 INFO L272 TraceCheckUtils]: 32: Hoare triple {5347#(<= ~counter~0 2)} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {5347#(<= ~counter~0 2)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,684 INFO L290 TraceCheckUtils]: 34: Hoare triple {5347#(<= ~counter~0 2)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,685 INFO L290 TraceCheckUtils]: 35: Hoare triple {5347#(<= ~counter~0 2)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,685 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5347#(<= ~counter~0 2)} {5347#(<= ~counter~0 2)} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,686 INFO L272 TraceCheckUtils]: 37: Hoare triple {5347#(<= ~counter~0 2)} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {5347#(<= ~counter~0 2)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {5347#(<= ~counter~0 2)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,687 INFO L290 TraceCheckUtils]: 40: Hoare triple {5347#(<= ~counter~0 2)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,687 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5347#(<= ~counter~0 2)} {5347#(<= ~counter~0 2)} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {5347#(<= ~counter~0 2)} [130] L49-->L54: Formula: (<= (* v_main_~b~0_7 2) v_main_~r~0_9) InVars {main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,688 INFO L272 TraceCheckUtils]: 43: Hoare triple {5347#(<= ~counter~0 2)} [135] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {5347#(<= ~counter~0 2)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {5347#(<= ~counter~0 2)} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {5347#(<= ~counter~0 2)} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,690 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5347#(<= ~counter~0 2)} {5347#(<= ~counter~0 2)} [145] __VERIFIER_assertEXIT-->L54-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,690 INFO L290 TraceCheckUtils]: 48: Hoare triple {5347#(<= ~counter~0 2)} [131] L54-1-->L46-3: Formula: (and (= v_main_~a~0_7 (* v_main_~a~0_8 2)) (= v_main_~b~0_8 (* v_main_~b~0_9 2))) InVars {main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {5347#(<= ~counter~0 2)} is VALID [2022-04-27 17:40:43,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {5347#(<= ~counter~0 2)} [126] L46-3-->L46-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] {5420#(<= |main_#t~post7| 2)} is VALID [2022-04-27 17:40:43,691 INFO L290 TraceCheckUtils]: 50: Hoare triple {5420#(<= |main_#t~post7| 2)} [133] L46-1-->L46-4: Formula: (not (< |v_main_#t~post7_3| 100)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {5266#false} is VALID [2022-04-27 17:40:43,691 INFO L290 TraceCheckUtils]: 51: Hoare triple {5266#false} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {5266#false} is VALID [2022-04-27 17:40:43,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {5266#false} [106] L37-3-->L37-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] {5266#false} is VALID [2022-04-27 17:40:43,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {5266#false} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5266#false} is VALID [2022-04-27 17:40:43,691 INFO L272 TraceCheckUtils]: 54: Hoare triple {5266#false} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {5266#false} is VALID [2022-04-27 17:40:43,691 INFO L290 TraceCheckUtils]: 55: Hoare triple {5266#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5266#false} is VALID [2022-04-27 17:40:43,691 INFO L290 TraceCheckUtils]: 56: Hoare triple {5266#false} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5266#false} is VALID [2022-04-27 17:40:43,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {5266#false} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5266#false} is VALID [2022-04-27 17:40:43,692 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5266#false} {5266#false} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {5266#false} is VALID [2022-04-27 17:40:43,692 INFO L272 TraceCheckUtils]: 59: Hoare triple {5266#false} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {5266#false} is VALID [2022-04-27 17:40:43,692 INFO L290 TraceCheckUtils]: 60: Hoare triple {5266#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5266#false} is VALID [2022-04-27 17:40:43,692 INFO L290 TraceCheckUtils]: 61: Hoare triple {5266#false} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {5266#false} is VALID [2022-04-27 17:40:43,692 INFO L290 TraceCheckUtils]: 62: Hoare triple {5266#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5266#false} is VALID [2022-04-27 17:40:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 40 proven. 34 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 17:40:43,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 17:40:44,029 INFO L290 TraceCheckUtils]: 62: Hoare triple {5266#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5266#false} is VALID [2022-04-27 17:40:44,029 INFO L290 TraceCheckUtils]: 61: Hoare triple {5266#false} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {5266#false} is VALID [2022-04-27 17:40:44,029 INFO L290 TraceCheckUtils]: 60: Hoare triple {5266#false} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5266#false} is VALID [2022-04-27 17:40:44,029 INFO L272 TraceCheckUtils]: 59: Hoare triple {5266#false} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {5266#false} is VALID [2022-04-27 17:40:44,029 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5265#true} {5266#false} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {5266#false} is VALID [2022-04-27 17:40:44,030 INFO L290 TraceCheckUtils]: 57: Hoare triple {5265#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:44,030 INFO L290 TraceCheckUtils]: 56: Hoare triple {5265#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:44,030 INFO L290 TraceCheckUtils]: 55: Hoare triple {5265#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5265#true} is VALID [2022-04-27 17:40:44,032 INFO L272 TraceCheckUtils]: 54: Hoare triple {5266#false} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {5265#true} is VALID [2022-04-27 17:40:44,033 INFO L290 TraceCheckUtils]: 53: Hoare triple {5266#false} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5266#false} is VALID [2022-04-27 17:40:44,033 INFO L290 TraceCheckUtils]: 52: Hoare triple {5266#false} [106] L37-3-->L37-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] {5266#false} is VALID [2022-04-27 17:40:44,033 INFO L290 TraceCheckUtils]: 51: Hoare triple {5266#false} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {5266#false} is VALID [2022-04-27 17:40:44,033 INFO L290 TraceCheckUtils]: 50: Hoare triple {5496#(< |main_#t~post7| 100)} [133] L46-1-->L46-4: Formula: (not (< |v_main_#t~post7_3| 100)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {5266#false} is VALID [2022-04-27 17:40:44,034 INFO L290 TraceCheckUtils]: 49: Hoare triple {5500#(< ~counter~0 100)} [126] L46-3-->L46-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] {5496#(< |main_#t~post7| 100)} is VALID [2022-04-27 17:40:44,034 INFO L290 TraceCheckUtils]: 48: Hoare triple {5500#(< ~counter~0 100)} [131] L54-1-->L46-3: Formula: (and (= v_main_~a~0_7 (* v_main_~a~0_8 2)) (= v_main_~b~0_8 (* v_main_~b~0_9 2))) InVars {main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {5500#(< ~counter~0 100)} is VALID [2022-04-27 17:40:44,035 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5265#true} {5500#(< ~counter~0 100)} [145] __VERIFIER_assertEXIT-->L54-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {5500#(< ~counter~0 100)} is VALID [2022-04-27 17:40:44,035 INFO L290 TraceCheckUtils]: 46: Hoare triple {5265#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:44,035 INFO L290 TraceCheckUtils]: 45: Hoare triple {5265#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:44,035 INFO L290 TraceCheckUtils]: 44: Hoare triple {5265#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5265#true} is VALID [2022-04-27 17:40:44,035 INFO L272 TraceCheckUtils]: 43: Hoare triple {5500#(< ~counter~0 100)} [135] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {5265#true} is VALID [2022-04-27 17:40:44,036 INFO L290 TraceCheckUtils]: 42: Hoare triple {5500#(< ~counter~0 100)} [130] L49-->L54: Formula: (<= (* v_main_~b~0_7 2) v_main_~r~0_9) InVars {main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {5500#(< ~counter~0 100)} is VALID [2022-04-27 17:40:44,036 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5265#true} {5500#(< ~counter~0 100)} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {5500#(< ~counter~0 100)} is VALID [2022-04-27 17:40:44,036 INFO L290 TraceCheckUtils]: 40: Hoare triple {5265#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:44,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {5265#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:44,036 INFO L290 TraceCheckUtils]: 38: Hoare triple {5265#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5265#true} is VALID [2022-04-27 17:40:44,036 INFO L272 TraceCheckUtils]: 37: Hoare triple {5500#(< ~counter~0 100)} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {5265#true} is VALID [2022-04-27 17:40:44,037 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5265#true} {5500#(< ~counter~0 100)} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {5500#(< ~counter~0 100)} is VALID [2022-04-27 17:40:44,037 INFO L290 TraceCheckUtils]: 35: Hoare triple {5265#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:44,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {5265#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:44,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {5265#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5265#true} is VALID [2022-04-27 17:40:44,037 INFO L272 TraceCheckUtils]: 32: Hoare triple {5500#(< ~counter~0 100)} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {5265#true} is VALID [2022-04-27 17:40:44,038 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5265#true} {5500#(< ~counter~0 100)} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {5500#(< ~counter~0 100)} is VALID [2022-04-27 17:40:44,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {5265#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:44,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {5265#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:44,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {5265#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5265#true} is VALID [2022-04-27 17:40:44,038 INFO L272 TraceCheckUtils]: 27: Hoare triple {5500#(< ~counter~0 100)} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {5265#true} is VALID [2022-04-27 17:40:44,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {5500#(< ~counter~0 100)} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 100) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {5500#(< ~counter~0 100)} is VALID [2022-04-27 17:40:44,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {5573#(< ~counter~0 99)} [126] L46-3-->L46-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] {5500#(< ~counter~0 100)} is VALID [2022-04-27 17:40:44,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {5573#(< ~counter~0 99)} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {5573#(< ~counter~0 99)} is VALID [2022-04-27 17:40:44,040 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5265#true} {5573#(< ~counter~0 99)} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {5573#(< ~counter~0 99)} is VALID [2022-04-27 17:40:44,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {5265#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:44,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {5265#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:44,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {5265#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5265#true} is VALID [2022-04-27 17:40:44,041 INFO L272 TraceCheckUtils]: 19: Hoare triple {5573#(< ~counter~0 99)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {5265#true} is VALID [2022-04-27 17:40:44,041 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5265#true} {5573#(< ~counter~0 99)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {5573#(< ~counter~0 99)} is VALID [2022-04-27 17:40:44,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {5265#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:44,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {5265#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:44,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {5265#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5265#true} is VALID [2022-04-27 17:40:44,042 INFO L272 TraceCheckUtils]: 14: Hoare triple {5573#(< ~counter~0 99)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {5265#true} is VALID [2022-04-27 17:40:44,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {5573#(< ~counter~0 99)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5573#(< ~counter~0 99)} is VALID [2022-04-27 17:40:44,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {5613#(< ~counter~0 98)} [106] L37-3-->L37-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] {5573#(< ~counter~0 99)} is VALID [2022-04-27 17:40:44,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {5613#(< ~counter~0 98)} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {5613#(< ~counter~0 98)} is VALID [2022-04-27 17:40:44,043 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5265#true} {5613#(< ~counter~0 98)} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5613#(< ~counter~0 98)} is VALID [2022-04-27 17:40:44,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {5265#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:44,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {5265#true} [108] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:44,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {5265#true} [104] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5265#true} is VALID [2022-04-27 17:40:44,044 INFO L272 TraceCheckUtils]: 6: Hoare triple {5613#(< ~counter~0 98)} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5265#true} is VALID [2022-04-27 17:40:44,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {5613#(< ~counter~0 98)} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {5613#(< ~counter~0 98)} is VALID [2022-04-27 17:40:44,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {5613#(< ~counter~0 98)} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5613#(< ~counter~0 98)} is VALID [2022-04-27 17:40:44,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5613#(< ~counter~0 98)} {5265#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5613#(< ~counter~0 98)} is VALID [2022-04-27 17:40:44,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {5613#(< ~counter~0 98)} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5613#(< ~counter~0 98)} is VALID [2022-04-27 17:40:44,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {5265#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {5613#(< ~counter~0 98)} is VALID [2022-04-27 17:40:44,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {5265#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5265#true} is VALID [2022-04-27 17:40:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 17:40:44,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:40:44,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781639779] [2022-04-27 17:40:44,046 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:40:44,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119932507] [2022-04-27 17:40:44,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119932507] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 17:40:44,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 17:40:44,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 17:40:44,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995634050] [2022-04-27 17:40:44,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 17:40:44,048 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) Word has length 63 [2022-04-27 17:40:44,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:40:44,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-27 17:40:44,109 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-27 17:40:44,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 17:40:44,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:40:44,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 17:40:44,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 17:40:44,111 INFO L87 Difference]: Start difference. First operand 202 states and 240 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-27 17:40:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:40:44,521 INFO L93 Difference]: Finished difference Result 214 states and 246 transitions. [2022-04-27 17:40:44,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 17:40:44,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) Word has length 63 [2022-04-27 17:40:44,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:40:44,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-27 17:40:44,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 147 transitions. [2022-04-27 17:40:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-27 17:40:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 147 transitions. [2022-04-27 17:40:44,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 147 transitions. [2022-04-27 17:40:44,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:40:44,642 INFO L225 Difference]: With dead ends: 214 [2022-04-27 17:40:44,642 INFO L226 Difference]: Without dead ends: 214 [2022-04-27 17:40:44,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 17:40:44,643 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 81 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:40:44,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 219 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:40:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-04-27 17:40:44,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2022-04-27 17:40:44,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:40:44,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 210 states, 138 states have (on average 1.1304347826086956) internal successors, (156), 142 states have internal predecessors, (156), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 17:40:44,651 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 210 states, 138 states have (on average 1.1304347826086956) internal successors, (156), 142 states have internal predecessors, (156), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 17:40:44,651 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 210 states, 138 states have (on average 1.1304347826086956) internal successors, (156), 142 states have internal predecessors, (156), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 17:40:44,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:40:44,656 INFO L93 Difference]: Finished difference Result 214 states and 246 transitions. [2022-04-27 17:40:44,656 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 246 transitions. [2022-04-27 17:40:44,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:40:44,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:40:44,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 210 states, 138 states have (on average 1.1304347826086956) internal successors, (156), 142 states have internal predecessors, (156), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) Second operand 214 states. [2022-04-27 17:40:44,658 INFO L87 Difference]: Start difference. First operand has 210 states, 138 states have (on average 1.1304347826086956) internal successors, (156), 142 states have internal predecessors, (156), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) Second operand 214 states. [2022-04-27 17:40:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:40:44,663 INFO L93 Difference]: Finished difference Result 214 states and 246 transitions. [2022-04-27 17:40:44,663 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 246 transitions. [2022-04-27 17:40:44,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:40:44,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:40:44,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:40:44,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:40:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 138 states have (on average 1.1304347826086956) internal successors, (156), 142 states have internal predecessors, (156), 46 states have call successors, (46), 26 states have call predecessors, (46), 25 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 17:40:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 244 transitions. [2022-04-27 17:40:44,669 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 244 transitions. Word has length 63 [2022-04-27 17:40:44,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:40:44,669 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 244 transitions. [2022-04-27 17:40:44,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 8 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-27 17:40:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 244 transitions. [2022-04-27 17:40:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-27 17:40:44,670 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:40:44,670 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:40:44,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-27 17:40:44,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 17:40:44,887 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:40:44,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:40:44,888 INFO L85 PathProgramCache]: Analyzing trace with hash -286098381, now seen corresponding path program 1 times [2022-04-27 17:40:44,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:40:44,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468600153] [2022-04-27 17:40:44,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:40:44,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:40:44,902 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:40:44,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1133026612] [2022-04-27 17:40:44,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:40:44,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:40:44,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:40:44,903 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:40:44,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 17:40:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:40:44,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 17:40:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:40:44,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:40:45,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {6512#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {6512#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {6512#true} is VALID [2022-04-27 17:40:45,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {6512#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6512#true} {6512#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {6512#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {6512#true} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {6512#true} is VALID [2022-04-27 17:40:45,432 INFO L272 TraceCheckUtils]: 6: Hoare triple {6512#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6512#true} is VALID [2022-04-27 17:40:45,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {6512#true} [104] assume_abort_if_notENTRY-->L12: 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] {6512#true} is VALID [2022-04-27 17:40:45,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {6512#true} [108] L12-->L12-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[] {6512#true} is VALID [2022-04-27 17:40:45,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {6512#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,432 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6512#true} {6512#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6512#true} is VALID [2022-04-27 17:40:45,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {6512#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {6550#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:40:45,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {6550#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [106] L37-3-->L37-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] {6550#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:40:45,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {6550#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6550#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:40:45,433 INFO L272 TraceCheckUtils]: 14: Hoare triple {6550#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6512#true} is VALID [2022-04-27 17:40:45,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,434 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6512#true} {6550#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6550#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:40:45,434 INFO L272 TraceCheckUtils]: 19: Hoare triple {6550#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6512#true} is VALID [2022-04-27 17:40:45,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,435 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6512#true} {6550#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6550#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:40:45,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {6550#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:40:45,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [126] L46-3-->L46-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] {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:40:45,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 100) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:40:45,436 INFO L272 TraceCheckUtils]: 27: Hoare triple {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6512#true} is VALID [2022-04-27 17:40:45,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,437 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6512#true} {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:40:45,437 INFO L272 TraceCheckUtils]: 32: Hoare triple {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6512#true} is VALID [2022-04-27 17:40:45,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,438 INFO L290 TraceCheckUtils]: 35: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,438 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6512#true} {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:40:45,439 INFO L272 TraceCheckUtils]: 37: Hoare triple {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {6512#true} is VALID [2022-04-27 17:40:45,439 INFO L290 TraceCheckUtils]: 38: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,439 INFO L290 TraceCheckUtils]: 39: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,439 INFO L290 TraceCheckUtils]: 40: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,439 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6512#true} {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:40:45,440 INFO L290 TraceCheckUtils]: 42: Hoare triple {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [130] L49-->L54: Formula: (<= (* v_main_~b~0_7 2) v_main_~r~0_9) InVars {main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:40:45,440 INFO L272 TraceCheckUtils]: 43: Hoare triple {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [135] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {6512#true} is VALID [2022-04-27 17:40:45,440 INFO L290 TraceCheckUtils]: 44: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,440 INFO L290 TraceCheckUtils]: 45: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,441 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6512#true} {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [145] __VERIFIER_assertEXIT-->L54-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:40:45,442 INFO L290 TraceCheckUtils]: 48: Hoare triple {6590#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [131] L54-1-->L46-3: Formula: (and (= v_main_~a~0_7 (* v_main_~a~0_8 2)) (= v_main_~b~0_8 (* v_main_~b~0_9 2))) InVars {main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {6663#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 17:40:45,442 INFO L290 TraceCheckUtils]: 49: Hoare triple {6663#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [126] L46-3-->L46-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] {6663#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 17:40:45,443 INFO L290 TraceCheckUtils]: 50: Hoare triple {6663#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 100) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6663#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 17:40:45,443 INFO L272 TraceCheckUtils]: 51: Hoare triple {6663#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6512#true} is VALID [2022-04-27 17:40:45,443 INFO L290 TraceCheckUtils]: 52: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,443 INFO L290 TraceCheckUtils]: 53: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,443 INFO L290 TraceCheckUtils]: 54: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,444 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6512#true} {6663#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6663#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 17:40:45,444 INFO L272 TraceCheckUtils]: 56: Hoare triple {6663#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6512#true} is VALID [2022-04-27 17:40:45,444 INFO L290 TraceCheckUtils]: 57: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,444 INFO L290 TraceCheckUtils]: 58: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,444 INFO L290 TraceCheckUtils]: 59: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,445 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6512#true} {6663#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6663#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 17:40:45,445 INFO L272 TraceCheckUtils]: 61: Hoare triple {6663#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {6512#true} is VALID [2022-04-27 17:40:45,445 INFO L290 TraceCheckUtils]: 62: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,445 INFO L290 TraceCheckUtils]: 63: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,445 INFO L290 TraceCheckUtils]: 64: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,446 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {6512#true} {6663#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {6663#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 17:40:45,446 INFO L290 TraceCheckUtils]: 66: Hoare triple {6663#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [129] L49-->L46-4: Formula: (not (<= (* v_main_~b~0_6 2) v_main_~r~0_8)) InVars {main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {6663#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 17:40:45,447 INFO L290 TraceCheckUtils]: 67: Hoare triple {6663#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {6721#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-27 17:40:45,448 INFO L290 TraceCheckUtils]: 68: Hoare triple {6721#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [106] L37-3-->L37-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] {6721#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-27 17:40:45,448 INFO L290 TraceCheckUtils]: 69: Hoare triple {6721#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6721#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-27 17:40:45,448 INFO L272 TraceCheckUtils]: 70: Hoare triple {6721#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6512#true} is VALID [2022-04-27 17:40:45,448 INFO L290 TraceCheckUtils]: 71: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,448 INFO L290 TraceCheckUtils]: 72: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,449 INFO L290 TraceCheckUtils]: 73: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,449 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6512#true} {6721#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6721#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-27 17:40:45,450 INFO L272 TraceCheckUtils]: 75: Hoare triple {6721#(and (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6746#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:40:45,450 INFO L290 TraceCheckUtils]: 76: Hoare triple {6746#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6750#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:40:45,451 INFO L290 TraceCheckUtils]: 77: Hoare triple {6750#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {6513#false} is VALID [2022-04-27 17:40:45,451 INFO L290 TraceCheckUtils]: 78: Hoare triple {6513#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6513#false} is VALID [2022-04-27 17:40:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 17:40:45,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 17:40:45,782 INFO L290 TraceCheckUtils]: 78: Hoare triple {6513#false} [120] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6513#false} is VALID [2022-04-27 17:40:45,783 INFO L290 TraceCheckUtils]: 77: Hoare triple {6750#(<= 1 __VERIFIER_assert_~cond)} [117] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {6513#false} is VALID [2022-04-27 17:40:45,783 INFO L290 TraceCheckUtils]: 76: Hoare triple {6746#(<= 1 |__VERIFIER_assert_#in~cond|)} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6750#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:40:45,784 INFO L272 TraceCheckUtils]: 75: Hoare triple {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6746#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:40:45,784 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6512#true} {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:40:45,785 INFO L290 TraceCheckUtils]: 73: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,785 INFO L290 TraceCheckUtils]: 72: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,785 INFO L290 TraceCheckUtils]: 71: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,785 INFO L272 TraceCheckUtils]: 70: Hoare triple {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6512#true} is VALID [2022-04-27 17:40:45,785 INFO L290 TraceCheckUtils]: 69: Hoare triple {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:40:45,785 INFO L290 TraceCheckUtils]: 68: Hoare triple {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [106] L37-3-->L37-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] {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:40:45,792 INFO L290 TraceCheckUtils]: 67: Hoare triple {6791#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [132] L46-4-->L37-3: Formula: (and (= v_main_~q~0_5 (+ v_main_~a~0_9 v_main_~q~0_6)) (= v_main_~r~0_11 (+ v_main_~r~0_12 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_12, main_~a~0=v_main_~a~0_9} OutVars{main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:40:45,793 INFO L290 TraceCheckUtils]: 66: Hoare triple {6791#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [129] L49-->L46-4: Formula: (not (<= (* v_main_~b~0_6 2) v_main_~r~0_8)) InVars {main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_6, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {6791#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 17:40:45,793 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {6512#true} {6791#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {6791#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 17:40:45,793 INFO L290 TraceCheckUtils]: 64: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,793 INFO L290 TraceCheckUtils]: 63: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,794 INFO L290 TraceCheckUtils]: 62: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,794 INFO L272 TraceCheckUtils]: 61: Hoare triple {6791#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {6512#true} is VALID [2022-04-27 17:40:45,794 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6512#true} {6791#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6791#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 17:40:45,794 INFO L290 TraceCheckUtils]: 59: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,794 INFO L290 TraceCheckUtils]: 58: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,794 INFO L290 TraceCheckUtils]: 57: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,794 INFO L272 TraceCheckUtils]: 56: Hoare triple {6791#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6512#true} is VALID [2022-04-27 17:40:45,795 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6512#true} {6791#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6791#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 17:40:45,795 INFO L290 TraceCheckUtils]: 54: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,795 INFO L272 TraceCheckUtils]: 51: Hoare triple {6791#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6512#true} is VALID [2022-04-27 17:40:45,796 INFO L290 TraceCheckUtils]: 50: Hoare triple {6791#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 100) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6791#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 17:40:45,799 INFO L290 TraceCheckUtils]: 49: Hoare triple {6791#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [126] L46-3-->L46-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] {6791#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 17:40:45,803 INFO L290 TraceCheckUtils]: 48: Hoare triple {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [131] L54-1-->L46-3: Formula: (and (= v_main_~a~0_7 (* v_main_~a~0_8 2)) (= v_main_~b~0_8 (* v_main_~b~0_9 2))) InVars {main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {6791#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 17:40:45,804 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6512#true} {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [145] __VERIFIER_assertEXIT-->L54-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:40:45,804 INFO L290 TraceCheckUtils]: 46: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,804 INFO L290 TraceCheckUtils]: 45: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,804 INFO L290 TraceCheckUtils]: 44: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,804 INFO L272 TraceCheckUtils]: 43: Hoare triple {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [135] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {6512#true} is VALID [2022-04-27 17:40:45,804 INFO L290 TraceCheckUtils]: 42: Hoare triple {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [130] L49-->L54: Formula: (<= (* v_main_~b~0_7 2) v_main_~r~0_9) InVars {main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:40:45,805 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6512#true} {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [144] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:40:45,805 INFO L290 TraceCheckUtils]: 40: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,805 INFO L290 TraceCheckUtils]: 39: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,806 INFO L272 TraceCheckUtils]: 37: Hoare triple {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [128] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {6512#true} is VALID [2022-04-27 17:40:45,806 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6512#true} {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [143] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:40:45,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,807 INFO L272 TraceCheckUtils]: 32: Hoare triple {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [127] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6512#true} is VALID [2022-04-27 17:40:45,807 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6512#true} {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [142] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:40:45,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,808 INFO L272 TraceCheckUtils]: 27: Hoare triple {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [136] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6512#true} is VALID [2022-04-27 17:40:45,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [134] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 100) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:40:45,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} [126] L46-3-->L46-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] {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:40:45,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [124] L39-->L46-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_8) (<= v_main_~y~0_8 v_main_~r~0_5) (= v_main_~a~0_4 1)) InVars {main_~y~0=v_main_~y~0_8, main_~r~0=v_main_~r~0_5} OutVars{main_~y~0=v_main_~y~0_8, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {6849#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:40:45,810 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6512#true} {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [141] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:40:45,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,811 INFO L272 TraceCheckUtils]: 19: Hoare triple {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [119] L38-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {6512#true} is VALID [2022-04-27 17:40:45,811 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6512#true} {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [140] __VERIFIER_assertEXIT-->L38-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:40:45,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {6512#true} [122] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {6512#true} [118] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {6512#true} [114] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6512#true} is VALID [2022-04-27 17:40:45,812 INFO L272 TraceCheckUtils]: 14: Hoare triple {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [115] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {6512#true} is VALID [2022-04-27 17:40:45,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [111] L37-1-->L38: Formula: (< |v_main_#t~post6_5| 100) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:40:45,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [106] L37-3-->L37-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] {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:40:45,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {6512#true} [103] L30-1-->L37-3: Formula: (and (= v_main_~b~0_2 0) (= v_main_~q~0_2 0) (= v_main_~a~0_2 0) (= v_main_~r~0_2 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_4, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {6766#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:40:45,813 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6512#true} {6512#true} [138] assume_abort_if_notEXIT-->L30-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6512#true} is VALID [2022-04-27 17:40:45,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {6512#true} [112] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {6512#true} [108] L12-->L12-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[] {6512#true} is VALID [2022-04-27 17:40:45,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {6512#true} [104] assume_abort_if_notENTRY-->L12: 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] {6512#true} is VALID [2022-04-27 17:40:45,814 INFO L272 TraceCheckUtils]: 6: Hoare triple {6512#true} [102] L30-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6512#true} is VALID [2022-04-27 17:40:45,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {6512#true} [100] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {6512#true} is VALID [2022-04-27 17:40:45,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {6512#true} [97] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6512#true} {6512#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {6512#true} [101] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {6512#true} [98] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 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_5, #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] {6512#true} is VALID [2022-04-27 17:40:45,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {6512#true} [96] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6512#true} is VALID [2022-04-27 17:40:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-27 17:40:45,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:40:45,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468600153] [2022-04-27 17:40:45,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:40:45,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133026612] [2022-04-27 17:40:45,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133026612] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 17:40:45,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 17:40:45,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-04-27 17:40:45,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528918694] [2022-04-27 17:40:45,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 17:40:45,816 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 8 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) Word has length 79 [2022-04-27 17:40:45,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:40:45,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 8 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-27 17:40:45,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:40:45,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 17:40:45,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:40:45,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 17:40:45,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-27 17:40:45,898 INFO L87 Difference]: Start difference. First operand 210 states and 244 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 8 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-27 17:40:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:40:47,138 INFO L93 Difference]: Finished difference Result 234 states and 268 transitions. [2022-04-27 17:40:47,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 17:40:47,139 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 8 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) Word has length 79 [2022-04-27 17:40:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:40:47,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 8 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-27 17:40:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2022-04-27 17:40:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 8 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-27 17:40:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2022-04-27 17:40:47,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 116 transitions. [2022-04-27 17:40:47,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:40:47,298 INFO L225 Difference]: With dead ends: 234 [2022-04-27 17:40:47,298 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 17:40:47,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-04-27 17:40:47,299 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 76 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 17:40:47,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 185 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 17:40:47,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 17:40:47,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 17:40:47,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:40:47,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 17:40:47,300 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 17:40:47,300 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 17:40:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:40:47,300 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 17:40:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:40:47,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:40:47,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:40:47,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 17:40:47,301 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 17:40:47,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:40:47,301 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 17:40:47,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:40:47,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:40:47,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:40:47,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:40:47,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:40:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 17:40:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 17:40:47,301 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2022-04-27 17:40:47,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:40:47,302 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 17:40:47,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 8 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-27 17:40:47,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:40:47,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:40:47,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 17:40:47,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 17:40:47,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 17:40:47,507 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:40:47,509 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 17:40:47,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:40:47 BasicIcfg [2022-04-27 17:40:47,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 17:40:47,511 INFO L158 Benchmark]: Toolchain (without parser) took 72782.53ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 147.2MB in the beginning and 166.5MB in the end (delta: -19.3MB). Peak memory consumption was 20.3MB. Max. memory is 8.0GB. [2022-04-27 17:40:47,512 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 198.2MB. Free memory was 163.3MB in the beginning and 163.3MB in the end (delta: 72.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 17:40:47,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.32ms. Allocated memory is still 198.2MB. Free memory was 147.0MB in the beginning and 173.2MB in the end (delta: -26.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 17:40:47,512 INFO L158 Benchmark]: Boogie Preprocessor took 46.92ms. Allocated memory is still 198.2MB. Free memory was 173.2MB in the beginning and 171.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 17:40:47,512 INFO L158 Benchmark]: RCFGBuilder took 254.27ms. Allocated memory is still 198.2MB. Free memory was 171.6MB in the beginning and 159.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 17:40:47,513 INFO L158 Benchmark]: IcfgTransformer took 30.35ms. Allocated memory is still 198.2MB. Free memory was 159.5MB in the beginning and 157.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 17:40:47,513 INFO L158 Benchmark]: TraceAbstraction took 72232.28ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 157.2MB in the beginning and 166.5MB in the end (delta: -9.3MB). Peak memory consumption was 31.9MB. Max. memory is 8.0GB. [2022-04-27 17:40:47,514 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 198.2MB. Free memory was 163.3MB in the beginning and 163.3MB in the end (delta: 72.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.32ms. Allocated memory is still 198.2MB. Free memory was 147.0MB in the beginning and 173.2MB in the end (delta: -26.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.92ms. Allocated memory is still 198.2MB. Free memory was 173.2MB in the beginning and 171.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 254.27ms. Allocated memory is still 198.2MB. Free memory was 171.6MB in the beginning and 159.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 30.35ms. Allocated memory is still 198.2MB. Free memory was 159.5MB in the beginning and 157.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 72232.28ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 157.2MB in the beginning and 166.5MB in the end (delta: -9.3MB). Peak memory consumption was 31.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.2s, OverallIterations: 12, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 406 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 382 mSDsluCounter, 1785 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1257 mSDsCounter, 227 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1122 IncrementalHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 227 mSolverCounterUnsat, 528 mSDtfsCounter, 1122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 749 GetRequests, 653 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=9, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 28 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 62.6s InterpolantComputationTime, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 699 ConstructedInterpolants, 0 QuantifiedInterpolants, 1996 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1473 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 861/960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 17:40:47,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...