/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/loops-crafted-1/theatreSquare.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 17:50:42,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 17:50:42,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 17:50:42,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 17:50:42,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 17:50:42,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 17:50:42,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 17:50:42,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 17:50:42,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 17:50:42,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 17:50:42,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 17:50:42,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 17:50:42,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 17:50:42,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 17:50:42,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 17:50:42,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 17:50:42,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 17:50:42,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 17:50:42,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 17:50:42,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 17:50:42,893 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 17:50:42,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 17:50:42,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 17:50:42,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 17:50:42,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 17:50:42,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 17:50:42,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 17:50:42,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 17:50:42,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 17:50:42,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 17:50:42,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 17:50:42,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 17:50:42,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 17:50:42,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 17:50:42,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 17:50:42,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 17:50:42,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 17:50:42,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 17:50:42,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 17:50:42,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 17:50:42,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 17:50:42,907 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 17:50:42,908 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 17:50:42,915 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 17:50:42,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 17:50:42,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 17:50:42,917 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 17:50:42,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 17:50:42,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 17:50:42,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 17:50:42,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 17:50:42,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 17:50:42,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 17:50:42,918 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 17:50:42,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 17:50:42,919 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 17:50:42,919 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 17:50:42,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 17:50:42,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 17:50:42,924 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 17:50:42,924 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 17:50:42,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:50:42,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 17:50:42,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 17:50:42,926 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 17:50:42,927 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-07 17:50:43,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 17:50:43,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 17:50:43,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 17:50:43,175 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 17:50:43,175 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 17:50:43,177 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/theatreSquare.c [2022-04-07 17:50:43,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc9b3085c/03384837e7534929a965f143bb8f9fd0/FLAGc10db4583 [2022-04-07 17:50:43,606 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 17:50:43,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c [2022-04-07 17:50:43,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc9b3085c/03384837e7534929a965f143bb8f9fd0/FLAGc10db4583 [2022-04-07 17:50:43,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc9b3085c/03384837e7534929a965f143bb8f9fd0 [2022-04-07 17:50:43,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 17:50:43,625 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 17:50:43,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 17:50:43,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 17:50:43,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 17:50:43,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:50:43" (1/1) ... [2022-04-07 17:50:43,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d1997cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:43, skipping insertion in model container [2022-04-07 17:50:43,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:50:43" (1/1) ... [2022-04-07 17:50:43,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 17:50:43,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 17:50:43,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c[370,383] [2022-04-07 17:50:43,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:50:43,821 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 17:50:43,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c[370,383] [2022-04-07 17:50:43,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:50:43,851 INFO L208 MainTranslator]: Completed translation [2022-04-07 17:50:43,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:43 WrapperNode [2022-04-07 17:50:43,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 17:50:43,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 17:50:43,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 17:50:43,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 17:50:43,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:43" (1/1) ... [2022-04-07 17:50:43,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:43" (1/1) ... [2022-04-07 17:50:43,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:43" (1/1) ... [2022-04-07 17:50:43,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:43" (1/1) ... [2022-04-07 17:50:43,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:43" (1/1) ... [2022-04-07 17:50:43,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:43" (1/1) ... [2022-04-07 17:50:43,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:43" (1/1) ... [2022-04-07 17:50:43,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 17:50:43,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 17:50:43,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 17:50:43,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 17:50:43,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:43" (1/1) ... [2022-04-07 17:50:43,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:50:43,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:50:43,912 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-07 17:50:43,931 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-07 17:50:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 17:50:43,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 17:50:43,954 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 17:50:43,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 17:50:43,955 INFO L138 BoogieDeclarations]: Found implementation of procedure correct_version [2022-04-07 17:50:43,955 INFO L138 BoogieDeclarations]: Found implementation of procedure student_version [2022-04-07 17:50:43,955 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 17:50:43,955 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 17:50:43,955 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 17:50:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 17:50:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 17:50:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 17:50:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 17:50:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure correct_version [2022-04-07 17:50:43,958 INFO L130 BoogieDeclarations]: Found specification of procedure student_version [2022-04-07 17:50:43,959 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 17:50:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 17:50:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 17:50:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 17:50:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 17:50:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 17:50:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 17:50:44,039 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 17:50:44,041 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 17:50:44,260 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 17:50:44,266 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 17:50:44,266 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-07 17:50:44,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:50:44 BoogieIcfgContainer [2022-04-07 17:50:44,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 17:50:44,269 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 17:50:44,269 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 17:50:44,270 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 17:50:44,272 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:50:44" (1/1) ... [2022-04-07 17:50:44,274 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 17:50:49,048 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-07 17:50:49,311 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-07 17:50:49,312 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_correct_version_~i~0_5 1) v_correct_version_~i~0_4) (= (+ v_correct_version_~b~0_4 v_correct_version_~a_2) v_correct_version_~b~0_3) (< v_correct_version_~b~0_4 v_correct_version_~n_3)) InVars {correct_version_~n=v_correct_version_~n_3, correct_version_~b~0=v_correct_version_~b~0_4, correct_version_~i~0=v_correct_version_~i~0_5, correct_version_~a=v_correct_version_~a_2} OutVars{correct_version_~n=v_correct_version_~n_3, correct_version_~b~0=v_correct_version_~b~0_3, correct_version_~i~0=v_correct_version_~i~0_4, correct_version_~a=v_correct_version_~a_2} AuxVars[] AssignedVars[correct_version_~b~0, correct_version_~i~0] to Formula: (or (and (= v_correct_version_~i~0_5 v_correct_version_~i~0_4) (= v_correct_version_~b~0_3 v_correct_version_~b~0_4) (<= v_correct_version_~n_3 v_correct_version_~b~0_4)) (and (= (+ (* v_correct_version_~a_2 (+ (* (- 1) v_correct_version_~i~0_5) v_correct_version_~i~0_4)) v_correct_version_~b~0_4) v_correct_version_~b~0_3) (< v_correct_version_~i~0_5 v_correct_version_~i~0_4) (forall ((v_it_1 Int)) (or (< (+ v_correct_version_~b~0_4 (* v_it_1 v_correct_version_~a_2)) v_correct_version_~n_3) (not (<= 1 v_it_1)) (not (<= (+ v_it_1 v_correct_version_~i~0_5 1) v_correct_version_~i~0_4)))) (< v_correct_version_~b~0_4 v_correct_version_~n_3))) InVars {correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_5, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_4} OutVars{correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_4, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_3} AuxVars[] AssignedVars[correct_version_~b~0, correct_version_~i~0] [2022-04-07 17:50:53,515 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-07 17:50:53,682 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-07 17:50:53,683 INFO L91 elerationTransformer]: Accelerated Formula: (and (< v_correct_version_~l~0_4 v_correct_version_~m_3) (= (+ v_correct_version_~l~0_4 v_correct_version_~a_3) v_correct_version_~l~0_3) (= (+ v_correct_version_~j~0_4 1) v_correct_version_~j~0_3)) InVars {correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_4, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_4} OutVars{correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_3, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_3} AuxVars[] AssignedVars[correct_version_~l~0, correct_version_~j~0] to Formula: (or (and (<= v_correct_version_~m_3 v_correct_version_~l~0_4) (= v_correct_version_~l~0_4 v_correct_version_~l~0_3) (= v_correct_version_~j~0_4 v_correct_version_~j~0_3)) (and (= (+ (* (+ (* (- 1) v_correct_version_~j~0_4) v_correct_version_~j~0_3) v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~l~0_3) (< v_correct_version_~j~0_4 v_correct_version_~j~0_3) (< v_correct_version_~l~0_4 v_correct_version_~m_3) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 v_correct_version_~j~0_4 1) v_correct_version_~j~0_3)) (< (+ (* v_it_2 v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~m_3))))) InVars {correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_4, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_4} OutVars{correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_3, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_3} AuxVars[] AssignedVars[correct_version_~l~0, correct_version_~j~0] [2022-04-07 17:50:57,832 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-07 17:50:58,060 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-07 17:50:58,061 INFO L91 elerationTransformer]: Accelerated Formula: (and (< v_student_version_~b~1_2 v_student_version_~n_1) (= (+ v_student_version_~i~1_2 1) v_student_version_~i~1_1) (= v_student_version_~b~1_1 (+ v_student_version_~a_1 v_student_version_~b~1_2))) InVars {student_version_~i~1=v_student_version_~i~1_2, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_2, student_version_~n=v_student_version_~n_1} OutVars{student_version_~i~1=v_student_version_~i~1_1, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_1, student_version_~n=v_student_version_~n_1} AuxVars[] AssignedVars[student_version_~i~1, student_version_~b~1] to Formula: (or (and (<= v_student_version_~n_1 v_student_version_~b~1_2) (= v_student_version_~b~1_2 v_student_version_~b~1_1) (= v_student_version_~i~1_2 v_student_version_~i~1_1)) (and (< v_student_version_~i~1_2 v_student_version_~i~1_1) (= (+ v_student_version_~b~1_2 (* (+ v_student_version_~i~1_1 (* (- 1) v_student_version_~i~1_2)) v_student_version_~a_1)) v_student_version_~b~1_1) (< v_student_version_~b~1_2 v_student_version_~n_1) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 v_student_version_~i~1_2 1) v_student_version_~i~1_1)) (< (+ v_student_version_~b~1_2 (* v_student_version_~a_1 v_it_3)) v_student_version_~n_1))))) InVars {student_version_~i~1=v_student_version_~i~1_2, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_2, student_version_~n=v_student_version_~n_1} OutVars{student_version_~i~1=v_student_version_~i~1_1, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_1, student_version_~n=v_student_version_~n_1} AuxVars[] AssignedVars[student_version_~i~1, student_version_~b~1] [2022-04-07 17:51:02,239 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-07 17:51:02,401 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-07 17:51:02,402 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_student_version_~j~1_2 1) v_student_version_~j~1_1) (< v_student_version_~l~1_3 v_student_version_~m_2) (= (+ v_student_version_~a_2 v_student_version_~l~1_3) v_student_version_~l~1_2)) InVars {student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_2, student_version_~l~1=v_student_version_~l~1_3, student_version_~m=v_student_version_~m_2} OutVars{student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_1, student_version_~l~1=v_student_version_~l~1_2, student_version_~m=v_student_version_~m_2} AuxVars[] AssignedVars[student_version_~j~1, student_version_~l~1] to Formula: (or (and (= v_student_version_~l~1_3 v_student_version_~l~1_2) (<= v_student_version_~m_2 v_student_version_~l~1_3) (= v_student_version_~j~1_2 v_student_version_~j~1_1)) (and (= (+ v_student_version_~l~1_3 (* (+ v_student_version_~j~1_1 (* (- 1) v_student_version_~j~1_2)) v_student_version_~a_2)) v_student_version_~l~1_2) (< v_student_version_~j~1_2 v_student_version_~j~1_1) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 v_student_version_~j~1_2 1) v_student_version_~j~1_1)) (not (<= 1 v_it_4)) (< (+ (* v_student_version_~a_2 v_it_4) v_student_version_~l~1_3) v_student_version_~m_2))) (< v_student_version_~l~1_3 v_student_version_~m_2))) InVars {student_version_~l~1=v_student_version_~l~1_3, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_2, student_version_~m=v_student_version_~m_2} OutVars{student_version_~l~1=v_student_version_~l~1_2, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_1, student_version_~m=v_student_version_~m_2} AuxVars[] AssignedVars[student_version_~j~1, student_version_~l~1] [2022-04-07 17:51:06,515 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-07 17:51:06,615 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-07 17:51:06,616 INFO L91 elerationTransformer]: Accelerated Formula: (and (< v_correct_version_~x~0_3 v_correct_version_~i~0_3) (= (+ v_correct_version_~j~0_2 v_correct_version_~y~0_2) v_correct_version_~y~0_1) (= (+ v_correct_version_~x~0_3 1) v_correct_version_~x~0_2)) InVars {correct_version_~y~0=v_correct_version_~y~0_2, correct_version_~x~0=v_correct_version_~x~0_3, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} OutVars{correct_version_~y~0=v_correct_version_~y~0_1, correct_version_~x~0=v_correct_version_~x~0_2, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] to Formula: (or (and (< v_correct_version_~x~0_3 v_correct_version_~x~0_2) (= (+ (* v_correct_version_~j~0_2 v_correct_version_~x~0_2) v_correct_version_~y~0_2) (+ v_correct_version_~y~0_1 (* v_correct_version_~j~0_2 v_correct_version_~x~0_3))) (< v_correct_version_~x~0_2 (+ v_correct_version_~i~0_3 1))) (and (= v_correct_version_~y~0_2 v_correct_version_~y~0_1) (= v_correct_version_~x~0_3 v_correct_version_~x~0_2) (<= v_correct_version_~i~0_3 v_correct_version_~x~0_3))) InVars {correct_version_~y~0=v_correct_version_~y~0_2, correct_version_~x~0=v_correct_version_~x~0_3, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} OutVars{correct_version_~y~0=v_correct_version_~y~0_1, correct_version_~x~0=v_correct_version_~x~0_2, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] [2022-04-07 17:51:10,716 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-07 17:51:10,819 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-07 17:51:10,819 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_student_version_~x~1_3 (+ v_student_version_~x~1_4 1)) (= v_student_version_~y~1_2 (+ v_student_version_~j~1_4 v_student_version_~y~1_3)) (< v_student_version_~x~1_4 v_student_version_~i~1_5)) InVars {student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_3, student_version_~x~1=v_student_version_~x~1_4, student_version_~j~1=v_student_version_~j~1_4} OutVars{student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_2, student_version_~x~1=v_student_version_~x~1_3, student_version_~j~1=v_student_version_~j~1_4} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] to Formula: (or (and (= (+ v_student_version_~y~1_2 (* v_student_version_~j~1_4 v_student_version_~x~1_4)) (+ v_student_version_~y~1_3 (* v_student_version_~j~1_4 v_student_version_~x~1_3))) (< v_student_version_~x~1_4 v_student_version_~x~1_3) (< v_student_version_~x~1_3 (+ v_student_version_~i~1_5 1))) (and (= v_student_version_~y~1_3 v_student_version_~y~1_2) (not (< v_student_version_~x~1_4 v_student_version_~i~1_5)) (= v_student_version_~x~1_4 v_student_version_~x~1_3))) InVars {student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_3, student_version_~x~1=v_student_version_~x~1_4, student_version_~j~1=v_student_version_~j~1_4} OutVars{student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_2, student_version_~x~1=v_student_version_~x~1_3, student_version_~j~1=v_student_version_~j~1_4} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] [2022-04-07 17:51:10,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:51:10 BasicIcfg [2022-04-07 17:51:10,822 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 17:51:10,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 17:51:10,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 17:51:10,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 17:51:10,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 05:50:43" (1/4) ... [2022-04-07 17:51:10,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3100121e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:51:10, skipping insertion in model container [2022-04-07 17:51:10,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:43" (2/4) ... [2022-04-07 17:51:10,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3100121e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:51:10, skipping insertion in model container [2022-04-07 17:51:10,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:50:44" (3/4) ... [2022-04-07 17:51:10,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3100121e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:51:10, skipping insertion in model container [2022-04-07 17:51:10,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:51:10" (4/4) ... [2022-04-07 17:51:10,829 INFO L111 eAbstractionObserver]: Analyzing ICFG theatreSquare.cJordan [2022-04-07 17:51:10,833 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 17:51:10,833 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 17:51:10,858 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 17:51:10,863 INFO L340 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 [2022-04-07 17:51:10,863 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 17:51:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 17:51:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 17:51:10,880 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:51:10,880 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:51:10,881 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:51:10,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:51:10,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1121522138, now seen corresponding path program 1 times [2022-04-07 17:51:10,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:51:10,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826914653] [2022-04-07 17:51:10,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:10,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:51:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:11,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:51:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:11,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [122] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {42#true} is VALID [2022-04-07 17:51:11,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [125] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 17:51:11,046 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} [167] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 17:51:11,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [120] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:51:11,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [122] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {42#true} is VALID [2022-04-07 17:51:11,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [125] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 17:51:11,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [167] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 17:51:11,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 17:51:11,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [124] mainENTRY-->L97: Formula: (and (= v_main_~n_stones2~0_3 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~n_stones1~0_2 v_main_~n_stones2~0_3) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~m~0_2 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~n~0=v_main_~n~0_2, main_~m~0=v_main_~m~0_2, main_~n_stones2~0=v_main_~n_stones2~0_3, main_~n_stones1~0=v_main_~n_stones1~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~m~0, main_~n~0, main_~n_stones2~0, main_~n_stones1~0, main_~a~0] {47#(= main_~n_stones2~0 main_~n_stones1~0)} is VALID [2022-04-07 17:51:11,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#(= main_~n_stones2~0 main_~n_stones1~0)} [127] L97-->L97-2: Formula: (or (not (<= 1 v_main_~m~0_1)) (not (<= v_main_~n~0_1 109)) (not (<= 1 v_main_~n~0_1)) (not (<= 1 v_main_~a~0_1)) (not (<= v_main_~m~0_1 109)) (not (<= v_main_~a~0_1 109))) InVars {main_~n~0=v_main_~n~0_1, main_~m~0=v_main_~m~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~n~0=v_main_~n~0_1, main_~m~0=v_main_~m~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {47#(= main_~n_stones2~0 main_~n_stones1~0)} is VALID [2022-04-07 17:51:11,051 INFO L272 TraceCheckUtils]: 7: Hoare triple {47#(= main_~n_stones2~0 main_~n_stones1~0)} [129] L97-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n_stones1~0_5 v_main_~n_stones2~0_4) 1 0)) InVars {main_~n_stones2~0=v_main_~n_stones2~0_4, main_~n_stones1~0=v_main_~n_stones1~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n_stones2~0, main_~n_stones1~0] {48#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:51:11,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {48#(not (= |__VERIFIER_assert_#in~cond| 0))} [133] __VERIFIER_assertENTRY-->L6: 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] {49#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:51:11,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {49#(not (= __VERIFIER_assert_~cond 0))} [139] L6-->L7: 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[] {43#false} is VALID [2022-04-07 17:51:11,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {43#false} [146] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 17:51:11,053 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-07 17:51:11,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:51:11,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826914653] [2022-04-07 17:51:11,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826914653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:51:11,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:51:11,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:51:11,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570300274] [2022-04-07 17:51:11,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:51:11,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 17:51:11,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:51:11,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:11,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:11,077 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:51:11,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:51:11,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:51:11,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:51:11,114 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:11,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:11,459 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-07 17:51:11,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 17:51:11,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 17:51:11,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:51:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-07 17:51:11,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-07 17:51:11,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2022-04-07 17:51:11,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:11,554 INFO L225 Difference]: With dead ends: 47 [2022-04-07 17:51:11,555 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 17:51:11,556 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 17:51:11,559 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:51:11,559 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 61 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 12 Unchecked, 0.1s Time] [2022-04-07 17:51:11,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 17:51:11,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-07 17:51:11,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:51:11,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:11,583 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:11,584 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:11,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:11,587 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-07 17:51:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-07 17:51:11,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:11,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:11,588 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-07 17:51:11,588 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-07 17:51:11,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:11,591 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-07 17:51:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-07 17:51:11,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:11,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:11,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:51:11,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:51:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-07 17:51:11,595 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2022-04-07 17:51:11,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:51:11,596 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-07 17:51:11,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-07 17:51:11,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 17:51:11,597 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:51:11,597 INFO L499 BasicCegarLoop]: trace histogram [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-07 17:51:11,597 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 17:51:11,598 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:51:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:51:11,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1342094697, now seen corresponding path program 1 times [2022-04-07 17:51:11,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:51:11,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921399904] [2022-04-07 17:51:11,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:11,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:51:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:11,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:51:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:11,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [122] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {204#true} is VALID [2022-04-07 17:51:11,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#true} [125] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-07 17:51:11,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {204#true} {204#true} [167] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-07 17:51:11,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 17:51:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:11,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {204#true} [131] correct_versionENTRY-->L38-2: Formula: (and (= |v_correct_version_#in~m_1| v_correct_version_~m_1) (= |v_correct_version_#in~a_1| v_correct_version_~a_1) (= v_correct_version_~i~0_2 0) (= v_correct_version_~l~0_1 0) (= |v_correct_version_#in~n_1| v_correct_version_~n_1) (= v_correct_version_~b~0_1 0) (= v_correct_version_~j~0_1 0)) InVars {correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_#in~n=|v_correct_version_#in~n_1|} OutVars{correct_version_~n=v_correct_version_~n_1, correct_version_~m=v_correct_version_~m_1, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_~b~0=v_correct_version_~b~0_1, correct_version_#in~n=|v_correct_version_#in~n_1|, correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_~i~0=v_correct_version_~i~0_2, correct_version_~l~0=v_correct_version_~l~0_1, correct_version_~a=v_correct_version_~a_1, correct_version_~j~0=v_correct_version_~j~0_1} AuxVars[] AssignedVars[correct_version_~n, correct_version_~m, correct_version_~b~0, correct_version_~i~0, correct_version_~l~0, correct_version_~a, correct_version_~j~0] {204#true} is VALID [2022-04-07 17:51:11,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#true} [136] L38-2-->L44-1: Formula: (not (< v_correct_version_~b~0_2 v_correct_version_~n_2)) InVars {correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} OutVars{correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-07 17:51:11,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#true} [144] L44-1-->L44-2: Formula: (not (< v_correct_version_~l~0_2 v_correct_version_~m_2)) InVars {correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} OutVars{correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-07 17:51:11,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {204#true} [152] L44-2-->L52-2: Formula: (and (= v_correct_version_~x~0_4 0) (= v_correct_version_~y~0_4 0)) InVars {} OutVars{correct_version_~y~0=v_correct_version_~y~0_4, correct_version_~x~0=v_correct_version_~x~0_4} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] {232#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} is VALID [2022-04-07 17:51:11,785 INFO L290 TraceCheckUtils]: 4: Hoare triple {232#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} [157] L52-2-->L52-3: Formula: (not (< v_correct_version_~x~0_1 v_correct_version_~i~0_1)) InVars {correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} OutVars{correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} AuxVars[] AssignedVars[] {232#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} is VALID [2022-04-07 17:51:11,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} [160] L52-3-->correct_versionFINAL: Formula: (= |v_correct_version_#res_1| v_correct_version_~y~0_3) InVars {correct_version_~y~0=v_correct_version_~y~0_3} OutVars{correct_version_#res=|v_correct_version_#res_1|, correct_version_~y~0=v_correct_version_~y~0_3} AuxVars[] AssignedVars[correct_version_#res] {233#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} is VALID [2022-04-07 17:51:11,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {233#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} [164] correct_versionFINAL-->correct_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} is VALID [2022-04-07 17:51:11,788 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {233#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} {204#true} [170] correct_versionEXIT-->L104-1: AOR: Formula: (= |v_main_#t~ret8_4| |v_correct_version_#resOutParam_1|) InVars {correct_version_#res=|v_correct_version_#resOutParam_1|} OutVars{main_#t~ret8=|v_main_#t~ret8_4|} AuxVars[] AssignedVars[main_#t~ret8, correct_version_#res] LVA: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {217#(= |main_#t~ret8| 0)} is VALID [2022-04-07 17:51:11,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 17:51:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:11,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {204#true} [142] student_versionENTRY-->L65-2: Formula: (and (= v_student_version_~b~1_3 0) (= v_student_version_~m_3 |v_student_version_#in~m_1|) (= v_student_version_~a_3 |v_student_version_#in~a_1|) (= v_student_version_~n_2 |v_student_version_#in~n_1|) (= v_student_version_~j~1_3 0) (= v_student_version_~l~1_4 0) (= v_student_version_~i~1_4 0)) InVars {student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_#in~a=|v_student_version_#in~a_1|} OutVars{student_version_~i~1=v_student_version_~i~1_4, student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_~a=v_student_version_~a_3, student_version_~j~1=v_student_version_~j~1_3, student_version_~l~1=v_student_version_~l~1_4, student_version_~b~1=v_student_version_~b~1_3, student_version_~n=v_student_version_~n_2, student_version_#in~a=|v_student_version_#in~a_1|, student_version_~m=v_student_version_~m_3} AuxVars[] AssignedVars[student_version_~i~1, student_version_~a, student_version_~j~1, student_version_~l~1, student_version_~b~1, student_version_~n, student_version_~m] {204#true} is VALID [2022-04-07 17:51:11,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#true} [150] L65-2-->L71-1: Formula: (not (< v_student_version_~b~1_4 v_student_version_~n_3)) InVars {student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} OutVars{student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-07 17:51:11,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#true} [154] L71-1-->L71-2: Formula: (not (< v_student_version_~l~1_1 v_student_version_~m_1)) InVars {student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} OutVars{student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-07 17:51:11,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {204#true} [159] L71-2-->L79-2: Formula: (and (= v_student_version_~y~1_1 0) (= v_student_version_~x~1_1 0)) InVars {} OutVars{student_version_~x~1=v_student_version_~x~1_1, student_version_~y~1=v_student_version_~y~1_1} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {234#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} is VALID [2022-04-07 17:51:11,865 INFO L290 TraceCheckUtils]: 4: Hoare triple {234#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} [162] L79-2-->L79-3: Formula: (not (< v_student_version_~x~1_2 v_student_version_~i~1_3)) InVars {student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} OutVars{student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} AuxVars[] AssignedVars[] {234#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} is VALID [2022-04-07 17:51:11,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} [165] L79-3-->student_versionFINAL: Formula: (= v_student_version_~y~1_4 |v_student_version_#res_1|) InVars {student_version_~y~1=v_student_version_~y~1_4} OutVars{student_version_#res=|v_student_version_#res_1|, student_version_~y~1=v_student_version_~y~1_4} AuxVars[] AssignedVars[student_version_#res] {235#(= |student_version_#res| 0)} is VALID [2022-04-07 17:51:11,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {235#(= |student_version_#res| 0)} [166] student_versionFINAL-->student_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#(= |student_version_#res| 0)} is VALID [2022-04-07 17:51:11,868 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {235#(= |student_version_#res| 0)} {218#(= main_~n_stones1~0 0)} [171] student_versionEXIT-->L105-1: AOR: Formula: (= |v_main_#t~ret9_4| |v_student_version_#resOutParam_1|) InVars {student_version_#res=|v_student_version_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_4|} AuxVars[] AssignedVars[student_version_#res, main_#t~ret9] LVA: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {227#(= main_~n_stones1~0 |main_#t~ret9|)} is VALID [2022-04-07 17:51:11,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {204#true} [120] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:51:11,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [122] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {204#true} is VALID [2022-04-07 17:51:11,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#true} [125] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-07 17:51:11,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} [167] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-07 17:51:11,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-07 17:51:11,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#true} [124] mainENTRY-->L97: Formula: (and (= v_main_~n_stones2~0_3 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~n_stones1~0_2 v_main_~n_stones2~0_3) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~m~0_2 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~n~0=v_main_~n~0_2, main_~m~0=v_main_~m~0_2, main_~n_stones2~0=v_main_~n_stones2~0_3, main_~n_stones1~0=v_main_~n_stones1~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~m~0, main_~n~0, main_~n_stones2~0, main_~n_stones1~0, main_~a~0] {204#true} is VALID [2022-04-07 17:51:11,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {204#true} [126] L97-->L104: Formula: (and (<= 1 v_main_~m~0_3) (<= 1 v_main_~n~0_3) (<= v_main_~a~0_3 109) (<= v_main_~m~0_3 109) (<= 1 v_main_~a~0_3) (<= v_main_~n~0_3 109)) InVars {main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-07 17:51:11,871 INFO L272 TraceCheckUtils]: 7: Hoare triple {204#true} [128] L104-->correct_versionENTRY: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {204#true} is VALID [2022-04-07 17:51:11,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#true} [131] correct_versionENTRY-->L38-2: Formula: (and (= |v_correct_version_#in~m_1| v_correct_version_~m_1) (= |v_correct_version_#in~a_1| v_correct_version_~a_1) (= v_correct_version_~i~0_2 0) (= v_correct_version_~l~0_1 0) (= |v_correct_version_#in~n_1| v_correct_version_~n_1) (= v_correct_version_~b~0_1 0) (= v_correct_version_~j~0_1 0)) InVars {correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_#in~n=|v_correct_version_#in~n_1|} OutVars{correct_version_~n=v_correct_version_~n_1, correct_version_~m=v_correct_version_~m_1, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_~b~0=v_correct_version_~b~0_1, correct_version_#in~n=|v_correct_version_#in~n_1|, correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_~i~0=v_correct_version_~i~0_2, correct_version_~l~0=v_correct_version_~l~0_1, correct_version_~a=v_correct_version_~a_1, correct_version_~j~0=v_correct_version_~j~0_1} AuxVars[] AssignedVars[correct_version_~n, correct_version_~m, correct_version_~b~0, correct_version_~i~0, correct_version_~l~0, correct_version_~a, correct_version_~j~0] {204#true} is VALID [2022-04-07 17:51:11,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#true} [136] L38-2-->L44-1: Formula: (not (< v_correct_version_~b~0_2 v_correct_version_~n_2)) InVars {correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} OutVars{correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-07 17:51:11,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {204#true} [144] L44-1-->L44-2: Formula: (not (< v_correct_version_~l~0_2 v_correct_version_~m_2)) InVars {correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} OutVars{correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-07 17:51:11,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#true} [152] L44-2-->L52-2: Formula: (and (= v_correct_version_~x~0_4 0) (= v_correct_version_~y~0_4 0)) InVars {} OutVars{correct_version_~y~0=v_correct_version_~y~0_4, correct_version_~x~0=v_correct_version_~x~0_4} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] {232#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} is VALID [2022-04-07 17:51:11,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} [157] L52-2-->L52-3: Formula: (not (< v_correct_version_~x~0_1 v_correct_version_~i~0_1)) InVars {correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} OutVars{correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} AuxVars[] AssignedVars[] {232#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} is VALID [2022-04-07 17:51:11,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {232#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} [160] L52-3-->correct_versionFINAL: Formula: (= |v_correct_version_#res_1| v_correct_version_~y~0_3) InVars {correct_version_~y~0=v_correct_version_~y~0_3} OutVars{correct_version_#res=|v_correct_version_#res_1|, correct_version_~y~0=v_correct_version_~y~0_3} AuxVars[] AssignedVars[correct_version_#res] {233#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} is VALID [2022-04-07 17:51:11,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {233#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} [164] correct_versionFINAL-->correct_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} is VALID [2022-04-07 17:51:11,875 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {233#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} {204#true} [170] correct_versionEXIT-->L104-1: AOR: Formula: (= |v_main_#t~ret8_4| |v_correct_version_#resOutParam_1|) InVars {correct_version_#res=|v_correct_version_#resOutParam_1|} OutVars{main_#t~ret8=|v_main_#t~ret8_4|} AuxVars[] AssignedVars[main_#t~ret8, correct_version_#res] LVA: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {217#(= |main_#t~ret8| 0)} is VALID [2022-04-07 17:51:11,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {217#(= |main_#t~ret8| 0)} [130] L104-1-->L105: Formula: (and (<= |v_main_#t~ret8_3| 2147483647) (= |v_main_#t~ret8_3| v_main_~n_stones1~0_4) (<= 0 (+ |v_main_#t~ret8_3| 2147483648))) InVars {main_#t~ret8=|v_main_#t~ret8_3|} OutVars{main_~n_stones1~0=v_main_~n_stones1~0_4} AuxVars[] AssignedVars[main_#t~ret8, main_~n_stones1~0] {218#(= main_~n_stones1~0 0)} is VALID [2022-04-07 17:51:11,876 INFO L272 TraceCheckUtils]: 17: Hoare triple {218#(= main_~n_stones1~0 0)} [134] L105-->student_versionENTRY: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {204#true} is VALID [2022-04-07 17:51:11,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {204#true} [142] student_versionENTRY-->L65-2: Formula: (and (= v_student_version_~b~1_3 0) (= v_student_version_~m_3 |v_student_version_#in~m_1|) (= v_student_version_~a_3 |v_student_version_#in~a_1|) (= v_student_version_~n_2 |v_student_version_#in~n_1|) (= v_student_version_~j~1_3 0) (= v_student_version_~l~1_4 0) (= v_student_version_~i~1_4 0)) InVars {student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_#in~a=|v_student_version_#in~a_1|} OutVars{student_version_~i~1=v_student_version_~i~1_4, student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_~a=v_student_version_~a_3, student_version_~j~1=v_student_version_~j~1_3, student_version_~l~1=v_student_version_~l~1_4, student_version_~b~1=v_student_version_~b~1_3, student_version_~n=v_student_version_~n_2, student_version_#in~a=|v_student_version_#in~a_1|, student_version_~m=v_student_version_~m_3} AuxVars[] AssignedVars[student_version_~i~1, student_version_~a, student_version_~j~1, student_version_~l~1, student_version_~b~1, student_version_~n, student_version_~m] {204#true} is VALID [2022-04-07 17:51:11,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {204#true} [150] L65-2-->L71-1: Formula: (not (< v_student_version_~b~1_4 v_student_version_~n_3)) InVars {student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} OutVars{student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-07 17:51:11,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {204#true} [154] L71-1-->L71-2: Formula: (not (< v_student_version_~l~1_1 v_student_version_~m_1)) InVars {student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} OutVars{student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-07 17:51:11,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {204#true} [159] L71-2-->L79-2: Formula: (and (= v_student_version_~y~1_1 0) (= v_student_version_~x~1_1 0)) InVars {} OutVars{student_version_~x~1=v_student_version_~x~1_1, student_version_~y~1=v_student_version_~y~1_1} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {234#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} is VALID [2022-04-07 17:51:11,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {234#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} [162] L79-2-->L79-3: Formula: (not (< v_student_version_~x~1_2 v_student_version_~i~1_3)) InVars {student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} OutVars{student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} AuxVars[] AssignedVars[] {234#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} is VALID [2022-04-07 17:51:11,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {234#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} [165] L79-3-->student_versionFINAL: Formula: (= v_student_version_~y~1_4 |v_student_version_#res_1|) InVars {student_version_~y~1=v_student_version_~y~1_4} OutVars{student_version_#res=|v_student_version_#res_1|, student_version_~y~1=v_student_version_~y~1_4} AuxVars[] AssignedVars[student_version_#res] {235#(= |student_version_#res| 0)} is VALID [2022-04-07 17:51:11,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {235#(= |student_version_#res| 0)} [166] student_versionFINAL-->student_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#(= |student_version_#res| 0)} is VALID [2022-04-07 17:51:11,883 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {235#(= |student_version_#res| 0)} {218#(= main_~n_stones1~0 0)} [171] student_versionEXIT-->L105-1: AOR: Formula: (= |v_main_#t~ret9_4| |v_student_version_#resOutParam_1|) InVars {student_version_#res=|v_student_version_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_4|} AuxVars[] AssignedVars[student_version_#res, main_#t~ret9] LVA: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {227#(= main_~n_stones1~0 |main_#t~ret9|)} is VALID [2022-04-07 17:51:11,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {227#(= main_~n_stones1~0 |main_#t~ret9|)} [141] L105-1-->L97-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647) (= |v_main_#t~ret9_2| v_main_~n_stones2~0_1)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_~n_stones2~0=v_main_~n_stones2~0_1} AuxVars[] AssignedVars[main_~n_stones2~0, main_#t~ret9] {228#(= main_~n_stones2~0 main_~n_stones1~0)} is VALID [2022-04-07 17:51:11,884 INFO L272 TraceCheckUtils]: 27: Hoare triple {228#(= main_~n_stones2~0 main_~n_stones1~0)} [129] L97-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n_stones1~0_5 v_main_~n_stones2~0_4) 1 0)) InVars {main_~n_stones2~0=v_main_~n_stones2~0_4, main_~n_stones1~0=v_main_~n_stones1~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n_stones2~0, main_~n_stones1~0] {229#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:51:11,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {229#(not (= |__VERIFIER_assert_#in~cond| 0))} [133] __VERIFIER_assertENTRY-->L6: 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] {230#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:51:11,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {230#(not (= __VERIFIER_assert_~cond 0))} [139] L6-->L7: 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[] {205#false} is VALID [2022-04-07 17:51:11,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {205#false} [146] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {205#false} is VALID [2022-04-07 17:51:11,886 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-07 17:51:11,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:51:11,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921399904] [2022-04-07 17:51:11,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921399904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:51:11,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:51:11,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-07 17:51:11,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623885012] [2022-04-07 17:51:11,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:51:11,888 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-07 17:51:11,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:51:11,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:11,916 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-07 17:51:11,918 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-07 17:51:11,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:51:11,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-07 17:51:11,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-04-07 17:51:11,922 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:12,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:12,741 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-07 17:51:12,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 17:51:12,741 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-07 17:51:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:51:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 57 transitions. [2022-04-07 17:51:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:12,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 57 transitions. [2022-04-07 17:51:12,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 57 transitions. [2022-04-07 17:51:12,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:12,814 INFO L225 Difference]: With dead ends: 48 [2022-04-07 17:51:12,814 INFO L226 Difference]: Without dead ends: 44 [2022-04-07 17:51:12,814 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-04-07 17:51:12,815 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 17:51:12,816 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 80 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 295 Invalid, 0 Unknown, 40 Unchecked, 0.3s Time] [2022-04-07 17:51:12,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-07 17:51:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-04-07 17:51:12,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:51:12,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:12,822 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:12,823 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:12,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:12,826 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-07 17:51:12,826 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-07 17:51:12,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:12,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:12,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 44 states. [2022-04-07 17:51:12,828 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 44 states. [2022-04-07 17:51:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:12,831 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-07 17:51:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-07 17:51:12,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:12,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:12,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:51:12,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:51:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-07 17:51:12,835 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 31 [2022-04-07 17:51:12,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:51:12,835 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-07 17:51:12,835 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-07 17:51:12,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 17:51:12,837 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:51:12,837 INFO L499 BasicCegarLoop]: trace histogram [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-07 17:51:12,837 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 17:51:12,837 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:51:12,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:51:12,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1260090278, now seen corresponding path program 1 times [2022-04-07 17:51:12,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:51:12,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4409146] [2022-04-07 17:51:12,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:12,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:51:12,862 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 17:51:12,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578338271] [2022-04-07 17:51:12,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:12,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:12,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:51:12,868 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-07 17:51:12,891 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-07 17:51:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:12,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 17:51:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:12,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:51:13,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {439#true} [120] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#true} is VALID [2022-04-07 17:51:13,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {439#true} [122] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {439#true} is VALID [2022-04-07 17:51:13,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {439#true} [125] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#true} is VALID [2022-04-07 17:51:13,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {439#true} {439#true} [167] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#true} is VALID [2022-04-07 17:51:13,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {439#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#true} is VALID [2022-04-07 17:51:13,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {439#true} [124] mainENTRY-->L97: Formula: (and (= v_main_~n_stones2~0_3 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~n_stones1~0_2 v_main_~n_stones2~0_3) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~m~0_2 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~n~0=v_main_~n~0_2, main_~m~0=v_main_~m~0_2, main_~n_stones2~0=v_main_~n_stones2~0_3, main_~n_stones1~0=v_main_~n_stones1~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~m~0, main_~n~0, main_~n_stones2~0, main_~n_stones1~0, main_~a~0] {439#true} is VALID [2022-04-07 17:51:13,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {439#true} [126] L97-->L104: Formula: (and (<= 1 v_main_~m~0_3) (<= 1 v_main_~n~0_3) (<= v_main_~a~0_3 109) (<= v_main_~m~0_3 109) (<= 1 v_main_~a~0_3) (<= v_main_~n~0_3 109)) InVars {main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {462#(<= 1 main_~n~0)} is VALID [2022-04-07 17:51:13,172 INFO L272 TraceCheckUtils]: 7: Hoare triple {462#(<= 1 main_~n~0)} [128] L104-->correct_versionENTRY: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {439#true} is VALID [2022-04-07 17:51:13,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {439#true} [131] correct_versionENTRY-->L38-2: Formula: (and (= |v_correct_version_#in~m_1| v_correct_version_~m_1) (= |v_correct_version_#in~a_1| v_correct_version_~a_1) (= v_correct_version_~i~0_2 0) (= v_correct_version_~l~0_1 0) (= |v_correct_version_#in~n_1| v_correct_version_~n_1) (= v_correct_version_~b~0_1 0) (= v_correct_version_~j~0_1 0)) InVars {correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_#in~n=|v_correct_version_#in~n_1|} OutVars{correct_version_~n=v_correct_version_~n_1, correct_version_~m=v_correct_version_~m_1, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_~b~0=v_correct_version_~b~0_1, correct_version_#in~n=|v_correct_version_#in~n_1|, correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_~i~0=v_correct_version_~i~0_2, correct_version_~l~0=v_correct_version_~l~0_1, correct_version_~a=v_correct_version_~a_1, correct_version_~j~0=v_correct_version_~j~0_1} AuxVars[] AssignedVars[correct_version_~n, correct_version_~m, correct_version_~b~0, correct_version_~i~0, correct_version_~l~0, correct_version_~a, correct_version_~j~0] {469#(and (<= correct_version_~b~0 0) (<= |correct_version_#in~n| correct_version_~n))} is VALID [2022-04-07 17:51:13,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {469#(and (<= correct_version_~b~0 0) (<= |correct_version_#in~n| correct_version_~n))} [136] L38-2-->L44-1: Formula: (not (< v_correct_version_~b~0_2 v_correct_version_~n_2)) InVars {correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} OutVars{correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} AuxVars[] AssignedVars[] {473#(<= |correct_version_#in~n| 0)} is VALID [2022-04-07 17:51:13,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(<= |correct_version_#in~n| 0)} [144] L44-1-->L44-2: Formula: (not (< v_correct_version_~l~0_2 v_correct_version_~m_2)) InVars {correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} OutVars{correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} AuxVars[] AssignedVars[] {473#(<= |correct_version_#in~n| 0)} is VALID [2022-04-07 17:51:13,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {473#(<= |correct_version_#in~n| 0)} [152] L44-2-->L52-2: Formula: (and (= v_correct_version_~x~0_4 0) (= v_correct_version_~y~0_4 0)) InVars {} OutVars{correct_version_~y~0=v_correct_version_~y~0_4, correct_version_~x~0=v_correct_version_~x~0_4} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] {473#(<= |correct_version_#in~n| 0)} is VALID [2022-04-07 17:51:13,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {473#(<= |correct_version_#in~n| 0)} [157] L52-2-->L52-3: Formula: (not (< v_correct_version_~x~0_1 v_correct_version_~i~0_1)) InVars {correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} OutVars{correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} AuxVars[] AssignedVars[] {473#(<= |correct_version_#in~n| 0)} is VALID [2022-04-07 17:51:13,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {473#(<= |correct_version_#in~n| 0)} [160] L52-3-->correct_versionFINAL: Formula: (= |v_correct_version_#res_1| v_correct_version_~y~0_3) InVars {correct_version_~y~0=v_correct_version_~y~0_3} OutVars{correct_version_#res=|v_correct_version_#res_1|, correct_version_~y~0=v_correct_version_~y~0_3} AuxVars[] AssignedVars[correct_version_#res] {473#(<= |correct_version_#in~n| 0)} is VALID [2022-04-07 17:51:13,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {473#(<= |correct_version_#in~n| 0)} [164] correct_versionFINAL-->correct_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473#(<= |correct_version_#in~n| 0)} is VALID [2022-04-07 17:51:13,178 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {473#(<= |correct_version_#in~n| 0)} {462#(<= 1 main_~n~0)} [170] correct_versionEXIT-->L104-1: AOR: Formula: (= |v_main_#t~ret8_4| |v_correct_version_#resOutParam_1|) InVars {correct_version_#res=|v_correct_version_#resOutParam_1|} OutVars{main_#t~ret8=|v_main_#t~ret8_4|} AuxVars[] AssignedVars[main_#t~ret8, correct_version_#res] LVA: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {440#false} is VALID [2022-04-07 17:51:13,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {440#false} [130] L104-1-->L105: Formula: (and (<= |v_main_#t~ret8_3| 2147483647) (= |v_main_#t~ret8_3| v_main_~n_stones1~0_4) (<= 0 (+ |v_main_#t~ret8_3| 2147483648))) InVars {main_#t~ret8=|v_main_#t~ret8_3|} OutVars{main_~n_stones1~0=v_main_~n_stones1~0_4} AuxVars[] AssignedVars[main_#t~ret8, main_~n_stones1~0] {440#false} is VALID [2022-04-07 17:51:13,179 INFO L272 TraceCheckUtils]: 17: Hoare triple {440#false} [134] L105-->student_versionENTRY: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {440#false} is VALID [2022-04-07 17:51:13,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {440#false} [142] student_versionENTRY-->L65-2: Formula: (and (= v_student_version_~b~1_3 0) (= v_student_version_~m_3 |v_student_version_#in~m_1|) (= v_student_version_~a_3 |v_student_version_#in~a_1|) (= v_student_version_~n_2 |v_student_version_#in~n_1|) (= v_student_version_~j~1_3 0) (= v_student_version_~l~1_4 0) (= v_student_version_~i~1_4 0)) InVars {student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_#in~a=|v_student_version_#in~a_1|} OutVars{student_version_~i~1=v_student_version_~i~1_4, student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_~a=v_student_version_~a_3, student_version_~j~1=v_student_version_~j~1_3, student_version_~l~1=v_student_version_~l~1_4, student_version_~b~1=v_student_version_~b~1_3, student_version_~n=v_student_version_~n_2, student_version_#in~a=|v_student_version_#in~a_1|, student_version_~m=v_student_version_~m_3} AuxVars[] AssignedVars[student_version_~i~1, student_version_~a, student_version_~j~1, student_version_~l~1, student_version_~b~1, student_version_~n, student_version_~m] {440#false} is VALID [2022-04-07 17:51:13,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {440#false} [150] L65-2-->L71-1: Formula: (not (< v_student_version_~b~1_4 v_student_version_~n_3)) InVars {student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} OutVars{student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} AuxVars[] AssignedVars[] {440#false} is VALID [2022-04-07 17:51:13,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {440#false} [154] L71-1-->L71-2: Formula: (not (< v_student_version_~l~1_1 v_student_version_~m_1)) InVars {student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} OutVars{student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} AuxVars[] AssignedVars[] {440#false} is VALID [2022-04-07 17:51:13,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {440#false} [159] L71-2-->L79-2: Formula: (and (= v_student_version_~y~1_1 0) (= v_student_version_~x~1_1 0)) InVars {} OutVars{student_version_~x~1=v_student_version_~x~1_1, student_version_~y~1=v_student_version_~y~1_1} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {440#false} is VALID [2022-04-07 17:51:13,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {440#false} [163] L79-2-->L79-2: Formula: (or (and (= (+ v_student_version_~y~1_2 (* v_student_version_~j~1_4 v_student_version_~x~1_4)) (+ v_student_version_~y~1_3 (* v_student_version_~j~1_4 v_student_version_~x~1_3))) (< v_student_version_~x~1_4 v_student_version_~x~1_3) (< v_student_version_~x~1_3 (+ v_student_version_~i~1_5 1))) (and (= v_student_version_~y~1_3 v_student_version_~y~1_2) (not (< v_student_version_~x~1_4 v_student_version_~i~1_5)) (= v_student_version_~x~1_4 v_student_version_~x~1_3))) InVars {student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_3, student_version_~x~1=v_student_version_~x~1_4, student_version_~j~1=v_student_version_~j~1_4} OutVars{student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_2, student_version_~x~1=v_student_version_~x~1_3, student_version_~j~1=v_student_version_~j~1_4} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {440#false} is VALID [2022-04-07 17:51:13,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {440#false} [162] L79-2-->L79-3: Formula: (not (< v_student_version_~x~1_2 v_student_version_~i~1_3)) InVars {student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} OutVars{student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} AuxVars[] AssignedVars[] {440#false} is VALID [2022-04-07 17:51:13,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {440#false} [165] L79-3-->student_versionFINAL: Formula: (= v_student_version_~y~1_4 |v_student_version_#res_1|) InVars {student_version_~y~1=v_student_version_~y~1_4} OutVars{student_version_#res=|v_student_version_#res_1|, student_version_~y~1=v_student_version_~y~1_4} AuxVars[] AssignedVars[student_version_#res] {440#false} is VALID [2022-04-07 17:51:13,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {440#false} [166] student_versionFINAL-->student_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {440#false} is VALID [2022-04-07 17:51:13,181 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {440#false} {440#false} [171] student_versionEXIT-->L105-1: AOR: Formula: (= |v_main_#t~ret9_4| |v_student_version_#resOutParam_1|) InVars {student_version_#res=|v_student_version_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_4|} AuxVars[] AssignedVars[student_version_#res, main_#t~ret9] LVA: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {440#false} is VALID [2022-04-07 17:51:13,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {440#false} [141] L105-1-->L97-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647) (= |v_main_#t~ret9_2| v_main_~n_stones2~0_1)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_~n_stones2~0=v_main_~n_stones2~0_1} AuxVars[] AssignedVars[main_~n_stones2~0, main_#t~ret9] {440#false} is VALID [2022-04-07 17:51:13,182 INFO L272 TraceCheckUtils]: 28: Hoare triple {440#false} [129] L97-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n_stones1~0_5 v_main_~n_stones2~0_4) 1 0)) InVars {main_~n_stones2~0=v_main_~n_stones2~0_4, main_~n_stones1~0=v_main_~n_stones1~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n_stones2~0, main_~n_stones1~0] {440#false} is VALID [2022-04-07 17:51:13,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {440#false} [133] __VERIFIER_assertENTRY-->L6: 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] {440#false} is VALID [2022-04-07 17:51:13,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {440#false} [139] L6-->L7: 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[] {440#false} is VALID [2022-04-07 17:51:13,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {440#false} [146] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {440#false} is VALID [2022-04-07 17:51:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 17:51:13,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 17:51:13,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:51:13,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4409146] [2022-04-07 17:51:13,184 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 17:51:13,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578338271] [2022-04-07 17:51:13,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578338271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:51:13,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:51:13,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 17:51:13,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905295685] [2022-04-07 17:51:13,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:51:13,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-04-07 17:51:13,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:51:13,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:13,221 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-07 17:51:13,222 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 17:51:13,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:51:13,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 17:51:13,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 17:51:13,223 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:13,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:13,348 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-07 17:51:13,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 17:51:13,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-04-07 17:51:13,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:51:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-07 17:51:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:13,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-07 17:51:13,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-07 17:51:13,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:13,396 INFO L225 Difference]: With dead ends: 53 [2022-04-07 17:51:13,396 INFO L226 Difference]: Without dead ends: 43 [2022-04-07 17:51:13,397 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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-07 17:51:13,398 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:51:13,398 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 127 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-07 17:51:13,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-07 17:51:13,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-07 17:51:13,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:51:13,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:13,403 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:13,404 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:13,406 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-07 17:51:13,406 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-07 17:51:13,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:13,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:13,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 43 states. [2022-04-07 17:51:13,408 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 43 states. [2022-04-07 17:51:13,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:13,410 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-07 17:51:13,410 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-07 17:51:13,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:13,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:13,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:51:13,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:51:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-07 17:51:13,414 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 32 [2022-04-07 17:51:13,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:51:13,414 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-07 17:51:13,414 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:13,414 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-07 17:51:13,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 17:51:13,415 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:51:13,415 INFO L499 BasicCegarLoop]: trace histogram [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, 1] [2022-04-07 17:51:13,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 17:51:13,631 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:13,632 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:51:13,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:51:13,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1007047745, now seen corresponding path program 1 times [2022-04-07 17:51:13,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:51:13,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448588248] [2022-04-07 17:51:13,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:13,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:51:13,659 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 17:51:13,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [947340501] [2022-04-07 17:51:13,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:13,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:13,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:51:13,669 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-07 17:51:13,670 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-07 17:51:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:13,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 17:51:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:13,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:51:13,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {723#true} [120] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {723#true} is VALID [2022-04-07 17:51:13,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {723#true} [122] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {723#true} is VALID [2022-04-07 17:51:13,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {723#true} [125] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {723#true} is VALID [2022-04-07 17:51:13,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {723#true} {723#true} [167] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {723#true} is VALID [2022-04-07 17:51:13,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {723#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {723#true} is VALID [2022-04-07 17:51:13,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {723#true} [124] mainENTRY-->L97: Formula: (and (= v_main_~n_stones2~0_3 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~n_stones1~0_2 v_main_~n_stones2~0_3) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~m~0_2 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~n~0=v_main_~n~0_2, main_~m~0=v_main_~m~0_2, main_~n_stones2~0=v_main_~n_stones2~0_3, main_~n_stones1~0=v_main_~n_stones1~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~m~0, main_~n~0, main_~n_stones2~0, main_~n_stones1~0, main_~a~0] {723#true} is VALID [2022-04-07 17:51:13,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {723#true} [126] L97-->L104: Formula: (and (<= 1 v_main_~m~0_3) (<= 1 v_main_~n~0_3) (<= v_main_~a~0_3 109) (<= v_main_~m~0_3 109) (<= 1 v_main_~a~0_3) (<= v_main_~n~0_3 109)) InVars {main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {746#(<= 1 main_~m~0)} is VALID [2022-04-07 17:51:13,904 INFO L272 TraceCheckUtils]: 7: Hoare triple {746#(<= 1 main_~m~0)} [128] L104-->correct_versionENTRY: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {723#true} is VALID [2022-04-07 17:51:13,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {723#true} [131] correct_versionENTRY-->L38-2: Formula: (and (= |v_correct_version_#in~m_1| v_correct_version_~m_1) (= |v_correct_version_#in~a_1| v_correct_version_~a_1) (= v_correct_version_~i~0_2 0) (= v_correct_version_~l~0_1 0) (= |v_correct_version_#in~n_1| v_correct_version_~n_1) (= v_correct_version_~b~0_1 0) (= v_correct_version_~j~0_1 0)) InVars {correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_#in~n=|v_correct_version_#in~n_1|} OutVars{correct_version_~n=v_correct_version_~n_1, correct_version_~m=v_correct_version_~m_1, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_~b~0=v_correct_version_~b~0_1, correct_version_#in~n=|v_correct_version_#in~n_1|, correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_~i~0=v_correct_version_~i~0_2, correct_version_~l~0=v_correct_version_~l~0_1, correct_version_~a=v_correct_version_~a_1, correct_version_~j~0=v_correct_version_~j~0_1} AuxVars[] AssignedVars[correct_version_~n, correct_version_~m, correct_version_~b~0, correct_version_~i~0, correct_version_~l~0, correct_version_~a, correct_version_~j~0] {753#(and (<= |correct_version_#in~m| correct_version_~m) (<= correct_version_~l~0 0))} is VALID [2022-04-07 17:51:13,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {753#(and (<= |correct_version_#in~m| correct_version_~m) (<= correct_version_~l~0 0))} [137] L38-2-->L38-2: Formula: (or (and (= v_correct_version_~i~0_5 v_correct_version_~i~0_4) (= v_correct_version_~b~0_3 v_correct_version_~b~0_4) (<= v_correct_version_~n_3 v_correct_version_~b~0_4)) (and (= (+ (* v_correct_version_~a_2 (+ (* (- 1) v_correct_version_~i~0_5) v_correct_version_~i~0_4)) v_correct_version_~b~0_4) v_correct_version_~b~0_3) (< v_correct_version_~i~0_5 v_correct_version_~i~0_4) (forall ((v_it_1 Int)) (or (< (+ v_correct_version_~b~0_4 (* v_it_1 v_correct_version_~a_2)) v_correct_version_~n_3) (not (<= 1 v_it_1)) (not (<= (+ v_it_1 v_correct_version_~i~0_5 1) v_correct_version_~i~0_4)))) (< v_correct_version_~b~0_4 v_correct_version_~n_3))) InVars {correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_5, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_4} OutVars{correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_4, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_3} AuxVars[] AssignedVars[correct_version_~b~0, correct_version_~i~0] {753#(and (<= |correct_version_#in~m| correct_version_~m) (<= correct_version_~l~0 0))} is VALID [2022-04-07 17:51:13,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {753#(and (<= |correct_version_#in~m| correct_version_~m) (<= correct_version_~l~0 0))} [136] L38-2-->L44-1: Formula: (not (< v_correct_version_~b~0_2 v_correct_version_~n_2)) InVars {correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} OutVars{correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} AuxVars[] AssignedVars[] {753#(and (<= |correct_version_#in~m| correct_version_~m) (<= correct_version_~l~0 0))} is VALID [2022-04-07 17:51:13,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {753#(and (<= |correct_version_#in~m| correct_version_~m) (<= correct_version_~l~0 0))} [144] L44-1-->L44-2: Formula: (not (< v_correct_version_~l~0_2 v_correct_version_~m_2)) InVars {correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} OutVars{correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} AuxVars[] AssignedVars[] {763#(<= |correct_version_#in~m| 0)} is VALID [2022-04-07 17:51:13,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {763#(<= |correct_version_#in~m| 0)} [152] L44-2-->L52-2: Formula: (and (= v_correct_version_~x~0_4 0) (= v_correct_version_~y~0_4 0)) InVars {} OutVars{correct_version_~y~0=v_correct_version_~y~0_4, correct_version_~x~0=v_correct_version_~x~0_4} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] {763#(<= |correct_version_#in~m| 0)} is VALID [2022-04-07 17:51:13,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {763#(<= |correct_version_#in~m| 0)} [157] L52-2-->L52-3: Formula: (not (< v_correct_version_~x~0_1 v_correct_version_~i~0_1)) InVars {correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} OutVars{correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} AuxVars[] AssignedVars[] {763#(<= |correct_version_#in~m| 0)} is VALID [2022-04-07 17:51:13,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {763#(<= |correct_version_#in~m| 0)} [160] L52-3-->correct_versionFINAL: Formula: (= |v_correct_version_#res_1| v_correct_version_~y~0_3) InVars {correct_version_~y~0=v_correct_version_~y~0_3} OutVars{correct_version_#res=|v_correct_version_#res_1|, correct_version_~y~0=v_correct_version_~y~0_3} AuxVars[] AssignedVars[correct_version_#res] {763#(<= |correct_version_#in~m| 0)} is VALID [2022-04-07 17:51:13,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {763#(<= |correct_version_#in~m| 0)} [164] correct_versionFINAL-->correct_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {763#(<= |correct_version_#in~m| 0)} is VALID [2022-04-07 17:51:13,909 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {763#(<= |correct_version_#in~m| 0)} {746#(<= 1 main_~m~0)} [170] correct_versionEXIT-->L104-1: AOR: Formula: (= |v_main_#t~ret8_4| |v_correct_version_#resOutParam_1|) InVars {correct_version_#res=|v_correct_version_#resOutParam_1|} OutVars{main_#t~ret8=|v_main_#t~ret8_4|} AuxVars[] AssignedVars[main_#t~ret8, correct_version_#res] LVA: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {724#false} is VALID [2022-04-07 17:51:13,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {724#false} [130] L104-1-->L105: Formula: (and (<= |v_main_#t~ret8_3| 2147483647) (= |v_main_#t~ret8_3| v_main_~n_stones1~0_4) (<= 0 (+ |v_main_#t~ret8_3| 2147483648))) InVars {main_#t~ret8=|v_main_#t~ret8_3|} OutVars{main_~n_stones1~0=v_main_~n_stones1~0_4} AuxVars[] AssignedVars[main_#t~ret8, main_~n_stones1~0] {724#false} is VALID [2022-04-07 17:51:13,911 INFO L272 TraceCheckUtils]: 18: Hoare triple {724#false} [134] L105-->student_versionENTRY: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {724#false} is VALID [2022-04-07 17:51:13,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {724#false} [142] student_versionENTRY-->L65-2: Formula: (and (= v_student_version_~b~1_3 0) (= v_student_version_~m_3 |v_student_version_#in~m_1|) (= v_student_version_~a_3 |v_student_version_#in~a_1|) (= v_student_version_~n_2 |v_student_version_#in~n_1|) (= v_student_version_~j~1_3 0) (= v_student_version_~l~1_4 0) (= v_student_version_~i~1_4 0)) InVars {student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_#in~a=|v_student_version_#in~a_1|} OutVars{student_version_~i~1=v_student_version_~i~1_4, student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_~a=v_student_version_~a_3, student_version_~j~1=v_student_version_~j~1_3, student_version_~l~1=v_student_version_~l~1_4, student_version_~b~1=v_student_version_~b~1_3, student_version_~n=v_student_version_~n_2, student_version_#in~a=|v_student_version_#in~a_1|, student_version_~m=v_student_version_~m_3} AuxVars[] AssignedVars[student_version_~i~1, student_version_~a, student_version_~j~1, student_version_~l~1, student_version_~b~1, student_version_~n, student_version_~m] {724#false} is VALID [2022-04-07 17:51:13,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {724#false} [150] L65-2-->L71-1: Formula: (not (< v_student_version_~b~1_4 v_student_version_~n_3)) InVars {student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} OutVars{student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} AuxVars[] AssignedVars[] {724#false} is VALID [2022-04-07 17:51:13,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {724#false} [154] L71-1-->L71-2: Formula: (not (< v_student_version_~l~1_1 v_student_version_~m_1)) InVars {student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} OutVars{student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} AuxVars[] AssignedVars[] {724#false} is VALID [2022-04-07 17:51:13,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {724#false} [159] L71-2-->L79-2: Formula: (and (= v_student_version_~y~1_1 0) (= v_student_version_~x~1_1 0)) InVars {} OutVars{student_version_~x~1=v_student_version_~x~1_1, student_version_~y~1=v_student_version_~y~1_1} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {724#false} is VALID [2022-04-07 17:51:13,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {724#false} [163] L79-2-->L79-2: Formula: (or (and (= (+ v_student_version_~y~1_2 (* v_student_version_~j~1_4 v_student_version_~x~1_4)) (+ v_student_version_~y~1_3 (* v_student_version_~j~1_4 v_student_version_~x~1_3))) (< v_student_version_~x~1_4 v_student_version_~x~1_3) (< v_student_version_~x~1_3 (+ v_student_version_~i~1_5 1))) (and (= v_student_version_~y~1_3 v_student_version_~y~1_2) (not (< v_student_version_~x~1_4 v_student_version_~i~1_5)) (= v_student_version_~x~1_4 v_student_version_~x~1_3))) InVars {student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_3, student_version_~x~1=v_student_version_~x~1_4, student_version_~j~1=v_student_version_~j~1_4} OutVars{student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_2, student_version_~x~1=v_student_version_~x~1_3, student_version_~j~1=v_student_version_~j~1_4} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {724#false} is VALID [2022-04-07 17:51:13,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {724#false} [162] L79-2-->L79-3: Formula: (not (< v_student_version_~x~1_2 v_student_version_~i~1_3)) InVars {student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} OutVars{student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} AuxVars[] AssignedVars[] {724#false} is VALID [2022-04-07 17:51:13,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {724#false} [165] L79-3-->student_versionFINAL: Formula: (= v_student_version_~y~1_4 |v_student_version_#res_1|) InVars {student_version_~y~1=v_student_version_~y~1_4} OutVars{student_version_#res=|v_student_version_#res_1|, student_version_~y~1=v_student_version_~y~1_4} AuxVars[] AssignedVars[student_version_#res] {724#false} is VALID [2022-04-07 17:51:13,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {724#false} [166] student_versionFINAL-->student_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {724#false} is VALID [2022-04-07 17:51:13,926 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {724#false} {724#false} [171] student_versionEXIT-->L105-1: AOR: Formula: (= |v_main_#t~ret9_4| |v_student_version_#resOutParam_1|) InVars {student_version_#res=|v_student_version_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_4|} AuxVars[] AssignedVars[student_version_#res, main_#t~ret9] LVA: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {724#false} is VALID [2022-04-07 17:51:13,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {724#false} [141] L105-1-->L97-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647) (= |v_main_#t~ret9_2| v_main_~n_stones2~0_1)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_~n_stones2~0=v_main_~n_stones2~0_1} AuxVars[] AssignedVars[main_~n_stones2~0, main_#t~ret9] {724#false} is VALID [2022-04-07 17:51:13,927 INFO L272 TraceCheckUtils]: 29: Hoare triple {724#false} [129] L97-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n_stones1~0_5 v_main_~n_stones2~0_4) 1 0)) InVars {main_~n_stones2~0=v_main_~n_stones2~0_4, main_~n_stones1~0=v_main_~n_stones1~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n_stones2~0, main_~n_stones1~0] {724#false} is VALID [2022-04-07 17:51:13,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {724#false} [133] __VERIFIER_assertENTRY-->L6: 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] {724#false} is VALID [2022-04-07 17:51:13,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {724#false} [139] L6-->L7: 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[] {724#false} is VALID [2022-04-07 17:51:13,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {724#false} [146] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {724#false} is VALID [2022-04-07 17:51:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 17:51:13,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 17:51:13,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:51:13,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448588248] [2022-04-07 17:51:13,928 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 17:51:13,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947340501] [2022-04-07 17:51:13,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947340501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:51:13,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:51:13,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 17:51:13,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568040] [2022-04-07 17:51:13,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:51:13,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2022-04-07 17:51:13,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:51:13,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:13,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:13,957 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 17:51:13,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:51:13,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 17:51:13,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 17:51:13,958 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:14,053 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-07 17:51:14,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 17:51:14,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2022-04-07 17:51:14,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:51:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-07 17:51:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-07 17:51:14,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-07 17:51:14,096 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-07 17:51:14,098 INFO L225 Difference]: With dead ends: 53 [2022-04-07 17:51:14,098 INFO L226 Difference]: Without dead ends: 44 [2022-04-07 17:51:14,098 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:51:14,099 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:51:14,100 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 125 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-07 17:51:14,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-07 17:51:14,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-07 17:51:14,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:51:14,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 32 states have (on average 1.25) internal successors, (40), 34 states have internal predecessors, (40), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:14,104 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 32 states have (on average 1.25) internal successors, (40), 34 states have internal predecessors, (40), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:14,105 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 32 states have (on average 1.25) internal successors, (40), 34 states have internal predecessors, (40), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:14,107 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-07 17:51:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-07 17:51:14,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:14,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:14,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 32 states have (on average 1.25) internal successors, (40), 34 states have internal predecessors, (40), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 44 states. [2022-04-07 17:51:14,108 INFO L87 Difference]: Start difference. First operand has 44 states, 32 states have (on average 1.25) internal successors, (40), 34 states have internal predecessors, (40), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 44 states. [2022-04-07 17:51:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:14,110 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-07 17:51:14,110 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-07 17:51:14,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:14,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:14,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:51:14,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:51:14,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.25) internal successors, (40), 34 states have internal predecessors, (40), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:14,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-07 17:51:14,113 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 33 [2022-04-07 17:51:14,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:51:14,113 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-07 17:51:14,113 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-07 17:51:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 17:51:14,114 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:51:14,114 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1] [2022-04-07 17:51:14,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 17:51:14,327 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-07 17:51:14,328 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:51:14,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:51:14,328 INFO L85 PathProgramCache]: Analyzing trace with hash 111102768, now seen corresponding path program 1 times [2022-04-07 17:51:14,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:51:14,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736558443] [2022-04-07 17:51:14,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:14,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:51:14,351 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 17:51:14,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1770893512] [2022-04-07 17:51:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:14,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:14,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:51:14,354 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-07 17:51:14,382 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-07 17:51:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:14,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 17:51:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:14,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:51:14,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {1013#true} [120] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1013#true} is VALID [2022-04-07 17:51:14,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {1013#true} [122] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1013#true} is VALID [2022-04-07 17:51:14,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {1013#true} [125] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1013#true} is VALID [2022-04-07 17:51:14,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1013#true} {1013#true} [167] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1013#true} is VALID [2022-04-07 17:51:14,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {1013#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1013#true} is VALID [2022-04-07 17:51:14,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {1013#true} [124] mainENTRY-->L97: Formula: (and (= v_main_~n_stones2~0_3 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~n_stones1~0_2 v_main_~n_stones2~0_3) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~m~0_2 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~n~0=v_main_~n~0_2, main_~m~0=v_main_~m~0_2, main_~n_stones2~0=v_main_~n_stones2~0_3, main_~n_stones1~0=v_main_~n_stones1~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~m~0, main_~n~0, main_~n_stones2~0, main_~n_stones1~0, main_~a~0] {1013#true} is VALID [2022-04-07 17:51:14,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {1013#true} [126] L97-->L104: Formula: (and (<= 1 v_main_~m~0_3) (<= 1 v_main_~n~0_3) (<= v_main_~a~0_3 109) (<= v_main_~m~0_3 109) (<= 1 v_main_~a~0_3) (<= v_main_~n~0_3 109)) InVars {main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1036#(<= 1 main_~n~0)} is VALID [2022-04-07 17:51:14,573 INFO L272 TraceCheckUtils]: 7: Hoare triple {1036#(<= 1 main_~n~0)} [128] L104-->correct_versionENTRY: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {1013#true} is VALID [2022-04-07 17:51:14,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {1013#true} [131] correct_versionENTRY-->L38-2: Formula: (and (= |v_correct_version_#in~m_1| v_correct_version_~m_1) (= |v_correct_version_#in~a_1| v_correct_version_~a_1) (= v_correct_version_~i~0_2 0) (= v_correct_version_~l~0_1 0) (= |v_correct_version_#in~n_1| v_correct_version_~n_1) (= v_correct_version_~b~0_1 0) (= v_correct_version_~j~0_1 0)) InVars {correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_#in~n=|v_correct_version_#in~n_1|} OutVars{correct_version_~n=v_correct_version_~n_1, correct_version_~m=v_correct_version_~m_1, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_~b~0=v_correct_version_~b~0_1, correct_version_#in~n=|v_correct_version_#in~n_1|, correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_~i~0=v_correct_version_~i~0_2, correct_version_~l~0=v_correct_version_~l~0_1, correct_version_~a=v_correct_version_~a_1, correct_version_~j~0=v_correct_version_~j~0_1} AuxVars[] AssignedVars[correct_version_~n, correct_version_~m, correct_version_~b~0, correct_version_~i~0, correct_version_~l~0, correct_version_~a, correct_version_~j~0] {1013#true} is VALID [2022-04-07 17:51:14,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {1013#true} [137] L38-2-->L38-2: Formula: (or (and (= v_correct_version_~i~0_5 v_correct_version_~i~0_4) (= v_correct_version_~b~0_3 v_correct_version_~b~0_4) (<= v_correct_version_~n_3 v_correct_version_~b~0_4)) (and (= (+ (* v_correct_version_~a_2 (+ (* (- 1) v_correct_version_~i~0_5) v_correct_version_~i~0_4)) v_correct_version_~b~0_4) v_correct_version_~b~0_3) (< v_correct_version_~i~0_5 v_correct_version_~i~0_4) (forall ((v_it_1 Int)) (or (< (+ v_correct_version_~b~0_4 (* v_it_1 v_correct_version_~a_2)) v_correct_version_~n_3) (not (<= 1 v_it_1)) (not (<= (+ v_it_1 v_correct_version_~i~0_5 1) v_correct_version_~i~0_4)))) (< v_correct_version_~b~0_4 v_correct_version_~n_3))) InVars {correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_5, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_4} OutVars{correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_4, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_3} AuxVars[] AssignedVars[correct_version_~b~0, correct_version_~i~0] {1013#true} is VALID [2022-04-07 17:51:14,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {1013#true} [136] L38-2-->L44-1: Formula: (not (< v_correct_version_~b~0_2 v_correct_version_~n_2)) InVars {correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} OutVars{correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} AuxVars[] AssignedVars[] {1013#true} is VALID [2022-04-07 17:51:14,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {1013#true} [145] L44-1-->L44-1: Formula: (or (and (<= v_correct_version_~m_3 v_correct_version_~l~0_4) (= v_correct_version_~l~0_4 v_correct_version_~l~0_3) (= v_correct_version_~j~0_4 v_correct_version_~j~0_3)) (and (= (+ (* (+ (* (- 1) v_correct_version_~j~0_4) v_correct_version_~j~0_3) v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~l~0_3) (< v_correct_version_~j~0_4 v_correct_version_~j~0_3) (< v_correct_version_~l~0_4 v_correct_version_~m_3) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 v_correct_version_~j~0_4 1) v_correct_version_~j~0_3)) (< (+ (* v_it_2 v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~m_3))))) InVars {correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_4, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_4} OutVars{correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_3, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_3} AuxVars[] AssignedVars[correct_version_~l~0, correct_version_~j~0] {1013#true} is VALID [2022-04-07 17:51:14,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {1013#true} [144] L44-1-->L44-2: Formula: (not (< v_correct_version_~l~0_2 v_correct_version_~m_2)) InVars {correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} OutVars{correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} AuxVars[] AssignedVars[] {1013#true} is VALID [2022-04-07 17:51:14,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {1013#true} [152] L44-2-->L52-2: Formula: (and (= v_correct_version_~x~0_4 0) (= v_correct_version_~y~0_4 0)) InVars {} OutVars{correct_version_~y~0=v_correct_version_~y~0_4, correct_version_~x~0=v_correct_version_~x~0_4} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] {1013#true} is VALID [2022-04-07 17:51:14,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {1013#true} [157] L52-2-->L52-3: Formula: (not (< v_correct_version_~x~0_1 v_correct_version_~i~0_1)) InVars {correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} OutVars{correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} AuxVars[] AssignedVars[] {1013#true} is VALID [2022-04-07 17:51:14,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {1013#true} [160] L52-3-->correct_versionFINAL: Formula: (= |v_correct_version_#res_1| v_correct_version_~y~0_3) InVars {correct_version_~y~0=v_correct_version_~y~0_3} OutVars{correct_version_#res=|v_correct_version_#res_1|, correct_version_~y~0=v_correct_version_~y~0_3} AuxVars[] AssignedVars[correct_version_#res] {1013#true} is VALID [2022-04-07 17:51:14,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {1013#true} [164] correct_versionFINAL-->correct_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1013#true} is VALID [2022-04-07 17:51:14,575 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1013#true} {1036#(<= 1 main_~n~0)} [170] correct_versionEXIT-->L104-1: AOR: Formula: (= |v_main_#t~ret8_4| |v_correct_version_#resOutParam_1|) InVars {correct_version_#res=|v_correct_version_#resOutParam_1|} OutVars{main_#t~ret8=|v_main_#t~ret8_4|} AuxVars[] AssignedVars[main_#t~ret8, correct_version_#res] LVA: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {1036#(<= 1 main_~n~0)} is VALID [2022-04-07 17:51:14,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {1036#(<= 1 main_~n~0)} [130] L104-1-->L105: Formula: (and (<= |v_main_#t~ret8_3| 2147483647) (= |v_main_#t~ret8_3| v_main_~n_stones1~0_4) (<= 0 (+ |v_main_#t~ret8_3| 2147483648))) InVars {main_#t~ret8=|v_main_#t~ret8_3|} OutVars{main_~n_stones1~0=v_main_~n_stones1~0_4} AuxVars[] AssignedVars[main_#t~ret8, main_~n_stones1~0] {1036#(<= 1 main_~n~0)} is VALID [2022-04-07 17:51:14,576 INFO L272 TraceCheckUtils]: 19: Hoare triple {1036#(<= 1 main_~n~0)} [134] L105-->student_versionENTRY: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {1013#true} is VALID [2022-04-07 17:51:14,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {1013#true} [142] student_versionENTRY-->L65-2: Formula: (and (= v_student_version_~b~1_3 0) (= v_student_version_~m_3 |v_student_version_#in~m_1|) (= v_student_version_~a_3 |v_student_version_#in~a_1|) (= v_student_version_~n_2 |v_student_version_#in~n_1|) (= v_student_version_~j~1_3 0) (= v_student_version_~l~1_4 0) (= v_student_version_~i~1_4 0)) InVars {student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_#in~a=|v_student_version_#in~a_1|} OutVars{student_version_~i~1=v_student_version_~i~1_4, student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_~a=v_student_version_~a_3, student_version_~j~1=v_student_version_~j~1_3, student_version_~l~1=v_student_version_~l~1_4, student_version_~b~1=v_student_version_~b~1_3, student_version_~n=v_student_version_~n_2, student_version_#in~a=|v_student_version_#in~a_1|, student_version_~m=v_student_version_~m_3} AuxVars[] AssignedVars[student_version_~i~1, student_version_~a, student_version_~j~1, student_version_~l~1, student_version_~b~1, student_version_~n, student_version_~m] {1079#(and (<= |student_version_#in~n| student_version_~n) (<= student_version_~b~1 0))} is VALID [2022-04-07 17:51:14,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {1079#(and (<= |student_version_#in~n| student_version_~n) (<= student_version_~b~1 0))} [150] L65-2-->L71-1: Formula: (not (< v_student_version_~b~1_4 v_student_version_~n_3)) InVars {student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} OutVars{student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} AuxVars[] AssignedVars[] {1083#(<= |student_version_#in~n| 0)} is VALID [2022-04-07 17:51:14,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {1083#(<= |student_version_#in~n| 0)} [154] L71-1-->L71-2: Formula: (not (< v_student_version_~l~1_1 v_student_version_~m_1)) InVars {student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} OutVars{student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} AuxVars[] AssignedVars[] {1083#(<= |student_version_#in~n| 0)} is VALID [2022-04-07 17:51:14,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {1083#(<= |student_version_#in~n| 0)} [159] L71-2-->L79-2: Formula: (and (= v_student_version_~y~1_1 0) (= v_student_version_~x~1_1 0)) InVars {} OutVars{student_version_~x~1=v_student_version_~x~1_1, student_version_~y~1=v_student_version_~y~1_1} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {1083#(<= |student_version_#in~n| 0)} is VALID [2022-04-07 17:51:14,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {1083#(<= |student_version_#in~n| 0)} [163] L79-2-->L79-2: Formula: (or (and (= (+ v_student_version_~y~1_2 (* v_student_version_~j~1_4 v_student_version_~x~1_4)) (+ v_student_version_~y~1_3 (* v_student_version_~j~1_4 v_student_version_~x~1_3))) (< v_student_version_~x~1_4 v_student_version_~x~1_3) (< v_student_version_~x~1_3 (+ v_student_version_~i~1_5 1))) (and (= v_student_version_~y~1_3 v_student_version_~y~1_2) (not (< v_student_version_~x~1_4 v_student_version_~i~1_5)) (= v_student_version_~x~1_4 v_student_version_~x~1_3))) InVars {student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_3, student_version_~x~1=v_student_version_~x~1_4, student_version_~j~1=v_student_version_~j~1_4} OutVars{student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_2, student_version_~x~1=v_student_version_~x~1_3, student_version_~j~1=v_student_version_~j~1_4} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {1083#(<= |student_version_#in~n| 0)} is VALID [2022-04-07 17:51:14,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {1083#(<= |student_version_#in~n| 0)} [162] L79-2-->L79-3: Formula: (not (< v_student_version_~x~1_2 v_student_version_~i~1_3)) InVars {student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} OutVars{student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} AuxVars[] AssignedVars[] {1083#(<= |student_version_#in~n| 0)} is VALID [2022-04-07 17:51:14,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {1083#(<= |student_version_#in~n| 0)} [165] L79-3-->student_versionFINAL: Formula: (= v_student_version_~y~1_4 |v_student_version_#res_1|) InVars {student_version_~y~1=v_student_version_~y~1_4} OutVars{student_version_#res=|v_student_version_#res_1|, student_version_~y~1=v_student_version_~y~1_4} AuxVars[] AssignedVars[student_version_#res] {1083#(<= |student_version_#in~n| 0)} is VALID [2022-04-07 17:51:14,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {1083#(<= |student_version_#in~n| 0)} [166] student_versionFINAL-->student_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1083#(<= |student_version_#in~n| 0)} is VALID [2022-04-07 17:51:14,582 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1083#(<= |student_version_#in~n| 0)} {1036#(<= 1 main_~n~0)} [171] student_versionEXIT-->L105-1: AOR: Formula: (= |v_main_#t~ret9_4| |v_student_version_#resOutParam_1|) InVars {student_version_#res=|v_student_version_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_4|} AuxVars[] AssignedVars[student_version_#res, main_#t~ret9] LVA: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {1014#false} is VALID [2022-04-07 17:51:14,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {1014#false} [141] L105-1-->L97-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647) (= |v_main_#t~ret9_2| v_main_~n_stones2~0_1)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_~n_stones2~0=v_main_~n_stones2~0_1} AuxVars[] AssignedVars[main_~n_stones2~0, main_#t~ret9] {1014#false} is VALID [2022-04-07 17:51:14,582 INFO L272 TraceCheckUtils]: 30: Hoare triple {1014#false} [129] L97-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n_stones1~0_5 v_main_~n_stones2~0_4) 1 0)) InVars {main_~n_stones2~0=v_main_~n_stones2~0_4, main_~n_stones1~0=v_main_~n_stones1~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n_stones2~0, main_~n_stones1~0] {1014#false} is VALID [2022-04-07 17:51:14,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {1014#false} [133] __VERIFIER_assertENTRY-->L6: 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] {1014#false} is VALID [2022-04-07 17:51:14,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {1014#false} [139] L6-->L7: 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[] {1014#false} is VALID [2022-04-07 17:51:14,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {1014#false} [146] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1014#false} is VALID [2022-04-07 17:51:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 17:51:14,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 17:51:14,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:51:14,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736558443] [2022-04-07 17:51:14,583 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 17:51:14,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770893512] [2022-04-07 17:51:14,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770893512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:51:14,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:51:14,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 17:51:14,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035471957] [2022-04-07 17:51:14,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:51:14,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-04-07 17:51:14,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:51:14,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:14,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:14,609 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 17:51:14,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:51:14,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 17:51:14,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 17:51:14,610 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:14,720 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-07 17:51:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 17:51:14,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-04-07 17:51:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:51:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-07 17:51:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-07 17:51:14,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-07 17:51:14,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:14,768 INFO L225 Difference]: With dead ends: 55 [2022-04-07 17:51:14,768 INFO L226 Difference]: Without dead ends: 45 [2022-04-07 17:51:14,768 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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-07 17:51:14,770 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:51:14,771 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 127 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-07 17:51:14,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-07 17:51:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-07 17:51:14,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:51:14,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:14,778 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:14,778 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:14,780 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-07 17:51:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-07 17:51:14,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:14,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:14,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 45 states. [2022-04-07 17:51:14,782 INFO L87 Difference]: Start difference. First operand has 45 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 45 states. [2022-04-07 17:51:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:14,783 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-07 17:51:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-07 17:51:14,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:14,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:14,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:51:14,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:51:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-04-07 17:51:14,786 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 34 [2022-04-07 17:51:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:51:14,786 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-04-07 17:51:14,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-07 17:51:14,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 17:51:14,789 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:51:14,789 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2022-04-07 17:51:14,812 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-07 17:51:15,003 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:15,003 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:51:15,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:51:15,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1980049385, now seen corresponding path program 1 times [2022-04-07 17:51:15,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:51:15,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928872670] [2022-04-07 17:51:15,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:15,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:51:15,029 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 17:51:15,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646841626] [2022-04-07 17:51:15,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:15,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:15,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:51:15,031 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-07 17:51:15,036 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-07 17:51:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:15,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 17:51:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:15,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:51:15,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {1311#true} [120] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1311#true} is VALID [2022-04-07 17:51:15,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {1311#true} [122] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1311#true} is VALID [2022-04-07 17:51:15,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {1311#true} [125] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1311#true} is VALID [2022-04-07 17:51:15,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1311#true} {1311#true} [167] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1311#true} is VALID [2022-04-07 17:51:15,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {1311#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1311#true} is VALID [2022-04-07 17:51:15,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {1311#true} [124] mainENTRY-->L97: Formula: (and (= v_main_~n_stones2~0_3 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~n_stones1~0_2 v_main_~n_stones2~0_3) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~m~0_2 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~n~0=v_main_~n~0_2, main_~m~0=v_main_~m~0_2, main_~n_stones2~0=v_main_~n_stones2~0_3, main_~n_stones1~0=v_main_~n_stones1~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~m~0, main_~n~0, main_~n_stones2~0, main_~n_stones1~0, main_~a~0] {1311#true} is VALID [2022-04-07 17:51:15,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {1311#true} [126] L97-->L104: Formula: (and (<= 1 v_main_~m~0_3) (<= 1 v_main_~n~0_3) (<= v_main_~a~0_3 109) (<= v_main_~m~0_3 109) (<= 1 v_main_~a~0_3) (<= v_main_~n~0_3 109)) InVars {main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1334#(<= 1 main_~m~0)} is VALID [2022-04-07 17:51:15,245 INFO L272 TraceCheckUtils]: 7: Hoare triple {1334#(<= 1 main_~m~0)} [128] L104-->correct_versionENTRY: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {1311#true} is VALID [2022-04-07 17:51:15,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {1311#true} [131] correct_versionENTRY-->L38-2: Formula: (and (= |v_correct_version_#in~m_1| v_correct_version_~m_1) (= |v_correct_version_#in~a_1| v_correct_version_~a_1) (= v_correct_version_~i~0_2 0) (= v_correct_version_~l~0_1 0) (= |v_correct_version_#in~n_1| v_correct_version_~n_1) (= v_correct_version_~b~0_1 0) (= v_correct_version_~j~0_1 0)) InVars {correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_#in~n=|v_correct_version_#in~n_1|} OutVars{correct_version_~n=v_correct_version_~n_1, correct_version_~m=v_correct_version_~m_1, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_~b~0=v_correct_version_~b~0_1, correct_version_#in~n=|v_correct_version_#in~n_1|, correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_~i~0=v_correct_version_~i~0_2, correct_version_~l~0=v_correct_version_~l~0_1, correct_version_~a=v_correct_version_~a_1, correct_version_~j~0=v_correct_version_~j~0_1} AuxVars[] AssignedVars[correct_version_~n, correct_version_~m, correct_version_~b~0, correct_version_~i~0, correct_version_~l~0, correct_version_~a, correct_version_~j~0] {1311#true} is VALID [2022-04-07 17:51:15,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {1311#true} [137] L38-2-->L38-2: Formula: (or (and (= v_correct_version_~i~0_5 v_correct_version_~i~0_4) (= v_correct_version_~b~0_3 v_correct_version_~b~0_4) (<= v_correct_version_~n_3 v_correct_version_~b~0_4)) (and (= (+ (* v_correct_version_~a_2 (+ (* (- 1) v_correct_version_~i~0_5) v_correct_version_~i~0_4)) v_correct_version_~b~0_4) v_correct_version_~b~0_3) (< v_correct_version_~i~0_5 v_correct_version_~i~0_4) (forall ((v_it_1 Int)) (or (< (+ v_correct_version_~b~0_4 (* v_it_1 v_correct_version_~a_2)) v_correct_version_~n_3) (not (<= 1 v_it_1)) (not (<= (+ v_it_1 v_correct_version_~i~0_5 1) v_correct_version_~i~0_4)))) (< v_correct_version_~b~0_4 v_correct_version_~n_3))) InVars {correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_5, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_4} OutVars{correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_4, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_3} AuxVars[] AssignedVars[correct_version_~b~0, correct_version_~i~0] {1311#true} is VALID [2022-04-07 17:51:15,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {1311#true} [136] L38-2-->L44-1: Formula: (not (< v_correct_version_~b~0_2 v_correct_version_~n_2)) InVars {correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} OutVars{correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} AuxVars[] AssignedVars[] {1311#true} is VALID [2022-04-07 17:51:15,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {1311#true} [145] L44-1-->L44-1: Formula: (or (and (<= v_correct_version_~m_3 v_correct_version_~l~0_4) (= v_correct_version_~l~0_4 v_correct_version_~l~0_3) (= v_correct_version_~j~0_4 v_correct_version_~j~0_3)) (and (= (+ (* (+ (* (- 1) v_correct_version_~j~0_4) v_correct_version_~j~0_3) v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~l~0_3) (< v_correct_version_~j~0_4 v_correct_version_~j~0_3) (< v_correct_version_~l~0_4 v_correct_version_~m_3) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 v_correct_version_~j~0_4 1) v_correct_version_~j~0_3)) (< (+ (* v_it_2 v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~m_3))))) InVars {correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_4, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_4} OutVars{correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_3, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_3} AuxVars[] AssignedVars[correct_version_~l~0, correct_version_~j~0] {1311#true} is VALID [2022-04-07 17:51:15,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {1311#true} [144] L44-1-->L44-2: Formula: (not (< v_correct_version_~l~0_2 v_correct_version_~m_2)) InVars {correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} OutVars{correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} AuxVars[] AssignedVars[] {1311#true} is VALID [2022-04-07 17:51:15,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {1311#true} [152] L44-2-->L52-2: Formula: (and (= v_correct_version_~x~0_4 0) (= v_correct_version_~y~0_4 0)) InVars {} OutVars{correct_version_~y~0=v_correct_version_~y~0_4, correct_version_~x~0=v_correct_version_~x~0_4} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] {1311#true} is VALID [2022-04-07 17:51:15,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {1311#true} [157] L52-2-->L52-3: Formula: (not (< v_correct_version_~x~0_1 v_correct_version_~i~0_1)) InVars {correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} OutVars{correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} AuxVars[] AssignedVars[] {1311#true} is VALID [2022-04-07 17:51:15,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {1311#true} [160] L52-3-->correct_versionFINAL: Formula: (= |v_correct_version_#res_1| v_correct_version_~y~0_3) InVars {correct_version_~y~0=v_correct_version_~y~0_3} OutVars{correct_version_#res=|v_correct_version_#res_1|, correct_version_~y~0=v_correct_version_~y~0_3} AuxVars[] AssignedVars[correct_version_#res] {1311#true} is VALID [2022-04-07 17:51:15,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {1311#true} [164] correct_versionFINAL-->correct_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1311#true} is VALID [2022-04-07 17:51:15,247 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1311#true} {1334#(<= 1 main_~m~0)} [170] correct_versionEXIT-->L104-1: AOR: Formula: (= |v_main_#t~ret8_4| |v_correct_version_#resOutParam_1|) InVars {correct_version_#res=|v_correct_version_#resOutParam_1|} OutVars{main_#t~ret8=|v_main_#t~ret8_4|} AuxVars[] AssignedVars[main_#t~ret8, correct_version_#res] LVA: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {1334#(<= 1 main_~m~0)} is VALID [2022-04-07 17:51:15,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {1334#(<= 1 main_~m~0)} [130] L104-1-->L105: Formula: (and (<= |v_main_#t~ret8_3| 2147483647) (= |v_main_#t~ret8_3| v_main_~n_stones1~0_4) (<= 0 (+ |v_main_#t~ret8_3| 2147483648))) InVars {main_#t~ret8=|v_main_#t~ret8_3|} OutVars{main_~n_stones1~0=v_main_~n_stones1~0_4} AuxVars[] AssignedVars[main_#t~ret8, main_~n_stones1~0] {1334#(<= 1 main_~m~0)} is VALID [2022-04-07 17:51:15,248 INFO L272 TraceCheckUtils]: 19: Hoare triple {1334#(<= 1 main_~m~0)} [134] L105-->student_versionENTRY: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {1311#true} is VALID [2022-04-07 17:51:15,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {1311#true} [142] student_versionENTRY-->L65-2: Formula: (and (= v_student_version_~b~1_3 0) (= v_student_version_~m_3 |v_student_version_#in~m_1|) (= v_student_version_~a_3 |v_student_version_#in~a_1|) (= v_student_version_~n_2 |v_student_version_#in~n_1|) (= v_student_version_~j~1_3 0) (= v_student_version_~l~1_4 0) (= v_student_version_~i~1_4 0)) InVars {student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_#in~a=|v_student_version_#in~a_1|} OutVars{student_version_~i~1=v_student_version_~i~1_4, student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_~a=v_student_version_~a_3, student_version_~j~1=v_student_version_~j~1_3, student_version_~l~1=v_student_version_~l~1_4, student_version_~b~1=v_student_version_~b~1_3, student_version_~n=v_student_version_~n_2, student_version_#in~a=|v_student_version_#in~a_1|, student_version_~m=v_student_version_~m_3} AuxVars[] AssignedVars[student_version_~i~1, student_version_~a, student_version_~j~1, student_version_~l~1, student_version_~b~1, student_version_~n, student_version_~m] {1377#(and (<= student_version_~l~1 0) (<= |student_version_#in~m| student_version_~m))} is VALID [2022-04-07 17:51:15,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {1377#(and (<= student_version_~l~1 0) (<= |student_version_#in~m| student_version_~m))} [151] L65-2-->L65-2: Formula: (or (and (<= v_student_version_~n_1 v_student_version_~b~1_2) (= v_student_version_~b~1_2 v_student_version_~b~1_1) (= v_student_version_~i~1_2 v_student_version_~i~1_1)) (and (< v_student_version_~i~1_2 v_student_version_~i~1_1) (= (+ v_student_version_~b~1_2 (* (+ v_student_version_~i~1_1 (* (- 1) v_student_version_~i~1_2)) v_student_version_~a_1)) v_student_version_~b~1_1) (< v_student_version_~b~1_2 v_student_version_~n_1) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 v_student_version_~i~1_2 1) v_student_version_~i~1_1)) (< (+ v_student_version_~b~1_2 (* v_student_version_~a_1 v_it_3)) v_student_version_~n_1))))) InVars {student_version_~i~1=v_student_version_~i~1_2, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_2, student_version_~n=v_student_version_~n_1} OutVars{student_version_~i~1=v_student_version_~i~1_1, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_1, student_version_~n=v_student_version_~n_1} AuxVars[] AssignedVars[student_version_~i~1, student_version_~b~1] {1377#(and (<= student_version_~l~1 0) (<= |student_version_#in~m| student_version_~m))} is VALID [2022-04-07 17:51:15,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {1377#(and (<= student_version_~l~1 0) (<= |student_version_#in~m| student_version_~m))} [150] L65-2-->L71-1: Formula: (not (< v_student_version_~b~1_4 v_student_version_~n_3)) InVars {student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} OutVars{student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} AuxVars[] AssignedVars[] {1377#(and (<= student_version_~l~1 0) (<= |student_version_#in~m| student_version_~m))} is VALID [2022-04-07 17:51:15,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {1377#(and (<= student_version_~l~1 0) (<= |student_version_#in~m| student_version_~m))} [154] L71-1-->L71-2: Formula: (not (< v_student_version_~l~1_1 v_student_version_~m_1)) InVars {student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} OutVars{student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} AuxVars[] AssignedVars[] {1387#(<= |student_version_#in~m| 0)} is VALID [2022-04-07 17:51:15,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {1387#(<= |student_version_#in~m| 0)} [159] L71-2-->L79-2: Formula: (and (= v_student_version_~y~1_1 0) (= v_student_version_~x~1_1 0)) InVars {} OutVars{student_version_~x~1=v_student_version_~x~1_1, student_version_~y~1=v_student_version_~y~1_1} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {1387#(<= |student_version_#in~m| 0)} is VALID [2022-04-07 17:51:15,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {1387#(<= |student_version_#in~m| 0)} [163] L79-2-->L79-2: Formula: (or (and (= (+ v_student_version_~y~1_2 (* v_student_version_~j~1_4 v_student_version_~x~1_4)) (+ v_student_version_~y~1_3 (* v_student_version_~j~1_4 v_student_version_~x~1_3))) (< v_student_version_~x~1_4 v_student_version_~x~1_3) (< v_student_version_~x~1_3 (+ v_student_version_~i~1_5 1))) (and (= v_student_version_~y~1_3 v_student_version_~y~1_2) (not (< v_student_version_~x~1_4 v_student_version_~i~1_5)) (= v_student_version_~x~1_4 v_student_version_~x~1_3))) InVars {student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_3, student_version_~x~1=v_student_version_~x~1_4, student_version_~j~1=v_student_version_~j~1_4} OutVars{student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_2, student_version_~x~1=v_student_version_~x~1_3, student_version_~j~1=v_student_version_~j~1_4} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {1387#(<= |student_version_#in~m| 0)} is VALID [2022-04-07 17:51:15,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {1387#(<= |student_version_#in~m| 0)} [162] L79-2-->L79-3: Formula: (not (< v_student_version_~x~1_2 v_student_version_~i~1_3)) InVars {student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} OutVars{student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} AuxVars[] AssignedVars[] {1387#(<= |student_version_#in~m| 0)} is VALID [2022-04-07 17:51:15,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {1387#(<= |student_version_#in~m| 0)} [165] L79-3-->student_versionFINAL: Formula: (= v_student_version_~y~1_4 |v_student_version_#res_1|) InVars {student_version_~y~1=v_student_version_~y~1_4} OutVars{student_version_#res=|v_student_version_#res_1|, student_version_~y~1=v_student_version_~y~1_4} AuxVars[] AssignedVars[student_version_#res] {1387#(<= |student_version_#in~m| 0)} is VALID [2022-04-07 17:51:15,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {1387#(<= |student_version_#in~m| 0)} [166] student_versionFINAL-->student_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1387#(<= |student_version_#in~m| 0)} is VALID [2022-04-07 17:51:15,254 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1387#(<= |student_version_#in~m| 0)} {1334#(<= 1 main_~m~0)} [171] student_versionEXIT-->L105-1: AOR: Formula: (= |v_main_#t~ret9_4| |v_student_version_#resOutParam_1|) InVars {student_version_#res=|v_student_version_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_4|} AuxVars[] AssignedVars[student_version_#res, main_#t~ret9] LVA: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {1312#false} is VALID [2022-04-07 17:51:15,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {1312#false} [141] L105-1-->L97-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647) (= |v_main_#t~ret9_2| v_main_~n_stones2~0_1)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_~n_stones2~0=v_main_~n_stones2~0_1} AuxVars[] AssignedVars[main_~n_stones2~0, main_#t~ret9] {1312#false} is VALID [2022-04-07 17:51:15,254 INFO L272 TraceCheckUtils]: 31: Hoare triple {1312#false} [129] L97-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n_stones1~0_5 v_main_~n_stones2~0_4) 1 0)) InVars {main_~n_stones2~0=v_main_~n_stones2~0_4, main_~n_stones1~0=v_main_~n_stones1~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n_stones2~0, main_~n_stones1~0] {1312#false} is VALID [2022-04-07 17:51:15,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {1312#false} [133] __VERIFIER_assertENTRY-->L6: 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] {1312#false} is VALID [2022-04-07 17:51:15,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {1312#false} [139] L6-->L7: 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[] {1312#false} is VALID [2022-04-07 17:51:15,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {1312#false} [146] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1312#false} is VALID [2022-04-07 17:51:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 17:51:15,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 17:51:15,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:51:15,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928872670] [2022-04-07 17:51:15,255 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 17:51:15,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646841626] [2022-04-07 17:51:15,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646841626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:51:15,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:51:15,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 17:51:15,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685553612] [2022-04-07 17:51:15,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:51:15,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-04-07 17:51:15,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:51:15,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:15,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:15,286 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 17:51:15,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:51:15,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 17:51:15,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 17:51:15,287 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:15,400 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-07 17:51:15,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 17:51:15,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-04-07 17:51:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:51:15,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-07 17:51:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-07 17:51:15,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-07 17:51:15,448 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-07 17:51:15,449 INFO L225 Difference]: With dead ends: 55 [2022-04-07 17:51:15,449 INFO L226 Difference]: Without dead ends: 46 [2022-04-07 17:51:15,450 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 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-07 17:51:15,450 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:51:15,451 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 125 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-07 17:51:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-07 17:51:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-07 17:51:15,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:51:15,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:15,455 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:15,455 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:15,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:15,457 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-07 17:51:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-07 17:51:15,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:15,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:15,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 46 states. [2022-04-07 17:51:15,457 INFO L87 Difference]: Start difference. First operand has 46 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 46 states. [2022-04-07 17:51:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:15,459 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-07 17:51:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-07 17:51:15,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:15,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:15,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:51:15,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:51:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:51:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-04-07 17:51:15,461 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 35 [2022-04-07 17:51:15,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:51:15,462 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-04-07 17:51:15,462 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:15,462 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-07 17:51:15,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-07 17:51:15,463 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:51:15,463 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-04-07 17:51:15,488 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-07 17:51:15,686 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:15,686 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:51:15,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:51:15,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1173604042, now seen corresponding path program 1 times [2022-04-07 17:51:15,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:51:15,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342048754] [2022-04-07 17:51:15,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:15,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:51:15,713 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 17:51:15,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [213719948] [2022-04-07 17:51:15,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:15,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:15,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:51:15,715 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-07 17:51:15,723 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-07 17:51:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:15,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-07 17:51:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:15,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:51:31,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {1615#true} [120] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1615#true} is VALID [2022-04-07 17:51:31,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {1615#true} [122] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1615#true} is VALID [2022-04-07 17:51:31,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {1615#true} [125] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1615#true} is VALID [2022-04-07 17:51:31,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1615#true} {1615#true} [167] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1615#true} is VALID [2022-04-07 17:51:31,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {1615#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1615#true} is VALID [2022-04-07 17:51:31,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {1615#true} [124] mainENTRY-->L97: Formula: (and (= v_main_~n_stones2~0_3 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~n_stones1~0_2 v_main_~n_stones2~0_3) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~m~0_2 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~n~0=v_main_~n~0_2, main_~m~0=v_main_~m~0_2, main_~n_stones2~0=v_main_~n_stones2~0_3, main_~n_stones1~0=v_main_~n_stones1~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~m~0, main_~n~0, main_~n_stones2~0, main_~n_stones1~0, main_~a~0] {1615#true} is VALID [2022-04-07 17:51:31,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {1615#true} [126] L97-->L104: Formula: (and (<= 1 v_main_~m~0_3) (<= 1 v_main_~n~0_3) (<= v_main_~a~0_3 109) (<= v_main_~m~0_3 109) (<= 1 v_main_~a~0_3) (<= v_main_~n~0_3 109)) InVars {main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1638#(<= 1 main_~n~0)} is VALID [2022-04-07 17:51:31,048 INFO L272 TraceCheckUtils]: 7: Hoare triple {1638#(<= 1 main_~n~0)} [128] L104-->correct_versionENTRY: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {1615#true} is VALID [2022-04-07 17:51:31,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {1615#true} [131] correct_versionENTRY-->L38-2: Formula: (and (= |v_correct_version_#in~m_1| v_correct_version_~m_1) (= |v_correct_version_#in~a_1| v_correct_version_~a_1) (= v_correct_version_~i~0_2 0) (= v_correct_version_~l~0_1 0) (= |v_correct_version_#in~n_1| v_correct_version_~n_1) (= v_correct_version_~b~0_1 0) (= v_correct_version_~j~0_1 0)) InVars {correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_#in~n=|v_correct_version_#in~n_1|} OutVars{correct_version_~n=v_correct_version_~n_1, correct_version_~m=v_correct_version_~m_1, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_~b~0=v_correct_version_~b~0_1, correct_version_#in~n=|v_correct_version_#in~n_1|, correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_~i~0=v_correct_version_~i~0_2, correct_version_~l~0=v_correct_version_~l~0_1, correct_version_~a=v_correct_version_~a_1, correct_version_~j~0=v_correct_version_~j~0_1} AuxVars[] AssignedVars[correct_version_~n, correct_version_~m, correct_version_~b~0, correct_version_~i~0, correct_version_~l~0, correct_version_~a, correct_version_~j~0] {1645#(and (<= correct_version_~b~0 0) (<= |correct_version_#in~n| correct_version_~n) (<= 0 correct_version_~i~0))} is VALID [2022-04-07 17:51:31,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {1645#(and (<= correct_version_~b~0 0) (<= |correct_version_#in~n| correct_version_~n) (<= 0 correct_version_~i~0))} [137] L38-2-->L38-2: Formula: (or (and (= v_correct_version_~i~0_5 v_correct_version_~i~0_4) (= v_correct_version_~b~0_3 v_correct_version_~b~0_4) (<= v_correct_version_~n_3 v_correct_version_~b~0_4)) (and (= (+ (* v_correct_version_~a_2 (+ (* (- 1) v_correct_version_~i~0_5) v_correct_version_~i~0_4)) v_correct_version_~b~0_4) v_correct_version_~b~0_3) (< v_correct_version_~i~0_5 v_correct_version_~i~0_4) (forall ((v_it_1 Int)) (or (< (+ v_correct_version_~b~0_4 (* v_it_1 v_correct_version_~a_2)) v_correct_version_~n_3) (not (<= 1 v_it_1)) (not (<= (+ v_it_1 v_correct_version_~i~0_5 1) v_correct_version_~i~0_4)))) (< v_correct_version_~b~0_4 v_correct_version_~n_3))) InVars {correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_5, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_4} OutVars{correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_4, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_3} AuxVars[] AssignedVars[correct_version_~b~0, correct_version_~i~0] {1649#(exists ((v_correct_version_~i~0_10 Int) (v_correct_version_~b~0_8 Int) (correct_version_~n Int)) (and (<= |correct_version_#in~n| correct_version_~n) (or (and (< v_correct_version_~b~0_8 correct_version_~n) (exists ((correct_version_~a Int)) (forall ((v_it_1 Int)) (or (< (+ (* v_it_1 correct_version_~a) v_correct_version_~b~0_8) correct_version_~n) (not (<= (+ v_it_1 v_correct_version_~i~0_10 1) correct_version_~i~0)) (not (<= 1 v_it_1))))) (< v_correct_version_~i~0_10 correct_version_~i~0)) (and (<= correct_version_~n v_correct_version_~b~0_8) (= correct_version_~i~0 v_correct_version_~i~0_10))) (<= 0 v_correct_version_~i~0_10) (<= v_correct_version_~b~0_8 0)))} is VALID [2022-04-07 17:51:31,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {1649#(exists ((v_correct_version_~i~0_10 Int) (v_correct_version_~b~0_8 Int) (correct_version_~n Int)) (and (<= |correct_version_#in~n| correct_version_~n) (or (and (< v_correct_version_~b~0_8 correct_version_~n) (exists ((correct_version_~a Int)) (forall ((v_it_1 Int)) (or (< (+ (* v_it_1 correct_version_~a) v_correct_version_~b~0_8) correct_version_~n) (not (<= (+ v_it_1 v_correct_version_~i~0_10 1) correct_version_~i~0)) (not (<= 1 v_it_1))))) (< v_correct_version_~i~0_10 correct_version_~i~0)) (and (<= correct_version_~n v_correct_version_~b~0_8) (= correct_version_~i~0 v_correct_version_~i~0_10))) (<= 0 v_correct_version_~i~0_10) (<= v_correct_version_~b~0_8 0)))} [136] L38-2-->L44-1: Formula: (not (< v_correct_version_~b~0_2 v_correct_version_~n_2)) InVars {correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} OutVars{correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} AuxVars[] AssignedVars[] {1649#(exists ((v_correct_version_~i~0_10 Int) (v_correct_version_~b~0_8 Int) (correct_version_~n Int)) (and (<= |correct_version_#in~n| correct_version_~n) (or (and (< v_correct_version_~b~0_8 correct_version_~n) (exists ((correct_version_~a Int)) (forall ((v_it_1 Int)) (or (< (+ (* v_it_1 correct_version_~a) v_correct_version_~b~0_8) correct_version_~n) (not (<= (+ v_it_1 v_correct_version_~i~0_10 1) correct_version_~i~0)) (not (<= 1 v_it_1))))) (< v_correct_version_~i~0_10 correct_version_~i~0)) (and (<= correct_version_~n v_correct_version_~b~0_8) (= correct_version_~i~0 v_correct_version_~i~0_10))) (<= 0 v_correct_version_~i~0_10) (<= v_correct_version_~b~0_8 0)))} is VALID [2022-04-07 17:51:31,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {1649#(exists ((v_correct_version_~i~0_10 Int) (v_correct_version_~b~0_8 Int) (correct_version_~n Int)) (and (<= |correct_version_#in~n| correct_version_~n) (or (and (< v_correct_version_~b~0_8 correct_version_~n) (exists ((correct_version_~a Int)) (forall ((v_it_1 Int)) (or (< (+ (* v_it_1 correct_version_~a) v_correct_version_~b~0_8) correct_version_~n) (not (<= (+ v_it_1 v_correct_version_~i~0_10 1) correct_version_~i~0)) (not (<= 1 v_it_1))))) (< v_correct_version_~i~0_10 correct_version_~i~0)) (and (<= correct_version_~n v_correct_version_~b~0_8) (= correct_version_~i~0 v_correct_version_~i~0_10))) (<= 0 v_correct_version_~i~0_10) (<= v_correct_version_~b~0_8 0)))} [145] L44-1-->L44-1: Formula: (or (and (<= v_correct_version_~m_3 v_correct_version_~l~0_4) (= v_correct_version_~l~0_4 v_correct_version_~l~0_3) (= v_correct_version_~j~0_4 v_correct_version_~j~0_3)) (and (= (+ (* (+ (* (- 1) v_correct_version_~j~0_4) v_correct_version_~j~0_3) v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~l~0_3) (< v_correct_version_~j~0_4 v_correct_version_~j~0_3) (< v_correct_version_~l~0_4 v_correct_version_~m_3) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 v_correct_version_~j~0_4 1) v_correct_version_~j~0_3)) (< (+ (* v_it_2 v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~m_3))))) InVars {correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_4, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_4} OutVars{correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_3, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_3} AuxVars[] AssignedVars[correct_version_~l~0, correct_version_~j~0] {1649#(exists ((v_correct_version_~i~0_10 Int) (v_correct_version_~b~0_8 Int) (correct_version_~n Int)) (and (<= |correct_version_#in~n| correct_version_~n) (or (and (< v_correct_version_~b~0_8 correct_version_~n) (exists ((correct_version_~a Int)) (forall ((v_it_1 Int)) (or (< (+ (* v_it_1 correct_version_~a) v_correct_version_~b~0_8) correct_version_~n) (not (<= (+ v_it_1 v_correct_version_~i~0_10 1) correct_version_~i~0)) (not (<= 1 v_it_1))))) (< v_correct_version_~i~0_10 correct_version_~i~0)) (and (<= correct_version_~n v_correct_version_~b~0_8) (= correct_version_~i~0 v_correct_version_~i~0_10))) (<= 0 v_correct_version_~i~0_10) (<= v_correct_version_~b~0_8 0)))} is VALID [2022-04-07 17:51:31,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {1649#(exists ((v_correct_version_~i~0_10 Int) (v_correct_version_~b~0_8 Int) (correct_version_~n Int)) (and (<= |correct_version_#in~n| correct_version_~n) (or (and (< v_correct_version_~b~0_8 correct_version_~n) (exists ((correct_version_~a Int)) (forall ((v_it_1 Int)) (or (< (+ (* v_it_1 correct_version_~a) v_correct_version_~b~0_8) correct_version_~n) (not (<= (+ v_it_1 v_correct_version_~i~0_10 1) correct_version_~i~0)) (not (<= 1 v_it_1))))) (< v_correct_version_~i~0_10 correct_version_~i~0)) (and (<= correct_version_~n v_correct_version_~b~0_8) (= correct_version_~i~0 v_correct_version_~i~0_10))) (<= 0 v_correct_version_~i~0_10) (<= v_correct_version_~b~0_8 0)))} [144] L44-1-->L44-2: Formula: (not (< v_correct_version_~l~0_2 v_correct_version_~m_2)) InVars {correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} OutVars{correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} AuxVars[] AssignedVars[] {1649#(exists ((v_correct_version_~i~0_10 Int) (v_correct_version_~b~0_8 Int) (correct_version_~n Int)) (and (<= |correct_version_#in~n| correct_version_~n) (or (and (< v_correct_version_~b~0_8 correct_version_~n) (exists ((correct_version_~a Int)) (forall ((v_it_1 Int)) (or (< (+ (* v_it_1 correct_version_~a) v_correct_version_~b~0_8) correct_version_~n) (not (<= (+ v_it_1 v_correct_version_~i~0_10 1) correct_version_~i~0)) (not (<= 1 v_it_1))))) (< v_correct_version_~i~0_10 correct_version_~i~0)) (and (<= correct_version_~n v_correct_version_~b~0_8) (= correct_version_~i~0 v_correct_version_~i~0_10))) (<= 0 v_correct_version_~i~0_10) (<= v_correct_version_~b~0_8 0)))} is VALID [2022-04-07 17:51:31,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {1649#(exists ((v_correct_version_~i~0_10 Int) (v_correct_version_~b~0_8 Int) (correct_version_~n Int)) (and (<= |correct_version_#in~n| correct_version_~n) (or (and (< v_correct_version_~b~0_8 correct_version_~n) (exists ((correct_version_~a Int)) (forall ((v_it_1 Int)) (or (< (+ (* v_it_1 correct_version_~a) v_correct_version_~b~0_8) correct_version_~n) (not (<= (+ v_it_1 v_correct_version_~i~0_10 1) correct_version_~i~0)) (not (<= 1 v_it_1))))) (< v_correct_version_~i~0_10 correct_version_~i~0)) (and (<= correct_version_~n v_correct_version_~b~0_8) (= correct_version_~i~0 v_correct_version_~i~0_10))) (<= 0 v_correct_version_~i~0_10) (<= v_correct_version_~b~0_8 0)))} [152] L44-2-->L52-2: Formula: (and (= v_correct_version_~x~0_4 0) (= v_correct_version_~y~0_4 0)) InVars {} OutVars{correct_version_~y~0=v_correct_version_~y~0_4, correct_version_~x~0=v_correct_version_~x~0_4} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] {1662#(and (exists ((v_correct_version_~i~0_10 Int) (v_correct_version_~b~0_8 Int) (correct_version_~n Int)) (and (<= |correct_version_#in~n| correct_version_~n) (or (and (< v_correct_version_~b~0_8 correct_version_~n) (exists ((correct_version_~a Int)) (forall ((v_it_1 Int)) (or (< (+ (* v_it_1 correct_version_~a) v_correct_version_~b~0_8) correct_version_~n) (not (<= (+ v_it_1 v_correct_version_~i~0_10 1) correct_version_~i~0)) (not (<= 1 v_it_1))))) (< v_correct_version_~i~0_10 correct_version_~i~0)) (and (<= correct_version_~n v_correct_version_~b~0_8) (= correct_version_~i~0 v_correct_version_~i~0_10))) (<= 0 v_correct_version_~i~0_10) (<= v_correct_version_~b~0_8 0))) (<= correct_version_~x~0 0))} is VALID [2022-04-07 17:51:31,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {1662#(and (exists ((v_correct_version_~i~0_10 Int) (v_correct_version_~b~0_8 Int) (correct_version_~n Int)) (and (<= |correct_version_#in~n| correct_version_~n) (or (and (< v_correct_version_~b~0_8 correct_version_~n) (exists ((correct_version_~a Int)) (forall ((v_it_1 Int)) (or (< (+ (* v_it_1 correct_version_~a) v_correct_version_~b~0_8) correct_version_~n) (not (<= (+ v_it_1 v_correct_version_~i~0_10 1) correct_version_~i~0)) (not (<= 1 v_it_1))))) (< v_correct_version_~i~0_10 correct_version_~i~0)) (and (<= correct_version_~n v_correct_version_~b~0_8) (= correct_version_~i~0 v_correct_version_~i~0_10))) (<= 0 v_correct_version_~i~0_10) (<= v_correct_version_~b~0_8 0))) (<= correct_version_~x~0 0))} [157] L52-2-->L52-3: Formula: (not (< v_correct_version_~x~0_1 v_correct_version_~i~0_1)) InVars {correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} OutVars{correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} AuxVars[] AssignedVars[] {1666#(<= |correct_version_#in~n| 0)} is VALID [2022-04-07 17:51:31,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {1666#(<= |correct_version_#in~n| 0)} [160] L52-3-->correct_versionFINAL: Formula: (= |v_correct_version_#res_1| v_correct_version_~y~0_3) InVars {correct_version_~y~0=v_correct_version_~y~0_3} OutVars{correct_version_#res=|v_correct_version_#res_1|, correct_version_~y~0=v_correct_version_~y~0_3} AuxVars[] AssignedVars[correct_version_#res] {1666#(<= |correct_version_#in~n| 0)} is VALID [2022-04-07 17:51:31,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {1666#(<= |correct_version_#in~n| 0)} [164] correct_versionFINAL-->correct_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1666#(<= |correct_version_#in~n| 0)} is VALID [2022-04-07 17:51:31,131 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1666#(<= |correct_version_#in~n| 0)} {1638#(<= 1 main_~n~0)} [170] correct_versionEXIT-->L104-1: AOR: Formula: (= |v_main_#t~ret8_4| |v_correct_version_#resOutParam_1|) InVars {correct_version_#res=|v_correct_version_#resOutParam_1|} OutVars{main_#t~ret8=|v_main_#t~ret8_4|} AuxVars[] AssignedVars[main_#t~ret8, correct_version_#res] LVA: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {1616#false} is VALID [2022-04-07 17:51:31,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {1616#false} [130] L104-1-->L105: Formula: (and (<= |v_main_#t~ret8_3| 2147483647) (= |v_main_#t~ret8_3| v_main_~n_stones1~0_4) (<= 0 (+ |v_main_#t~ret8_3| 2147483648))) InVars {main_#t~ret8=|v_main_#t~ret8_3|} OutVars{main_~n_stones1~0=v_main_~n_stones1~0_4} AuxVars[] AssignedVars[main_#t~ret8, main_~n_stones1~0] {1616#false} is VALID [2022-04-07 17:51:31,131 INFO L272 TraceCheckUtils]: 19: Hoare triple {1616#false} [134] L105-->student_versionENTRY: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {1616#false} is VALID [2022-04-07 17:51:31,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {1616#false} [142] student_versionENTRY-->L65-2: Formula: (and (= v_student_version_~b~1_3 0) (= v_student_version_~m_3 |v_student_version_#in~m_1|) (= v_student_version_~a_3 |v_student_version_#in~a_1|) (= v_student_version_~n_2 |v_student_version_#in~n_1|) (= v_student_version_~j~1_3 0) (= v_student_version_~l~1_4 0) (= v_student_version_~i~1_4 0)) InVars {student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_#in~a=|v_student_version_#in~a_1|} OutVars{student_version_~i~1=v_student_version_~i~1_4, student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_~a=v_student_version_~a_3, student_version_~j~1=v_student_version_~j~1_3, student_version_~l~1=v_student_version_~l~1_4, student_version_~b~1=v_student_version_~b~1_3, student_version_~n=v_student_version_~n_2, student_version_#in~a=|v_student_version_#in~a_1|, student_version_~m=v_student_version_~m_3} AuxVars[] AssignedVars[student_version_~i~1, student_version_~a, student_version_~j~1, student_version_~l~1, student_version_~b~1, student_version_~n, student_version_~m] {1616#false} is VALID [2022-04-07 17:51:31,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {1616#false} [151] L65-2-->L65-2: Formula: (or (and (<= v_student_version_~n_1 v_student_version_~b~1_2) (= v_student_version_~b~1_2 v_student_version_~b~1_1) (= v_student_version_~i~1_2 v_student_version_~i~1_1)) (and (< v_student_version_~i~1_2 v_student_version_~i~1_1) (= (+ v_student_version_~b~1_2 (* (+ v_student_version_~i~1_1 (* (- 1) v_student_version_~i~1_2)) v_student_version_~a_1)) v_student_version_~b~1_1) (< v_student_version_~b~1_2 v_student_version_~n_1) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 v_student_version_~i~1_2 1) v_student_version_~i~1_1)) (< (+ v_student_version_~b~1_2 (* v_student_version_~a_1 v_it_3)) v_student_version_~n_1))))) InVars {student_version_~i~1=v_student_version_~i~1_2, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_2, student_version_~n=v_student_version_~n_1} OutVars{student_version_~i~1=v_student_version_~i~1_1, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_1, student_version_~n=v_student_version_~n_1} AuxVars[] AssignedVars[student_version_~i~1, student_version_~b~1] {1616#false} is VALID [2022-04-07 17:51:31,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {1616#false} [150] L65-2-->L71-1: Formula: (not (< v_student_version_~b~1_4 v_student_version_~n_3)) InVars {student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} OutVars{student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} AuxVars[] AssignedVars[] {1616#false} is VALID [2022-04-07 17:51:31,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {1616#false} [155] L71-1-->L71-1: Formula: (or (and (= v_student_version_~l~1_3 v_student_version_~l~1_2) (<= v_student_version_~m_2 v_student_version_~l~1_3) (= v_student_version_~j~1_2 v_student_version_~j~1_1)) (and (= (+ v_student_version_~l~1_3 (* (+ v_student_version_~j~1_1 (* (- 1) v_student_version_~j~1_2)) v_student_version_~a_2)) v_student_version_~l~1_2) (< v_student_version_~j~1_2 v_student_version_~j~1_1) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 v_student_version_~j~1_2 1) v_student_version_~j~1_1)) (not (<= 1 v_it_4)) (< (+ (* v_student_version_~a_2 v_it_4) v_student_version_~l~1_3) v_student_version_~m_2))) (< v_student_version_~l~1_3 v_student_version_~m_2))) InVars {student_version_~l~1=v_student_version_~l~1_3, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_2, student_version_~m=v_student_version_~m_2} OutVars{student_version_~l~1=v_student_version_~l~1_2, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_1, student_version_~m=v_student_version_~m_2} AuxVars[] AssignedVars[student_version_~j~1, student_version_~l~1] {1616#false} is VALID [2022-04-07 17:51:31,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {1616#false} [154] L71-1-->L71-2: Formula: (not (< v_student_version_~l~1_1 v_student_version_~m_1)) InVars {student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} OutVars{student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} AuxVars[] AssignedVars[] {1616#false} is VALID [2022-04-07 17:51:31,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {1616#false} [159] L71-2-->L79-2: Formula: (and (= v_student_version_~y~1_1 0) (= v_student_version_~x~1_1 0)) InVars {} OutVars{student_version_~x~1=v_student_version_~x~1_1, student_version_~y~1=v_student_version_~y~1_1} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {1616#false} is VALID [2022-04-07 17:51:31,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {1616#false} [163] L79-2-->L79-2: Formula: (or (and (= (+ v_student_version_~y~1_2 (* v_student_version_~j~1_4 v_student_version_~x~1_4)) (+ v_student_version_~y~1_3 (* v_student_version_~j~1_4 v_student_version_~x~1_3))) (< v_student_version_~x~1_4 v_student_version_~x~1_3) (< v_student_version_~x~1_3 (+ v_student_version_~i~1_5 1))) (and (= v_student_version_~y~1_3 v_student_version_~y~1_2) (not (< v_student_version_~x~1_4 v_student_version_~i~1_5)) (= v_student_version_~x~1_4 v_student_version_~x~1_3))) InVars {student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_3, student_version_~x~1=v_student_version_~x~1_4, student_version_~j~1=v_student_version_~j~1_4} OutVars{student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_2, student_version_~x~1=v_student_version_~x~1_3, student_version_~j~1=v_student_version_~j~1_4} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {1616#false} is VALID [2022-04-07 17:51:31,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {1616#false} [162] L79-2-->L79-3: Formula: (not (< v_student_version_~x~1_2 v_student_version_~i~1_3)) InVars {student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} OutVars{student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} AuxVars[] AssignedVars[] {1616#false} is VALID [2022-04-07 17:51:31,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {1616#false} [165] L79-3-->student_versionFINAL: Formula: (= v_student_version_~y~1_4 |v_student_version_#res_1|) InVars {student_version_~y~1=v_student_version_~y~1_4} OutVars{student_version_#res=|v_student_version_#res_1|, student_version_~y~1=v_student_version_~y~1_4} AuxVars[] AssignedVars[student_version_#res] {1616#false} is VALID [2022-04-07 17:51:31,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {1616#false} [166] student_versionFINAL-->student_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1616#false} is VALID [2022-04-07 17:51:31,133 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1616#false} {1616#false} [171] student_versionEXIT-->L105-1: AOR: Formula: (= |v_main_#t~ret9_4| |v_student_version_#resOutParam_1|) InVars {student_version_#res=|v_student_version_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_4|} AuxVars[] AssignedVars[student_version_#res, main_#t~ret9] LVA: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {1616#false} is VALID [2022-04-07 17:51:31,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {1616#false} [141] L105-1-->L97-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647) (= |v_main_#t~ret9_2| v_main_~n_stones2~0_1)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_~n_stones2~0=v_main_~n_stones2~0_1} AuxVars[] AssignedVars[main_~n_stones2~0, main_#t~ret9] {1616#false} is VALID [2022-04-07 17:51:31,133 INFO L272 TraceCheckUtils]: 32: Hoare triple {1616#false} [129] L97-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n_stones1~0_5 v_main_~n_stones2~0_4) 1 0)) InVars {main_~n_stones2~0=v_main_~n_stones2~0_4, main_~n_stones1~0=v_main_~n_stones1~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n_stones2~0, main_~n_stones1~0] {1616#false} is VALID [2022-04-07 17:51:31,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {1616#false} [133] __VERIFIER_assertENTRY-->L6: 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] {1616#false} is VALID [2022-04-07 17:51:31,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {1616#false} [139] L6-->L7: 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[] {1616#false} is VALID [2022-04-07 17:51:31,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {1616#false} [146] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1616#false} is VALID [2022-04-07 17:51:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 17:51:31,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:51:32,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {1616#false} [146] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1616#false} is VALID [2022-04-07 17:51:32,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {1616#false} [139] L6-->L7: 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[] {1616#false} is VALID [2022-04-07 17:51:32,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {1616#false} [133] __VERIFIER_assertENTRY-->L6: 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] {1616#false} is VALID [2022-04-07 17:51:32,418 INFO L272 TraceCheckUtils]: 32: Hoare triple {1616#false} [129] L97-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n_stones1~0_5 v_main_~n_stones2~0_4) 1 0)) InVars {main_~n_stones2~0=v_main_~n_stones2~0_4, main_~n_stones1~0=v_main_~n_stones1~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n_stones2~0, main_~n_stones1~0] {1616#false} is VALID [2022-04-07 17:51:32,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {1616#false} [141] L105-1-->L97-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647) (= |v_main_#t~ret9_2| v_main_~n_stones2~0_1)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_~n_stones2~0=v_main_~n_stones2~0_1} AuxVars[] AssignedVars[main_~n_stones2~0, main_#t~ret9] {1616#false} is VALID [2022-04-07 17:51:32,418 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1615#true} {1616#false} [171] student_versionEXIT-->L105-1: AOR: Formula: (= |v_main_#t~ret9_4| |v_student_version_#resOutParam_1|) InVars {student_version_#res=|v_student_version_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_4|} AuxVars[] AssignedVars[student_version_#res, main_#t~ret9] LVA: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {1616#false} is VALID [2022-04-07 17:51:32,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {1615#true} [166] student_versionFINAL-->student_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1615#true} is VALID [2022-04-07 17:51:32,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {1615#true} [165] L79-3-->student_versionFINAL: Formula: (= v_student_version_~y~1_4 |v_student_version_#res_1|) InVars {student_version_~y~1=v_student_version_~y~1_4} OutVars{student_version_#res=|v_student_version_#res_1|, student_version_~y~1=v_student_version_~y~1_4} AuxVars[] AssignedVars[student_version_#res] {1615#true} is VALID [2022-04-07 17:51:32,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {1615#true} [162] L79-2-->L79-3: Formula: (not (< v_student_version_~x~1_2 v_student_version_~i~1_3)) InVars {student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} OutVars{student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} AuxVars[] AssignedVars[] {1615#true} is VALID [2022-04-07 17:51:32,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {1615#true} [163] L79-2-->L79-2: Formula: (or (and (= (+ v_student_version_~y~1_2 (* v_student_version_~j~1_4 v_student_version_~x~1_4)) (+ v_student_version_~y~1_3 (* v_student_version_~j~1_4 v_student_version_~x~1_3))) (< v_student_version_~x~1_4 v_student_version_~x~1_3) (< v_student_version_~x~1_3 (+ v_student_version_~i~1_5 1))) (and (= v_student_version_~y~1_3 v_student_version_~y~1_2) (not (< v_student_version_~x~1_4 v_student_version_~i~1_5)) (= v_student_version_~x~1_4 v_student_version_~x~1_3))) InVars {student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_3, student_version_~x~1=v_student_version_~x~1_4, student_version_~j~1=v_student_version_~j~1_4} OutVars{student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_2, student_version_~x~1=v_student_version_~x~1_3, student_version_~j~1=v_student_version_~j~1_4} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {1615#true} is VALID [2022-04-07 17:51:32,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {1615#true} [159] L71-2-->L79-2: Formula: (and (= v_student_version_~y~1_1 0) (= v_student_version_~x~1_1 0)) InVars {} OutVars{student_version_~x~1=v_student_version_~x~1_1, student_version_~y~1=v_student_version_~y~1_1} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {1615#true} is VALID [2022-04-07 17:51:32,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {1615#true} [154] L71-1-->L71-2: Formula: (not (< v_student_version_~l~1_1 v_student_version_~m_1)) InVars {student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} OutVars{student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} AuxVars[] AssignedVars[] {1615#true} is VALID [2022-04-07 17:51:32,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {1615#true} [155] L71-1-->L71-1: Formula: (or (and (= v_student_version_~l~1_3 v_student_version_~l~1_2) (<= v_student_version_~m_2 v_student_version_~l~1_3) (= v_student_version_~j~1_2 v_student_version_~j~1_1)) (and (= (+ v_student_version_~l~1_3 (* (+ v_student_version_~j~1_1 (* (- 1) v_student_version_~j~1_2)) v_student_version_~a_2)) v_student_version_~l~1_2) (< v_student_version_~j~1_2 v_student_version_~j~1_1) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 v_student_version_~j~1_2 1) v_student_version_~j~1_1)) (not (<= 1 v_it_4)) (< (+ (* v_student_version_~a_2 v_it_4) v_student_version_~l~1_3) v_student_version_~m_2))) (< v_student_version_~l~1_3 v_student_version_~m_2))) InVars {student_version_~l~1=v_student_version_~l~1_3, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_2, student_version_~m=v_student_version_~m_2} OutVars{student_version_~l~1=v_student_version_~l~1_2, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_1, student_version_~m=v_student_version_~m_2} AuxVars[] AssignedVars[student_version_~j~1, student_version_~l~1] {1615#true} is VALID [2022-04-07 17:51:32,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {1615#true} [150] L65-2-->L71-1: Formula: (not (< v_student_version_~b~1_4 v_student_version_~n_3)) InVars {student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} OutVars{student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} AuxVars[] AssignedVars[] {1615#true} is VALID [2022-04-07 17:51:32,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {1615#true} [151] L65-2-->L65-2: Formula: (or (and (<= v_student_version_~n_1 v_student_version_~b~1_2) (= v_student_version_~b~1_2 v_student_version_~b~1_1) (= v_student_version_~i~1_2 v_student_version_~i~1_1)) (and (< v_student_version_~i~1_2 v_student_version_~i~1_1) (= (+ v_student_version_~b~1_2 (* (+ v_student_version_~i~1_1 (* (- 1) v_student_version_~i~1_2)) v_student_version_~a_1)) v_student_version_~b~1_1) (< v_student_version_~b~1_2 v_student_version_~n_1) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 v_student_version_~i~1_2 1) v_student_version_~i~1_1)) (< (+ v_student_version_~b~1_2 (* v_student_version_~a_1 v_it_3)) v_student_version_~n_1))))) InVars {student_version_~i~1=v_student_version_~i~1_2, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_2, student_version_~n=v_student_version_~n_1} OutVars{student_version_~i~1=v_student_version_~i~1_1, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_1, student_version_~n=v_student_version_~n_1} AuxVars[] AssignedVars[student_version_~i~1, student_version_~b~1] {1615#true} is VALID [2022-04-07 17:51:32,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {1615#true} [142] student_versionENTRY-->L65-2: Formula: (and (= v_student_version_~b~1_3 0) (= v_student_version_~m_3 |v_student_version_#in~m_1|) (= v_student_version_~a_3 |v_student_version_#in~a_1|) (= v_student_version_~n_2 |v_student_version_#in~n_1|) (= v_student_version_~j~1_3 0) (= v_student_version_~l~1_4 0) (= v_student_version_~i~1_4 0)) InVars {student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_#in~a=|v_student_version_#in~a_1|} OutVars{student_version_~i~1=v_student_version_~i~1_4, student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_~a=v_student_version_~a_3, student_version_~j~1=v_student_version_~j~1_3, student_version_~l~1=v_student_version_~l~1_4, student_version_~b~1=v_student_version_~b~1_3, student_version_~n=v_student_version_~n_2, student_version_#in~a=|v_student_version_#in~a_1|, student_version_~m=v_student_version_~m_3} AuxVars[] AssignedVars[student_version_~i~1, student_version_~a, student_version_~j~1, student_version_~l~1, student_version_~b~1, student_version_~n, student_version_~m] {1615#true} is VALID [2022-04-07 17:51:32,420 INFO L272 TraceCheckUtils]: 19: Hoare triple {1616#false} [134] L105-->student_versionENTRY: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {1615#true} is VALID [2022-04-07 17:51:32,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {1616#false} [130] L104-1-->L105: Formula: (and (<= |v_main_#t~ret8_3| 2147483647) (= |v_main_#t~ret8_3| v_main_~n_stones1~0_4) (<= 0 (+ |v_main_#t~ret8_3| 2147483648))) InVars {main_#t~ret8=|v_main_#t~ret8_3|} OutVars{main_~n_stones1~0=v_main_~n_stones1~0_4} AuxVars[] AssignedVars[main_#t~ret8, main_~n_stones1~0] {1616#false} is VALID [2022-04-07 17:51:32,421 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1666#(<= |correct_version_#in~n| 0)} {1638#(<= 1 main_~n~0)} [170] correct_versionEXIT-->L104-1: AOR: Formula: (= |v_main_#t~ret8_4| |v_correct_version_#resOutParam_1|) InVars {correct_version_#res=|v_correct_version_#resOutParam_1|} OutVars{main_#t~ret8=|v_main_#t~ret8_4|} AuxVars[] AssignedVars[main_#t~ret8, correct_version_#res] LVA: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {1616#false} is VALID [2022-04-07 17:51:32,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {1666#(<= |correct_version_#in~n| 0)} [164] correct_versionFINAL-->correct_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1666#(<= |correct_version_#in~n| 0)} is VALID [2022-04-07 17:51:32,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {1666#(<= |correct_version_#in~n| 0)} [160] L52-3-->correct_versionFINAL: Formula: (= |v_correct_version_#res_1| v_correct_version_~y~0_3) InVars {correct_version_~y~0=v_correct_version_~y~0_3} OutVars{correct_version_#res=|v_correct_version_#res_1|, correct_version_~y~0=v_correct_version_~y~0_3} AuxVars[] AssignedVars[correct_version_#res] {1666#(<= |correct_version_#in~n| 0)} is VALID [2022-04-07 17:51:32,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {1796#(or (<= |correct_version_#in~n| 0) (< correct_version_~x~0 correct_version_~i~0))} [157] L52-2-->L52-3: Formula: (not (< v_correct_version_~x~0_1 v_correct_version_~i~0_1)) InVars {correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} OutVars{correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} AuxVars[] AssignedVars[] {1666#(<= |correct_version_#in~n| 0)} is VALID [2022-04-07 17:51:32,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {1800#(or (<= |correct_version_#in~n| 0) (< 0 correct_version_~i~0))} [152] L44-2-->L52-2: Formula: (and (= v_correct_version_~x~0_4 0) (= v_correct_version_~y~0_4 0)) InVars {} OutVars{correct_version_~y~0=v_correct_version_~y~0_4, correct_version_~x~0=v_correct_version_~x~0_4} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] {1796#(or (<= |correct_version_#in~n| 0) (< correct_version_~x~0 correct_version_~i~0))} is VALID [2022-04-07 17:51:32,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {1800#(or (<= |correct_version_#in~n| 0) (< 0 correct_version_~i~0))} [144] L44-1-->L44-2: Formula: (not (< v_correct_version_~l~0_2 v_correct_version_~m_2)) InVars {correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} OutVars{correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} AuxVars[] AssignedVars[] {1800#(or (<= |correct_version_#in~n| 0) (< 0 correct_version_~i~0))} is VALID [2022-04-07 17:51:32,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {1800#(or (<= |correct_version_#in~n| 0) (< 0 correct_version_~i~0))} [145] L44-1-->L44-1: Formula: (or (and (<= v_correct_version_~m_3 v_correct_version_~l~0_4) (= v_correct_version_~l~0_4 v_correct_version_~l~0_3) (= v_correct_version_~j~0_4 v_correct_version_~j~0_3)) (and (= (+ (* (+ (* (- 1) v_correct_version_~j~0_4) v_correct_version_~j~0_3) v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~l~0_3) (< v_correct_version_~j~0_4 v_correct_version_~j~0_3) (< v_correct_version_~l~0_4 v_correct_version_~m_3) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 v_correct_version_~j~0_4 1) v_correct_version_~j~0_3)) (< (+ (* v_it_2 v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~m_3))))) InVars {correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_4, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_4} OutVars{correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_3, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_3} AuxVars[] AssignedVars[correct_version_~l~0, correct_version_~j~0] {1800#(or (<= |correct_version_#in~n| 0) (< 0 correct_version_~i~0))} is VALID [2022-04-07 17:51:32,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {1800#(or (<= |correct_version_#in~n| 0) (< 0 correct_version_~i~0))} [136] L38-2-->L44-1: Formula: (not (< v_correct_version_~b~0_2 v_correct_version_~n_2)) InVars {correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} OutVars{correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} AuxVars[] AssignedVars[] {1800#(or (<= |correct_version_#in~n| 0) (< 0 correct_version_~i~0))} is VALID [2022-04-07 17:51:32,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {1813#(or (<= |correct_version_#in~n| 0) (forall ((v_correct_version_~i~0_15 Int)) (or (< 0 v_correct_version_~i~0_15) (and (or (not (< correct_version_~b~0 correct_version_~n)) (not (< correct_version_~i~0 v_correct_version_~i~0_15)) (forall ((correct_version_~a Int)) (exists ((v_it_1 Int)) (and (not (< (+ correct_version_~b~0 (* v_it_1 correct_version_~a)) correct_version_~n)) (<= 1 v_it_1) (<= (+ correct_version_~i~0 v_it_1 1) v_correct_version_~i~0_15))))) (or (not (<= correct_version_~n correct_version_~b~0)) (not (= correct_version_~i~0 v_correct_version_~i~0_15)))))))} [137] L38-2-->L38-2: Formula: (or (and (= v_correct_version_~i~0_5 v_correct_version_~i~0_4) (= v_correct_version_~b~0_3 v_correct_version_~b~0_4) (<= v_correct_version_~n_3 v_correct_version_~b~0_4)) (and (= (+ (* v_correct_version_~a_2 (+ (* (- 1) v_correct_version_~i~0_5) v_correct_version_~i~0_4)) v_correct_version_~b~0_4) v_correct_version_~b~0_3) (< v_correct_version_~i~0_5 v_correct_version_~i~0_4) (forall ((v_it_1 Int)) (or (< (+ v_correct_version_~b~0_4 (* v_it_1 v_correct_version_~a_2)) v_correct_version_~n_3) (not (<= 1 v_it_1)) (not (<= (+ v_it_1 v_correct_version_~i~0_5 1) v_correct_version_~i~0_4)))) (< v_correct_version_~b~0_4 v_correct_version_~n_3))) InVars {correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_5, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_4} OutVars{correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_4, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_3} AuxVars[] AssignedVars[correct_version_~b~0, correct_version_~i~0] {1800#(or (<= |correct_version_#in~n| 0) (< 0 correct_version_~i~0))} is VALID [2022-04-07 17:51:32,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {1615#true} [131] correct_versionENTRY-->L38-2: Formula: (and (= |v_correct_version_#in~m_1| v_correct_version_~m_1) (= |v_correct_version_#in~a_1| v_correct_version_~a_1) (= v_correct_version_~i~0_2 0) (= v_correct_version_~l~0_1 0) (= |v_correct_version_#in~n_1| v_correct_version_~n_1) (= v_correct_version_~b~0_1 0) (= v_correct_version_~j~0_1 0)) InVars {correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_#in~n=|v_correct_version_#in~n_1|} OutVars{correct_version_~n=v_correct_version_~n_1, correct_version_~m=v_correct_version_~m_1, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_~b~0=v_correct_version_~b~0_1, correct_version_#in~n=|v_correct_version_#in~n_1|, correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_~i~0=v_correct_version_~i~0_2, correct_version_~l~0=v_correct_version_~l~0_1, correct_version_~a=v_correct_version_~a_1, correct_version_~j~0=v_correct_version_~j~0_1} AuxVars[] AssignedVars[correct_version_~n, correct_version_~m, correct_version_~b~0, correct_version_~i~0, correct_version_~l~0, correct_version_~a, correct_version_~j~0] {1813#(or (<= |correct_version_#in~n| 0) (forall ((v_correct_version_~i~0_15 Int)) (or (< 0 v_correct_version_~i~0_15) (and (or (not (< correct_version_~b~0 correct_version_~n)) (not (< correct_version_~i~0 v_correct_version_~i~0_15)) (forall ((correct_version_~a Int)) (exists ((v_it_1 Int)) (and (not (< (+ correct_version_~b~0 (* v_it_1 correct_version_~a)) correct_version_~n)) (<= 1 v_it_1) (<= (+ correct_version_~i~0 v_it_1 1) v_correct_version_~i~0_15))))) (or (not (<= correct_version_~n correct_version_~b~0)) (not (= correct_version_~i~0 v_correct_version_~i~0_15)))))))} is VALID [2022-04-07 17:51:32,432 INFO L272 TraceCheckUtils]: 7: Hoare triple {1638#(<= 1 main_~n~0)} [128] L104-->correct_versionENTRY: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {1615#true} is VALID [2022-04-07 17:51:32,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {1615#true} [126] L97-->L104: Formula: (and (<= 1 v_main_~m~0_3) (<= 1 v_main_~n~0_3) (<= v_main_~a~0_3 109) (<= v_main_~m~0_3 109) (<= 1 v_main_~a~0_3) (<= v_main_~n~0_3 109)) InVars {main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1638#(<= 1 main_~n~0)} is VALID [2022-04-07 17:51:32,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {1615#true} [124] mainENTRY-->L97: Formula: (and (= v_main_~n_stones2~0_3 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~n_stones1~0_2 v_main_~n_stones2~0_3) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~m~0_2 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~n~0=v_main_~n~0_2, main_~m~0=v_main_~m~0_2, main_~n_stones2~0=v_main_~n_stones2~0_3, main_~n_stones1~0=v_main_~n_stones1~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~m~0, main_~n~0, main_~n_stones2~0, main_~n_stones1~0, main_~a~0] {1615#true} is VALID [2022-04-07 17:51:32,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {1615#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1615#true} is VALID [2022-04-07 17:51:32,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1615#true} {1615#true} [167] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1615#true} is VALID [2022-04-07 17:51:32,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {1615#true} [125] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1615#true} is VALID [2022-04-07 17:51:32,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {1615#true} [122] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1615#true} is VALID [2022-04-07 17:51:32,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {1615#true} [120] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1615#true} is VALID [2022-04-07 17:51:32,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 17:51:32,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:51:32,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342048754] [2022-04-07 17:51:32,434 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 17:51:32,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213719948] [2022-04-07 17:51:32,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213719948] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:51:32,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 17:51:32,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2022-04-07 17:51:32,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387525339] [2022-04-07 17:51:32,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:51:32,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-04-07 17:51:32,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:51:32,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:32,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:32,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 17:51:32,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:51:32,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 17:51:32,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 17:51:32,477 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:32,639 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-07 17:51:32,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 17:51:32,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-04-07 17:51:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:51:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-07 17:51:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-07 17:51:32,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2022-04-07 17:51:32,691 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-07 17:51:32,692 INFO L225 Difference]: With dead ends: 44 [2022-04-07 17:51:32,692 INFO L226 Difference]: Without dead ends: 41 [2022-04-07 17:51:32,692 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-07 17:51:32,693 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:51:32,693 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 118 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-04-07 17:51:32,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-07 17:51:32,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-04-07 17:51:32,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:51:32,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:32,696 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:32,696 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:32,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:32,697 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-07 17:51:32,697 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-07 17:51:32,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:32,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:32,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-07 17:51:32,698 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-04-07 17:51:32,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:32,699 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-07 17:51:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-07 17:51:32,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:32,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:32,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:51:32,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:51:32,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:32,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-04-07 17:51:32,701 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 36 [2022-04-07 17:51:32,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:51:32,701 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-04-07 17:51:32,701 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:32,701 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-07 17:51:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-07 17:51:32,702 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:51:32,702 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-04-07 17:51:32,726 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-07 17:51:32,902 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:32,903 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:51:32,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:51:32,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1887612187, now seen corresponding path program 1 times [2022-04-07 17:51:32,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:51:32,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144756302] [2022-04-07 17:51:32,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:32,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:51:32,938 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 17:51:32,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1791420268] [2022-04-07 17:51:32,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:32,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:32,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:51:32,939 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-07 17:51:32,941 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-07 17:51:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:32,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-07 17:51:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:33,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:51:48,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {2005#true} [120] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-07 17:51:48,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {2005#true} [122] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2005#true} is VALID [2022-04-07 17:51:48,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {2005#true} [125] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-07 17:51:48,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2005#true} {2005#true} [167] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-07 17:51:48,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {2005#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-07 17:51:48,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {2005#true} [124] mainENTRY-->L97: Formula: (and (= v_main_~n_stones2~0_3 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~n_stones1~0_2 v_main_~n_stones2~0_3) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~m~0_2 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~n~0=v_main_~n~0_2, main_~m~0=v_main_~m~0_2, main_~n_stones2~0=v_main_~n_stones2~0_3, main_~n_stones1~0=v_main_~n_stones1~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~m~0, main_~n~0, main_~n_stones2~0, main_~n_stones1~0, main_~a~0] {2005#true} is VALID [2022-04-07 17:51:48,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {2005#true} [126] L97-->L104: Formula: (and (<= 1 v_main_~m~0_3) (<= 1 v_main_~n~0_3) (<= v_main_~a~0_3 109) (<= v_main_~m~0_3 109) (<= 1 v_main_~a~0_3) (<= v_main_~n~0_3 109)) InVars {main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {2028#(<= 1 main_~n~0)} is VALID [2022-04-07 17:51:48,480 INFO L272 TraceCheckUtils]: 7: Hoare triple {2028#(<= 1 main_~n~0)} [128] L104-->correct_versionENTRY: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {2005#true} is VALID [2022-04-07 17:51:48,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {2005#true} [131] correct_versionENTRY-->L38-2: Formula: (and (= |v_correct_version_#in~m_1| v_correct_version_~m_1) (= |v_correct_version_#in~a_1| v_correct_version_~a_1) (= v_correct_version_~i~0_2 0) (= v_correct_version_~l~0_1 0) (= |v_correct_version_#in~n_1| v_correct_version_~n_1) (= v_correct_version_~b~0_1 0) (= v_correct_version_~j~0_1 0)) InVars {correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_#in~n=|v_correct_version_#in~n_1|} OutVars{correct_version_~n=v_correct_version_~n_1, correct_version_~m=v_correct_version_~m_1, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_~b~0=v_correct_version_~b~0_1, correct_version_#in~n=|v_correct_version_#in~n_1|, correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_~i~0=v_correct_version_~i~0_2, correct_version_~l~0=v_correct_version_~l~0_1, correct_version_~a=v_correct_version_~a_1, correct_version_~j~0=v_correct_version_~j~0_1} AuxVars[] AssignedVars[correct_version_~n, correct_version_~m, correct_version_~b~0, correct_version_~i~0, correct_version_~l~0, correct_version_~a, correct_version_~j~0] {2005#true} is VALID [2022-04-07 17:51:48,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {2005#true} [137] L38-2-->L38-2: Formula: (or (and (= v_correct_version_~i~0_5 v_correct_version_~i~0_4) (= v_correct_version_~b~0_3 v_correct_version_~b~0_4) (<= v_correct_version_~n_3 v_correct_version_~b~0_4)) (and (= (+ (* v_correct_version_~a_2 (+ (* (- 1) v_correct_version_~i~0_5) v_correct_version_~i~0_4)) v_correct_version_~b~0_4) v_correct_version_~b~0_3) (< v_correct_version_~i~0_5 v_correct_version_~i~0_4) (forall ((v_it_1 Int)) (or (< (+ v_correct_version_~b~0_4 (* v_it_1 v_correct_version_~a_2)) v_correct_version_~n_3) (not (<= 1 v_it_1)) (not (<= (+ v_it_1 v_correct_version_~i~0_5 1) v_correct_version_~i~0_4)))) (< v_correct_version_~b~0_4 v_correct_version_~n_3))) InVars {correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_5, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_4} OutVars{correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_4, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_3} AuxVars[] AssignedVars[correct_version_~b~0, correct_version_~i~0] {2005#true} is VALID [2022-04-07 17:51:48,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {2005#true} [136] L38-2-->L44-1: Formula: (not (< v_correct_version_~b~0_2 v_correct_version_~n_2)) InVars {correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} OutVars{correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-07 17:51:48,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {2005#true} [145] L44-1-->L44-1: Formula: (or (and (<= v_correct_version_~m_3 v_correct_version_~l~0_4) (= v_correct_version_~l~0_4 v_correct_version_~l~0_3) (= v_correct_version_~j~0_4 v_correct_version_~j~0_3)) (and (= (+ (* (+ (* (- 1) v_correct_version_~j~0_4) v_correct_version_~j~0_3) v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~l~0_3) (< v_correct_version_~j~0_4 v_correct_version_~j~0_3) (< v_correct_version_~l~0_4 v_correct_version_~m_3) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 v_correct_version_~j~0_4 1) v_correct_version_~j~0_3)) (< (+ (* v_it_2 v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~m_3))))) InVars {correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_4, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_4} OutVars{correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_3, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_3} AuxVars[] AssignedVars[correct_version_~l~0, correct_version_~j~0] {2005#true} is VALID [2022-04-07 17:51:48,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {2005#true} [144] L44-1-->L44-2: Formula: (not (< v_correct_version_~l~0_2 v_correct_version_~m_2)) InVars {correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} OutVars{correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-07 17:51:48,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {2005#true} [152] L44-2-->L52-2: Formula: (and (= v_correct_version_~x~0_4 0) (= v_correct_version_~y~0_4 0)) InVars {} OutVars{correct_version_~y~0=v_correct_version_~y~0_4, correct_version_~x~0=v_correct_version_~x~0_4} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] {2005#true} is VALID [2022-04-07 17:51:48,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {2005#true} [158] L52-2-->L52-2: Formula: (or (and (< v_correct_version_~x~0_3 v_correct_version_~x~0_2) (= (+ (* v_correct_version_~j~0_2 v_correct_version_~x~0_2) v_correct_version_~y~0_2) (+ v_correct_version_~y~0_1 (* v_correct_version_~j~0_2 v_correct_version_~x~0_3))) (< v_correct_version_~x~0_2 (+ v_correct_version_~i~0_3 1))) (and (= v_correct_version_~y~0_2 v_correct_version_~y~0_1) (= v_correct_version_~x~0_3 v_correct_version_~x~0_2) (<= v_correct_version_~i~0_3 v_correct_version_~x~0_3))) InVars {correct_version_~y~0=v_correct_version_~y~0_2, correct_version_~x~0=v_correct_version_~x~0_3, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} OutVars{correct_version_~y~0=v_correct_version_~y~0_1, correct_version_~x~0=v_correct_version_~x~0_2, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] {2005#true} is VALID [2022-04-07 17:51:48,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {2005#true} [157] L52-2-->L52-3: Formula: (not (< v_correct_version_~x~0_1 v_correct_version_~i~0_1)) InVars {correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} OutVars{correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-07 17:51:48,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {2005#true} [160] L52-3-->correct_versionFINAL: Formula: (= |v_correct_version_#res_1| v_correct_version_~y~0_3) InVars {correct_version_~y~0=v_correct_version_~y~0_3} OutVars{correct_version_#res=|v_correct_version_#res_1|, correct_version_~y~0=v_correct_version_~y~0_3} AuxVars[] AssignedVars[correct_version_#res] {2005#true} is VALID [2022-04-07 17:51:48,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {2005#true} [164] correct_versionFINAL-->correct_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-07 17:51:48,484 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2005#true} {2028#(<= 1 main_~n~0)} [170] correct_versionEXIT-->L104-1: AOR: Formula: (= |v_main_#t~ret8_4| |v_correct_version_#resOutParam_1|) InVars {correct_version_#res=|v_correct_version_#resOutParam_1|} OutVars{main_#t~ret8=|v_main_#t~ret8_4|} AuxVars[] AssignedVars[main_#t~ret8, correct_version_#res] LVA: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {2028#(<= 1 main_~n~0)} is VALID [2022-04-07 17:51:48,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {2028#(<= 1 main_~n~0)} [130] L104-1-->L105: Formula: (and (<= |v_main_#t~ret8_3| 2147483647) (= |v_main_#t~ret8_3| v_main_~n_stones1~0_4) (<= 0 (+ |v_main_#t~ret8_3| 2147483648))) InVars {main_#t~ret8=|v_main_#t~ret8_3|} OutVars{main_~n_stones1~0=v_main_~n_stones1~0_4} AuxVars[] AssignedVars[main_#t~ret8, main_~n_stones1~0] {2028#(<= 1 main_~n~0)} is VALID [2022-04-07 17:51:48,484 INFO L272 TraceCheckUtils]: 20: Hoare triple {2028#(<= 1 main_~n~0)} [134] L105-->student_versionENTRY: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {2005#true} is VALID [2022-04-07 17:51:48,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {2005#true} [142] student_versionENTRY-->L65-2: Formula: (and (= v_student_version_~b~1_3 0) (= v_student_version_~m_3 |v_student_version_#in~m_1|) (= v_student_version_~a_3 |v_student_version_#in~a_1|) (= v_student_version_~n_2 |v_student_version_#in~n_1|) (= v_student_version_~j~1_3 0) (= v_student_version_~l~1_4 0) (= v_student_version_~i~1_4 0)) InVars {student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_#in~a=|v_student_version_#in~a_1|} OutVars{student_version_~i~1=v_student_version_~i~1_4, student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_~a=v_student_version_~a_3, student_version_~j~1=v_student_version_~j~1_3, student_version_~l~1=v_student_version_~l~1_4, student_version_~b~1=v_student_version_~b~1_3, student_version_~n=v_student_version_~n_2, student_version_#in~a=|v_student_version_#in~a_1|, student_version_~m=v_student_version_~m_3} AuxVars[] AssignedVars[student_version_~i~1, student_version_~a, student_version_~j~1, student_version_~l~1, student_version_~b~1, student_version_~n, student_version_~m] {2074#(and (<= 0 student_version_~i~1) (<= |student_version_#in~n| student_version_~n) (<= student_version_~b~1 0))} is VALID [2022-04-07 17:51:48,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {2074#(and (<= 0 student_version_~i~1) (<= |student_version_#in~n| student_version_~n) (<= student_version_~b~1 0))} [151] L65-2-->L65-2: Formula: (or (and (<= v_student_version_~n_1 v_student_version_~b~1_2) (= v_student_version_~b~1_2 v_student_version_~b~1_1) (= v_student_version_~i~1_2 v_student_version_~i~1_1)) (and (< v_student_version_~i~1_2 v_student_version_~i~1_1) (= (+ v_student_version_~b~1_2 (* (+ v_student_version_~i~1_1 (* (- 1) v_student_version_~i~1_2)) v_student_version_~a_1)) v_student_version_~b~1_1) (< v_student_version_~b~1_2 v_student_version_~n_1) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 v_student_version_~i~1_2 1) v_student_version_~i~1_1)) (< (+ v_student_version_~b~1_2 (* v_student_version_~a_1 v_it_3)) v_student_version_~n_1))))) InVars {student_version_~i~1=v_student_version_~i~1_2, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_2, student_version_~n=v_student_version_~n_1} OutVars{student_version_~i~1=v_student_version_~i~1_1, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_1, student_version_~n=v_student_version_~n_1} AuxVars[] AssignedVars[student_version_~i~1, student_version_~b~1] {2078#(exists ((student_version_~n Int) (v_student_version_~b~1_12 Int) (v_student_version_~i~1_14 Int)) (and (<= v_student_version_~b~1_12 0) (<= |student_version_#in~n| student_version_~n) (or (and (<= student_version_~n v_student_version_~b~1_12) (= student_version_~i~1 v_student_version_~i~1_14)) (and (exists ((student_version_~a Int)) (forall ((v_it_3 Int)) (or (< (+ (* v_it_3 student_version_~a) v_student_version_~b~1_12) student_version_~n) (not (<= (+ v_it_3 v_student_version_~i~1_14 1) student_version_~i~1)) (not (<= 1 v_it_3))))) (< v_student_version_~b~1_12 student_version_~n) (< v_student_version_~i~1_14 student_version_~i~1))) (<= 0 v_student_version_~i~1_14)))} is VALID [2022-04-07 17:51:48,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {2078#(exists ((student_version_~n Int) (v_student_version_~b~1_12 Int) (v_student_version_~i~1_14 Int)) (and (<= v_student_version_~b~1_12 0) (<= |student_version_#in~n| student_version_~n) (or (and (<= student_version_~n v_student_version_~b~1_12) (= student_version_~i~1 v_student_version_~i~1_14)) (and (exists ((student_version_~a Int)) (forall ((v_it_3 Int)) (or (< (+ (* v_it_3 student_version_~a) v_student_version_~b~1_12) student_version_~n) (not (<= (+ v_it_3 v_student_version_~i~1_14 1) student_version_~i~1)) (not (<= 1 v_it_3))))) (< v_student_version_~b~1_12 student_version_~n) (< v_student_version_~i~1_14 student_version_~i~1))) (<= 0 v_student_version_~i~1_14)))} [150] L65-2-->L71-1: Formula: (not (< v_student_version_~b~1_4 v_student_version_~n_3)) InVars {student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} OutVars{student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} AuxVars[] AssignedVars[] {2078#(exists ((student_version_~n Int) (v_student_version_~b~1_12 Int) (v_student_version_~i~1_14 Int)) (and (<= v_student_version_~b~1_12 0) (<= |student_version_#in~n| student_version_~n) (or (and (<= student_version_~n v_student_version_~b~1_12) (= student_version_~i~1 v_student_version_~i~1_14)) (and (exists ((student_version_~a Int)) (forall ((v_it_3 Int)) (or (< (+ (* v_it_3 student_version_~a) v_student_version_~b~1_12) student_version_~n) (not (<= (+ v_it_3 v_student_version_~i~1_14 1) student_version_~i~1)) (not (<= 1 v_it_3))))) (< v_student_version_~b~1_12 student_version_~n) (< v_student_version_~i~1_14 student_version_~i~1))) (<= 0 v_student_version_~i~1_14)))} is VALID [2022-04-07 17:51:48,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {2078#(exists ((student_version_~n Int) (v_student_version_~b~1_12 Int) (v_student_version_~i~1_14 Int)) (and (<= v_student_version_~b~1_12 0) (<= |student_version_#in~n| student_version_~n) (or (and (<= student_version_~n v_student_version_~b~1_12) (= student_version_~i~1 v_student_version_~i~1_14)) (and (exists ((student_version_~a Int)) (forall ((v_it_3 Int)) (or (< (+ (* v_it_3 student_version_~a) v_student_version_~b~1_12) student_version_~n) (not (<= (+ v_it_3 v_student_version_~i~1_14 1) student_version_~i~1)) (not (<= 1 v_it_3))))) (< v_student_version_~b~1_12 student_version_~n) (< v_student_version_~i~1_14 student_version_~i~1))) (<= 0 v_student_version_~i~1_14)))} [155] L71-1-->L71-1: Formula: (or (and (= v_student_version_~l~1_3 v_student_version_~l~1_2) (<= v_student_version_~m_2 v_student_version_~l~1_3) (= v_student_version_~j~1_2 v_student_version_~j~1_1)) (and (= (+ v_student_version_~l~1_3 (* (+ v_student_version_~j~1_1 (* (- 1) v_student_version_~j~1_2)) v_student_version_~a_2)) v_student_version_~l~1_2) (< v_student_version_~j~1_2 v_student_version_~j~1_1) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 v_student_version_~j~1_2 1) v_student_version_~j~1_1)) (not (<= 1 v_it_4)) (< (+ (* v_student_version_~a_2 v_it_4) v_student_version_~l~1_3) v_student_version_~m_2))) (< v_student_version_~l~1_3 v_student_version_~m_2))) InVars {student_version_~l~1=v_student_version_~l~1_3, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_2, student_version_~m=v_student_version_~m_2} OutVars{student_version_~l~1=v_student_version_~l~1_2, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_1, student_version_~m=v_student_version_~m_2} AuxVars[] AssignedVars[student_version_~j~1, student_version_~l~1] {2078#(exists ((student_version_~n Int) (v_student_version_~b~1_12 Int) (v_student_version_~i~1_14 Int)) (and (<= v_student_version_~b~1_12 0) (<= |student_version_#in~n| student_version_~n) (or (and (<= student_version_~n v_student_version_~b~1_12) (= student_version_~i~1 v_student_version_~i~1_14)) (and (exists ((student_version_~a Int)) (forall ((v_it_3 Int)) (or (< (+ (* v_it_3 student_version_~a) v_student_version_~b~1_12) student_version_~n) (not (<= (+ v_it_3 v_student_version_~i~1_14 1) student_version_~i~1)) (not (<= 1 v_it_3))))) (< v_student_version_~b~1_12 student_version_~n) (< v_student_version_~i~1_14 student_version_~i~1))) (<= 0 v_student_version_~i~1_14)))} is VALID [2022-04-07 17:51:48,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {2078#(exists ((student_version_~n Int) (v_student_version_~b~1_12 Int) (v_student_version_~i~1_14 Int)) (and (<= v_student_version_~b~1_12 0) (<= |student_version_#in~n| student_version_~n) (or (and (<= student_version_~n v_student_version_~b~1_12) (= student_version_~i~1 v_student_version_~i~1_14)) (and (exists ((student_version_~a Int)) (forall ((v_it_3 Int)) (or (< (+ (* v_it_3 student_version_~a) v_student_version_~b~1_12) student_version_~n) (not (<= (+ v_it_3 v_student_version_~i~1_14 1) student_version_~i~1)) (not (<= 1 v_it_3))))) (< v_student_version_~b~1_12 student_version_~n) (< v_student_version_~i~1_14 student_version_~i~1))) (<= 0 v_student_version_~i~1_14)))} [154] L71-1-->L71-2: Formula: (not (< v_student_version_~l~1_1 v_student_version_~m_1)) InVars {student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} OutVars{student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} AuxVars[] AssignedVars[] {2078#(exists ((student_version_~n Int) (v_student_version_~b~1_12 Int) (v_student_version_~i~1_14 Int)) (and (<= v_student_version_~b~1_12 0) (<= |student_version_#in~n| student_version_~n) (or (and (<= student_version_~n v_student_version_~b~1_12) (= student_version_~i~1 v_student_version_~i~1_14)) (and (exists ((student_version_~a Int)) (forall ((v_it_3 Int)) (or (< (+ (* v_it_3 student_version_~a) v_student_version_~b~1_12) student_version_~n) (not (<= (+ v_it_3 v_student_version_~i~1_14 1) student_version_~i~1)) (not (<= 1 v_it_3))))) (< v_student_version_~b~1_12 student_version_~n) (< v_student_version_~i~1_14 student_version_~i~1))) (<= 0 v_student_version_~i~1_14)))} is VALID [2022-04-07 17:51:48,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {2078#(exists ((student_version_~n Int) (v_student_version_~b~1_12 Int) (v_student_version_~i~1_14 Int)) (and (<= v_student_version_~b~1_12 0) (<= |student_version_#in~n| student_version_~n) (or (and (<= student_version_~n v_student_version_~b~1_12) (= student_version_~i~1 v_student_version_~i~1_14)) (and (exists ((student_version_~a Int)) (forall ((v_it_3 Int)) (or (< (+ (* v_it_3 student_version_~a) v_student_version_~b~1_12) student_version_~n) (not (<= (+ v_it_3 v_student_version_~i~1_14 1) student_version_~i~1)) (not (<= 1 v_it_3))))) (< v_student_version_~b~1_12 student_version_~n) (< v_student_version_~i~1_14 student_version_~i~1))) (<= 0 v_student_version_~i~1_14)))} [159] L71-2-->L79-2: Formula: (and (= v_student_version_~y~1_1 0) (= v_student_version_~x~1_1 0)) InVars {} OutVars{student_version_~x~1=v_student_version_~x~1_1, student_version_~y~1=v_student_version_~y~1_1} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {2091#(and (<= student_version_~x~1 0) (exists ((student_version_~n Int) (v_student_version_~b~1_12 Int) (v_student_version_~i~1_14 Int)) (and (<= v_student_version_~b~1_12 0) (<= |student_version_#in~n| student_version_~n) (or (and (<= student_version_~n v_student_version_~b~1_12) (= student_version_~i~1 v_student_version_~i~1_14)) (and (exists ((student_version_~a Int)) (forall ((v_it_3 Int)) (or (< (+ (* v_it_3 student_version_~a) v_student_version_~b~1_12) student_version_~n) (not (<= (+ v_it_3 v_student_version_~i~1_14 1) student_version_~i~1)) (not (<= 1 v_it_3))))) (< v_student_version_~b~1_12 student_version_~n) (< v_student_version_~i~1_14 student_version_~i~1))) (<= 0 v_student_version_~i~1_14))))} is VALID [2022-04-07 17:51:48,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {2091#(and (<= student_version_~x~1 0) (exists ((student_version_~n Int) (v_student_version_~b~1_12 Int) (v_student_version_~i~1_14 Int)) (and (<= v_student_version_~b~1_12 0) (<= |student_version_#in~n| student_version_~n) (or (and (<= student_version_~n v_student_version_~b~1_12) (= student_version_~i~1 v_student_version_~i~1_14)) (and (exists ((student_version_~a Int)) (forall ((v_it_3 Int)) (or (< (+ (* v_it_3 student_version_~a) v_student_version_~b~1_12) student_version_~n) (not (<= (+ v_it_3 v_student_version_~i~1_14 1) student_version_~i~1)) (not (<= 1 v_it_3))))) (< v_student_version_~b~1_12 student_version_~n) (< v_student_version_~i~1_14 student_version_~i~1))) (<= 0 v_student_version_~i~1_14))))} [162] L79-2-->L79-3: Formula: (not (< v_student_version_~x~1_2 v_student_version_~i~1_3)) InVars {student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} OutVars{student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} AuxVars[] AssignedVars[] {2095#(<= |student_version_#in~n| 0)} is VALID [2022-04-07 17:51:48,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {2095#(<= |student_version_#in~n| 0)} [165] L79-3-->student_versionFINAL: Formula: (= v_student_version_~y~1_4 |v_student_version_#res_1|) InVars {student_version_~y~1=v_student_version_~y~1_4} OutVars{student_version_#res=|v_student_version_#res_1|, student_version_~y~1=v_student_version_~y~1_4} AuxVars[] AssignedVars[student_version_#res] {2095#(<= |student_version_#in~n| 0)} is VALID [2022-04-07 17:51:48,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {2095#(<= |student_version_#in~n| 0)} [166] student_versionFINAL-->student_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2095#(<= |student_version_#in~n| 0)} is VALID [2022-04-07 17:51:48,561 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2095#(<= |student_version_#in~n| 0)} {2028#(<= 1 main_~n~0)} [171] student_versionEXIT-->L105-1: AOR: Formula: (= |v_main_#t~ret9_4| |v_student_version_#resOutParam_1|) InVars {student_version_#res=|v_student_version_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_4|} AuxVars[] AssignedVars[student_version_#res, main_#t~ret9] LVA: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {2006#false} is VALID [2022-04-07 17:51:48,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {2006#false} [141] L105-1-->L97-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647) (= |v_main_#t~ret9_2| v_main_~n_stones2~0_1)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_~n_stones2~0=v_main_~n_stones2~0_1} AuxVars[] AssignedVars[main_~n_stones2~0, main_#t~ret9] {2006#false} is VALID [2022-04-07 17:51:48,561 INFO L272 TraceCheckUtils]: 32: Hoare triple {2006#false} [129] L97-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n_stones1~0_5 v_main_~n_stones2~0_4) 1 0)) InVars {main_~n_stones2~0=v_main_~n_stones2~0_4, main_~n_stones1~0=v_main_~n_stones1~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n_stones2~0, main_~n_stones1~0] {2006#false} is VALID [2022-04-07 17:51:48,561 INFO L290 TraceCheckUtils]: 33: Hoare triple {2006#false} [133] __VERIFIER_assertENTRY-->L6: 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] {2006#false} is VALID [2022-04-07 17:51:48,561 INFO L290 TraceCheckUtils]: 34: Hoare triple {2006#false} [139] L6-->L7: 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[] {2006#false} is VALID [2022-04-07 17:51:48,561 INFO L290 TraceCheckUtils]: 35: Hoare triple {2006#false} [146] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2006#false} is VALID [2022-04-07 17:51:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 17:51:48,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:51:49,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {2006#false} [146] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2006#false} is VALID [2022-04-07 17:51:49,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {2006#false} [139] L6-->L7: 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[] {2006#false} is VALID [2022-04-07 17:51:49,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {2006#false} [133] __VERIFIER_assertENTRY-->L6: 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] {2006#false} is VALID [2022-04-07 17:51:49,857 INFO L272 TraceCheckUtils]: 32: Hoare triple {2006#false} [129] L97-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n_stones1~0_5 v_main_~n_stones2~0_4) 1 0)) InVars {main_~n_stones2~0=v_main_~n_stones2~0_4, main_~n_stones1~0=v_main_~n_stones1~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n_stones2~0, main_~n_stones1~0] {2006#false} is VALID [2022-04-07 17:51:49,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {2006#false} [141] L105-1-->L97-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647) (= |v_main_#t~ret9_2| v_main_~n_stones2~0_1)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_~n_stones2~0=v_main_~n_stones2~0_1} AuxVars[] AssignedVars[main_~n_stones2~0, main_#t~ret9] {2006#false} is VALID [2022-04-07 17:51:49,859 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2095#(<= |student_version_#in~n| 0)} {2028#(<= 1 main_~n~0)} [171] student_versionEXIT-->L105-1: AOR: Formula: (= |v_main_#t~ret9_4| |v_student_version_#resOutParam_1|) InVars {student_version_#res=|v_student_version_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_4|} AuxVars[] AssignedVars[student_version_#res, main_#t~ret9] LVA: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {2006#false} is VALID [2022-04-07 17:51:49,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {2095#(<= |student_version_#in~n| 0)} [166] student_versionFINAL-->student_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2095#(<= |student_version_#in~n| 0)} is VALID [2022-04-07 17:51:49,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {2095#(<= |student_version_#in~n| 0)} [165] L79-3-->student_versionFINAL: Formula: (= v_student_version_~y~1_4 |v_student_version_#res_1|) InVars {student_version_~y~1=v_student_version_~y~1_4} OutVars{student_version_#res=|v_student_version_#res_1|, student_version_~y~1=v_student_version_~y~1_4} AuxVars[] AssignedVars[student_version_#res] {2095#(<= |student_version_#in~n| 0)} is VALID [2022-04-07 17:51:49,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {2147#(or (< student_version_~x~1 student_version_~i~1) (<= |student_version_#in~n| 0))} [162] L79-2-->L79-3: Formula: (not (< v_student_version_~x~1_2 v_student_version_~i~1_3)) InVars {student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} OutVars{student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} AuxVars[] AssignedVars[] {2095#(<= |student_version_#in~n| 0)} is VALID [2022-04-07 17:51:49,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {2151#(or (<= |student_version_#in~n| 0) (< 0 student_version_~i~1))} [159] L71-2-->L79-2: Formula: (and (= v_student_version_~y~1_1 0) (= v_student_version_~x~1_1 0)) InVars {} OutVars{student_version_~x~1=v_student_version_~x~1_1, student_version_~y~1=v_student_version_~y~1_1} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {2147#(or (< student_version_~x~1 student_version_~i~1) (<= |student_version_#in~n| 0))} is VALID [2022-04-07 17:51:49,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {2151#(or (<= |student_version_#in~n| 0) (< 0 student_version_~i~1))} [154] L71-1-->L71-2: Formula: (not (< v_student_version_~l~1_1 v_student_version_~m_1)) InVars {student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} OutVars{student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} AuxVars[] AssignedVars[] {2151#(or (<= |student_version_#in~n| 0) (< 0 student_version_~i~1))} is VALID [2022-04-07 17:51:49,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {2151#(or (<= |student_version_#in~n| 0) (< 0 student_version_~i~1))} [155] L71-1-->L71-1: Formula: (or (and (= v_student_version_~l~1_3 v_student_version_~l~1_2) (<= v_student_version_~m_2 v_student_version_~l~1_3) (= v_student_version_~j~1_2 v_student_version_~j~1_1)) (and (= (+ v_student_version_~l~1_3 (* (+ v_student_version_~j~1_1 (* (- 1) v_student_version_~j~1_2)) v_student_version_~a_2)) v_student_version_~l~1_2) (< v_student_version_~j~1_2 v_student_version_~j~1_1) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 v_student_version_~j~1_2 1) v_student_version_~j~1_1)) (not (<= 1 v_it_4)) (< (+ (* v_student_version_~a_2 v_it_4) v_student_version_~l~1_3) v_student_version_~m_2))) (< v_student_version_~l~1_3 v_student_version_~m_2))) InVars {student_version_~l~1=v_student_version_~l~1_3, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_2, student_version_~m=v_student_version_~m_2} OutVars{student_version_~l~1=v_student_version_~l~1_2, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_1, student_version_~m=v_student_version_~m_2} AuxVars[] AssignedVars[student_version_~j~1, student_version_~l~1] {2151#(or (<= |student_version_#in~n| 0) (< 0 student_version_~i~1))} is VALID [2022-04-07 17:51:49,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {2151#(or (<= |student_version_#in~n| 0) (< 0 student_version_~i~1))} [150] L65-2-->L71-1: Formula: (not (< v_student_version_~b~1_4 v_student_version_~n_3)) InVars {student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} OutVars{student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} AuxVars[] AssignedVars[] {2151#(or (<= |student_version_#in~n| 0) (< 0 student_version_~i~1))} is VALID [2022-04-07 17:51:49,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {2164#(or (<= |student_version_#in~n| 0) (forall ((v_student_version_~i~1_19 Int)) (or (and (or (not (<= student_version_~n student_version_~b~1)) (not (= student_version_~i~1 v_student_version_~i~1_19))) (or (not (< student_version_~i~1 v_student_version_~i~1_19)) (not (< student_version_~b~1 student_version_~n)) (forall ((student_version_~a Int)) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ v_it_3 student_version_~i~1 1) v_student_version_~i~1_19) (not (< (+ (* v_it_3 student_version_~a) student_version_~b~1) student_version_~n))))))) (< 0 v_student_version_~i~1_19))))} [151] L65-2-->L65-2: Formula: (or (and (<= v_student_version_~n_1 v_student_version_~b~1_2) (= v_student_version_~b~1_2 v_student_version_~b~1_1) (= v_student_version_~i~1_2 v_student_version_~i~1_1)) (and (< v_student_version_~i~1_2 v_student_version_~i~1_1) (= (+ v_student_version_~b~1_2 (* (+ v_student_version_~i~1_1 (* (- 1) v_student_version_~i~1_2)) v_student_version_~a_1)) v_student_version_~b~1_1) (< v_student_version_~b~1_2 v_student_version_~n_1) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 v_student_version_~i~1_2 1) v_student_version_~i~1_1)) (< (+ v_student_version_~b~1_2 (* v_student_version_~a_1 v_it_3)) v_student_version_~n_1))))) InVars {student_version_~i~1=v_student_version_~i~1_2, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_2, student_version_~n=v_student_version_~n_1} OutVars{student_version_~i~1=v_student_version_~i~1_1, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_1, student_version_~n=v_student_version_~n_1} AuxVars[] AssignedVars[student_version_~i~1, student_version_~b~1] {2151#(or (<= |student_version_#in~n| 0) (< 0 student_version_~i~1))} is VALID [2022-04-07 17:51:49,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {2005#true} [142] student_versionENTRY-->L65-2: Formula: (and (= v_student_version_~b~1_3 0) (= v_student_version_~m_3 |v_student_version_#in~m_1|) (= v_student_version_~a_3 |v_student_version_#in~a_1|) (= v_student_version_~n_2 |v_student_version_#in~n_1|) (= v_student_version_~j~1_3 0) (= v_student_version_~l~1_4 0) (= v_student_version_~i~1_4 0)) InVars {student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_#in~a=|v_student_version_#in~a_1|} OutVars{student_version_~i~1=v_student_version_~i~1_4, student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_~a=v_student_version_~a_3, student_version_~j~1=v_student_version_~j~1_3, student_version_~l~1=v_student_version_~l~1_4, student_version_~b~1=v_student_version_~b~1_3, student_version_~n=v_student_version_~n_2, student_version_#in~a=|v_student_version_#in~a_1|, student_version_~m=v_student_version_~m_3} AuxVars[] AssignedVars[student_version_~i~1, student_version_~a, student_version_~j~1, student_version_~l~1, student_version_~b~1, student_version_~n, student_version_~m] {2164#(or (<= |student_version_#in~n| 0) (forall ((v_student_version_~i~1_19 Int)) (or (and (or (not (<= student_version_~n student_version_~b~1)) (not (= student_version_~i~1 v_student_version_~i~1_19))) (or (not (< student_version_~i~1 v_student_version_~i~1_19)) (not (< student_version_~b~1 student_version_~n)) (forall ((student_version_~a Int)) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ v_it_3 student_version_~i~1 1) v_student_version_~i~1_19) (not (< (+ (* v_it_3 student_version_~a) student_version_~b~1) student_version_~n))))))) (< 0 v_student_version_~i~1_19))))} is VALID [2022-04-07 17:51:49,869 INFO L272 TraceCheckUtils]: 20: Hoare triple {2028#(<= 1 main_~n~0)} [134] L105-->student_versionENTRY: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {2005#true} is VALID [2022-04-07 17:51:49,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {2028#(<= 1 main_~n~0)} [130] L104-1-->L105: Formula: (and (<= |v_main_#t~ret8_3| 2147483647) (= |v_main_#t~ret8_3| v_main_~n_stones1~0_4) (<= 0 (+ |v_main_#t~ret8_3| 2147483648))) InVars {main_#t~ret8=|v_main_#t~ret8_3|} OutVars{main_~n_stones1~0=v_main_~n_stones1~0_4} AuxVars[] AssignedVars[main_#t~ret8, main_~n_stones1~0] {2028#(<= 1 main_~n~0)} is VALID [2022-04-07 17:51:49,871 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2005#true} {2028#(<= 1 main_~n~0)} [170] correct_versionEXIT-->L104-1: AOR: Formula: (= |v_main_#t~ret8_4| |v_correct_version_#resOutParam_1|) InVars {correct_version_#res=|v_correct_version_#resOutParam_1|} OutVars{main_#t~ret8=|v_main_#t~ret8_4|} AuxVars[] AssignedVars[main_#t~ret8, correct_version_#res] LVA: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {2028#(<= 1 main_~n~0)} is VALID [2022-04-07 17:51:49,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {2005#true} [164] correct_versionFINAL-->correct_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-07 17:51:49,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {2005#true} [160] L52-3-->correct_versionFINAL: Formula: (= |v_correct_version_#res_1| v_correct_version_~y~0_3) InVars {correct_version_~y~0=v_correct_version_~y~0_3} OutVars{correct_version_#res=|v_correct_version_#res_1|, correct_version_~y~0=v_correct_version_~y~0_3} AuxVars[] AssignedVars[correct_version_#res] {2005#true} is VALID [2022-04-07 17:51:49,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {2005#true} [157] L52-2-->L52-3: Formula: (not (< v_correct_version_~x~0_1 v_correct_version_~i~0_1)) InVars {correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} OutVars{correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-07 17:51:49,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {2005#true} [158] L52-2-->L52-2: Formula: (or (and (< v_correct_version_~x~0_3 v_correct_version_~x~0_2) (= (+ (* v_correct_version_~j~0_2 v_correct_version_~x~0_2) v_correct_version_~y~0_2) (+ v_correct_version_~y~0_1 (* v_correct_version_~j~0_2 v_correct_version_~x~0_3))) (< v_correct_version_~x~0_2 (+ v_correct_version_~i~0_3 1))) (and (= v_correct_version_~y~0_2 v_correct_version_~y~0_1) (= v_correct_version_~x~0_3 v_correct_version_~x~0_2) (<= v_correct_version_~i~0_3 v_correct_version_~x~0_3))) InVars {correct_version_~y~0=v_correct_version_~y~0_2, correct_version_~x~0=v_correct_version_~x~0_3, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} OutVars{correct_version_~y~0=v_correct_version_~y~0_1, correct_version_~x~0=v_correct_version_~x~0_2, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] {2005#true} is VALID [2022-04-07 17:51:49,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {2005#true} [152] L44-2-->L52-2: Formula: (and (= v_correct_version_~x~0_4 0) (= v_correct_version_~y~0_4 0)) InVars {} OutVars{correct_version_~y~0=v_correct_version_~y~0_4, correct_version_~x~0=v_correct_version_~x~0_4} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] {2005#true} is VALID [2022-04-07 17:51:49,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {2005#true} [144] L44-1-->L44-2: Formula: (not (< v_correct_version_~l~0_2 v_correct_version_~m_2)) InVars {correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} OutVars{correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-07 17:51:49,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {2005#true} [145] L44-1-->L44-1: Formula: (or (and (<= v_correct_version_~m_3 v_correct_version_~l~0_4) (= v_correct_version_~l~0_4 v_correct_version_~l~0_3) (= v_correct_version_~j~0_4 v_correct_version_~j~0_3)) (and (= (+ (* (+ (* (- 1) v_correct_version_~j~0_4) v_correct_version_~j~0_3) v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~l~0_3) (< v_correct_version_~j~0_4 v_correct_version_~j~0_3) (< v_correct_version_~l~0_4 v_correct_version_~m_3) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 v_correct_version_~j~0_4 1) v_correct_version_~j~0_3)) (< (+ (* v_it_2 v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~m_3))))) InVars {correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_4, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_4} OutVars{correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_3, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_3} AuxVars[] AssignedVars[correct_version_~l~0, correct_version_~j~0] {2005#true} is VALID [2022-04-07 17:51:49,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {2005#true} [136] L38-2-->L44-1: Formula: (not (< v_correct_version_~b~0_2 v_correct_version_~n_2)) InVars {correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} OutVars{correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-07 17:51:49,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {2005#true} [137] L38-2-->L38-2: Formula: (or (and (= v_correct_version_~i~0_5 v_correct_version_~i~0_4) (= v_correct_version_~b~0_3 v_correct_version_~b~0_4) (<= v_correct_version_~n_3 v_correct_version_~b~0_4)) (and (= (+ (* v_correct_version_~a_2 (+ (* (- 1) v_correct_version_~i~0_5) v_correct_version_~i~0_4)) v_correct_version_~b~0_4) v_correct_version_~b~0_3) (< v_correct_version_~i~0_5 v_correct_version_~i~0_4) (forall ((v_it_1 Int)) (or (< (+ v_correct_version_~b~0_4 (* v_it_1 v_correct_version_~a_2)) v_correct_version_~n_3) (not (<= 1 v_it_1)) (not (<= (+ v_it_1 v_correct_version_~i~0_5 1) v_correct_version_~i~0_4)))) (< v_correct_version_~b~0_4 v_correct_version_~n_3))) InVars {correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_5, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_4} OutVars{correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_4, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_3} AuxVars[] AssignedVars[correct_version_~b~0, correct_version_~i~0] {2005#true} is VALID [2022-04-07 17:51:49,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {2005#true} [131] correct_versionENTRY-->L38-2: Formula: (and (= |v_correct_version_#in~m_1| v_correct_version_~m_1) (= |v_correct_version_#in~a_1| v_correct_version_~a_1) (= v_correct_version_~i~0_2 0) (= v_correct_version_~l~0_1 0) (= |v_correct_version_#in~n_1| v_correct_version_~n_1) (= v_correct_version_~b~0_1 0) (= v_correct_version_~j~0_1 0)) InVars {correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_#in~n=|v_correct_version_#in~n_1|} OutVars{correct_version_~n=v_correct_version_~n_1, correct_version_~m=v_correct_version_~m_1, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_~b~0=v_correct_version_~b~0_1, correct_version_#in~n=|v_correct_version_#in~n_1|, correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_~i~0=v_correct_version_~i~0_2, correct_version_~l~0=v_correct_version_~l~0_1, correct_version_~a=v_correct_version_~a_1, correct_version_~j~0=v_correct_version_~j~0_1} AuxVars[] AssignedVars[correct_version_~n, correct_version_~m, correct_version_~b~0, correct_version_~i~0, correct_version_~l~0, correct_version_~a, correct_version_~j~0] {2005#true} is VALID [2022-04-07 17:51:49,872 INFO L272 TraceCheckUtils]: 7: Hoare triple {2028#(<= 1 main_~n~0)} [128] L104-->correct_versionENTRY: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {2005#true} is VALID [2022-04-07 17:51:49,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {2005#true} [126] L97-->L104: Formula: (and (<= 1 v_main_~m~0_3) (<= 1 v_main_~n~0_3) (<= v_main_~a~0_3 109) (<= v_main_~m~0_3 109) (<= 1 v_main_~a~0_3) (<= v_main_~n~0_3 109)) InVars {main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {2028#(<= 1 main_~n~0)} is VALID [2022-04-07 17:51:49,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {2005#true} [124] mainENTRY-->L97: Formula: (and (= v_main_~n_stones2~0_3 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~n_stones1~0_2 v_main_~n_stones2~0_3) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~m~0_2 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~n~0=v_main_~n~0_2, main_~m~0=v_main_~m~0_2, main_~n_stones2~0=v_main_~n_stones2~0_3, main_~n_stones1~0=v_main_~n_stones1~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~m~0, main_~n~0, main_~n_stones2~0, main_~n_stones1~0, main_~a~0] {2005#true} is VALID [2022-04-07 17:51:49,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {2005#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-07 17:51:49,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2005#true} {2005#true} [167] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-07 17:51:49,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {2005#true} [125] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-07 17:51:49,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {2005#true} [122] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2005#true} is VALID [2022-04-07 17:51:49,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {2005#true} [120] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-07 17:51:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 17:51:49,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:51:49,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144756302] [2022-04-07 17:51:49,874 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 17:51:49,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791420268] [2022-04-07 17:51:49,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791420268] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:51:49,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 17:51:49,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2022-04-07 17:51:49,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453196761] [2022-04-07 17:51:49,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:51:49,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-07 17:51:49,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:51:49,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:49,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:49,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 17:51:49,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:51:49,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 17:51:49,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 17:51:49,913 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:50,067 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-07 17:51:50,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 17:51:50,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-07 17:51:50,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:51:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:50,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-07 17:51:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-07 17:51:50,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2022-04-07 17:51:50,118 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-07 17:51:50,119 INFO L225 Difference]: With dead ends: 41 [2022-04-07 17:51:50,119 INFO L226 Difference]: Without dead ends: 38 [2022-04-07 17:51:50,119 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-07 17:51:50,120 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 15 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:51:50,120 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 137 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-04-07 17:51:50,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-07 17:51:50,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-07 17:51:50,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:51:50,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:50,123 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:50,123 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:50,124 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-07 17:51:50,124 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-07 17:51:50,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:50,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:50,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-04-07 17:51:50,125 INFO L87 Difference]: Start difference. First operand has 38 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-04-07 17:51:50,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:50,126 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-07 17:51:50,126 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-07 17:51:50,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:50,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:50,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:51:50,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:51:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:51:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-04-07 17:51:50,128 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 36 [2022-04-07 17:51:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:51:50,128 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-04-07 17:51:50,128 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 17:51:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-07 17:51:50,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 17:51:50,129 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:51:50,129 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-04-07 17:51:50,155 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-07 17:51:50,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:50,344 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:51:50,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:51:50,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1698211422, now seen corresponding path program 1 times [2022-04-07 17:51:50,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:51:50,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595345920] [2022-04-07 17:51:50,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:50,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:51:50,366 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 17:51:50,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1941569420] [2022-04-07 17:51:50,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:50,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:50,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:51:50,368 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-07 17:51:50,397 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-07 17:51:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:50,850 WARN L261 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-07 17:51:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:51,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:51:57,993 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:52:03,142 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:52:09,577 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:52:50,462 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:52:54,132 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:53:57,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {2387#true} [120] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2387#true} is VALID [2022-04-07 17:53:57,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {2387#true} [122] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2387#true} is VALID [2022-04-07 17:53:57,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {2387#true} [125] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2387#true} is VALID [2022-04-07 17:53:57,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2387#true} {2387#true} [167] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2387#true} is VALID [2022-04-07 17:53:57,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {2387#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2387#true} is VALID [2022-04-07 17:53:57,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {2387#true} [124] mainENTRY-->L97: Formula: (and (= v_main_~n_stones2~0_3 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~n_stones1~0_2 v_main_~n_stones2~0_3) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~m~0_2 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~n~0=v_main_~n~0_2, main_~m~0=v_main_~m~0_2, main_~n_stones2~0=v_main_~n_stones2~0_3, main_~n_stones1~0=v_main_~n_stones1~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~m~0, main_~n~0, main_~n_stones2~0, main_~n_stones1~0, main_~a~0] {2387#true} is VALID [2022-04-07 17:53:57,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {2387#true} [126] L97-->L104: Formula: (and (<= 1 v_main_~m~0_3) (<= 1 v_main_~n~0_3) (<= v_main_~a~0_3 109) (<= v_main_~m~0_3 109) (<= 1 v_main_~a~0_3) (<= v_main_~n~0_3 109)) InVars {main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {2410#(and (<= 1 main_~n~0) (<= 1 main_~m~0) (<= 1 main_~a~0))} is VALID [2022-04-07 17:53:57,200 INFO L272 TraceCheckUtils]: 7: Hoare triple {2410#(and (<= 1 main_~n~0) (<= 1 main_~m~0) (<= 1 main_~a~0))} [128] L104-->correct_versionENTRY: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {2387#true} is VALID [2022-04-07 17:53:57,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {2387#true} [131] correct_versionENTRY-->L38-2: Formula: (and (= |v_correct_version_#in~m_1| v_correct_version_~m_1) (= |v_correct_version_#in~a_1| v_correct_version_~a_1) (= v_correct_version_~i~0_2 0) (= v_correct_version_~l~0_1 0) (= |v_correct_version_#in~n_1| v_correct_version_~n_1) (= v_correct_version_~b~0_1 0) (= v_correct_version_~j~0_1 0)) InVars {correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_#in~n=|v_correct_version_#in~n_1|} OutVars{correct_version_~n=v_correct_version_~n_1, correct_version_~m=v_correct_version_~m_1, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_~b~0=v_correct_version_~b~0_1, correct_version_#in~n=|v_correct_version_#in~n_1|, correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_~i~0=v_correct_version_~i~0_2, correct_version_~l~0=v_correct_version_~l~0_1, correct_version_~a=v_correct_version_~a_1, correct_version_~j~0=v_correct_version_~j~0_1} AuxVars[] AssignedVars[correct_version_~n, correct_version_~m, correct_version_~b~0, correct_version_~i~0, correct_version_~l~0, correct_version_~a, correct_version_~j~0] {2417#(and (= correct_version_~b~0 0) (= correct_version_~j~0 0) (= |correct_version_#in~n| correct_version_~n) (= |correct_version_#in~m| correct_version_~m) (= |correct_version_#in~a| correct_version_~a) (= correct_version_~i~0 0) (= correct_version_~l~0 0))} is VALID [2022-04-07 17:53:57,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {2417#(and (= correct_version_~b~0 0) (= correct_version_~j~0 0) (= |correct_version_#in~n| correct_version_~n) (= |correct_version_#in~m| correct_version_~m) (= |correct_version_#in~a| correct_version_~a) (= correct_version_~i~0 0) (= correct_version_~l~0 0))} [137] L38-2-->L38-2: Formula: (or (and (= v_correct_version_~i~0_5 v_correct_version_~i~0_4) (= v_correct_version_~b~0_3 v_correct_version_~b~0_4) (<= v_correct_version_~n_3 v_correct_version_~b~0_4)) (and (= (+ (* v_correct_version_~a_2 (+ (* (- 1) v_correct_version_~i~0_5) v_correct_version_~i~0_4)) v_correct_version_~b~0_4) v_correct_version_~b~0_3) (< v_correct_version_~i~0_5 v_correct_version_~i~0_4) (forall ((v_it_1 Int)) (or (< (+ v_correct_version_~b~0_4 (* v_it_1 v_correct_version_~a_2)) v_correct_version_~n_3) (not (<= 1 v_it_1)) (not (<= (+ v_it_1 v_correct_version_~i~0_5 1) v_correct_version_~i~0_4)))) (< v_correct_version_~b~0_4 v_correct_version_~n_3))) InVars {correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_5, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_4} OutVars{correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_4, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_3} AuxVars[] AssignedVars[correct_version_~b~0, correct_version_~i~0] {2421#(and (= correct_version_~j~0 0) (= |correct_version_#in~n| correct_version_~n) (= |correct_version_#in~m| correct_version_~m) (= |correct_version_#in~a| correct_version_~a) (or (and (= correct_version_~b~0 0) (<= correct_version_~n 0) (= correct_version_~i~0 0)) (and (= (* correct_version_~i~0 correct_version_~a) correct_version_~b~0) (< 0 correct_version_~n) (< 0 correct_version_~i~0) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 correct_version_~a) correct_version_~n) (not (<= 1 v_it_1)))))) (= correct_version_~l~0 0))} is VALID [2022-04-07 17:53:57,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {2421#(and (= correct_version_~j~0 0) (= |correct_version_#in~n| correct_version_~n) (= |correct_version_#in~m| correct_version_~m) (= |correct_version_#in~a| correct_version_~a) (or (and (= correct_version_~b~0 0) (<= correct_version_~n 0) (= correct_version_~i~0 0)) (and (= (* correct_version_~i~0 correct_version_~a) correct_version_~b~0) (< 0 correct_version_~n) (< 0 correct_version_~i~0) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 correct_version_~a) correct_version_~n) (not (<= 1 v_it_1)))))) (= correct_version_~l~0 0))} [136] L38-2-->L44-1: Formula: (not (< v_correct_version_~b~0_2 v_correct_version_~n_2)) InVars {correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} OutVars{correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} AuxVars[] AssignedVars[] {2425#(and (= correct_version_~j~0 0) (or (and (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 correct_version_~a) |correct_version_#in~n|))) (not (< (* correct_version_~i~0 correct_version_~a) |correct_version_#in~n|)) (< 0 |correct_version_#in~n|)) (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0))) (= |correct_version_#in~m| correct_version_~m) (= |correct_version_#in~a| correct_version_~a) (= correct_version_~l~0 0))} is VALID [2022-04-07 17:53:57,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {2425#(and (= correct_version_~j~0 0) (or (and (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 correct_version_~a) |correct_version_#in~n|))) (not (< (* correct_version_~i~0 correct_version_~a) |correct_version_#in~n|)) (< 0 |correct_version_#in~n|)) (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0))) (= |correct_version_#in~m| correct_version_~m) (= |correct_version_#in~a| correct_version_~a) (= correct_version_~l~0 0))} [145] L44-1-->L44-1: Formula: (or (and (<= v_correct_version_~m_3 v_correct_version_~l~0_4) (= v_correct_version_~l~0_4 v_correct_version_~l~0_3) (= v_correct_version_~j~0_4 v_correct_version_~j~0_3)) (and (= (+ (* (+ (* (- 1) v_correct_version_~j~0_4) v_correct_version_~j~0_3) v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~l~0_3) (< v_correct_version_~j~0_4 v_correct_version_~j~0_3) (< v_correct_version_~l~0_4 v_correct_version_~m_3) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 v_correct_version_~j~0_4 1) v_correct_version_~j~0_3)) (< (+ (* v_it_2 v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~m_3))))) InVars {correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_4, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_4} OutVars{correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_3, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_3} AuxVars[] AssignedVars[correct_version_~l~0, correct_version_~j~0] {2429#(and (= |correct_version_#in~m| correct_version_~m) (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (not (<= 1 v_it_2)) (< (* v_it_2 |correct_version_#in~a|) correct_version_~m))) (< 0 correct_version_~j~0) (= correct_version_~l~0 (* correct_version_~j~0 |correct_version_#in~a|)) (< 0 correct_version_~m)) (and (= correct_version_~j~0 0) (= correct_version_~l~0 0) (<= correct_version_~m 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|))))} is VALID [2022-04-07 17:53:57,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {2429#(and (= |correct_version_#in~m| correct_version_~m) (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (not (<= 1 v_it_2)) (< (* v_it_2 |correct_version_#in~a|) correct_version_~m))) (< 0 correct_version_~j~0) (= correct_version_~l~0 (* correct_version_~j~0 |correct_version_#in~a|)) (< 0 correct_version_~m)) (and (= correct_version_~j~0 0) (= correct_version_~l~0 0) (<= correct_version_~m 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|))))} [144] L44-1-->L44-2: Formula: (not (< v_correct_version_~l~0_2 v_correct_version_~m_2)) InVars {correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} OutVars{correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} AuxVars[] AssignedVars[] {2433#(and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|))))} is VALID [2022-04-07 17:53:57,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {2433#(and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|))))} [152] L44-2-->L52-2: Formula: (and (= v_correct_version_~x~0_4 0) (= v_correct_version_~y~0_4 0)) InVars {} OutVars{correct_version_~y~0=v_correct_version_~y~0_4, correct_version_~x~0=v_correct_version_~x~0_4} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] {2437#(and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (= correct_version_~x~0 0) (= correct_version_~y~0 0) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|))))} is VALID [2022-04-07 17:53:57,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {2437#(and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (= correct_version_~x~0 0) (= correct_version_~y~0 0) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|))))} [158] L52-2-->L52-2: Formula: (or (and (< v_correct_version_~x~0_3 v_correct_version_~x~0_2) (= (+ (* v_correct_version_~j~0_2 v_correct_version_~x~0_2) v_correct_version_~y~0_2) (+ v_correct_version_~y~0_1 (* v_correct_version_~j~0_2 v_correct_version_~x~0_3))) (< v_correct_version_~x~0_2 (+ v_correct_version_~i~0_3 1))) (and (= v_correct_version_~y~0_2 v_correct_version_~y~0_1) (= v_correct_version_~x~0_3 v_correct_version_~x~0_2) (<= v_correct_version_~i~0_3 v_correct_version_~x~0_3))) InVars {correct_version_~y~0=v_correct_version_~y~0_2, correct_version_~x~0=v_correct_version_~x~0_3, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} OutVars{correct_version_~y~0=v_correct_version_~y~0_1, correct_version_~x~0=v_correct_version_~x~0_2, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] {2441#(and (exists ((correct_version_~j~0 Int)) (and (or (and (<= correct_version_~i~0 0) (= correct_version_~x~0 0) (= correct_version_~y~0 0)) (and (< correct_version_~x~0 (+ correct_version_~i~0 1)) (< 0 correct_version_~x~0) (= correct_version_~y~0 (* correct_version_~j~0 correct_version_~x~0)))) (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|))))} is VALID [2022-04-07 17:53:59,271 WARN L290 TraceCheckUtils]: 15: Hoare triple {2441#(and (exists ((correct_version_~j~0 Int)) (and (or (and (<= correct_version_~i~0 0) (= correct_version_~x~0 0) (= correct_version_~y~0 0)) (and (< correct_version_~x~0 (+ correct_version_~i~0 1)) (< 0 correct_version_~x~0) (= correct_version_~y~0 (* correct_version_~j~0 correct_version_~x~0)))) (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|))))} [157] L52-2-->L52-3: Formula: (not (< v_correct_version_~x~0_1 v_correct_version_~i~0_1)) InVars {correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} OutVars{correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} AuxVars[] AssignedVars[] {2445#(exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (or (and (= correct_version_~j~0 0) (= correct_version_~y~0 0)) (and (< (div correct_version_~y~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (< 0 (div correct_version_~y~0 correct_version_~j~0)) (not (= correct_version_~j~0 0)) (= (mod correct_version_~y~0 correct_version_~j~0) 0) (not (< (div correct_version_~y~0 correct_version_~j~0) correct_version_~i~0))) (and (not (< 0 correct_version_~i~0)) (= correct_version_~y~0 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|)))))} is UNKNOWN [2022-04-07 17:54:00,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {2445#(exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (or (and (= correct_version_~j~0 0) (= correct_version_~y~0 0)) (and (< (div correct_version_~y~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (< 0 (div correct_version_~y~0 correct_version_~j~0)) (not (= correct_version_~j~0 0)) (= (mod correct_version_~y~0 correct_version_~j~0) 0) (not (< (div correct_version_~y~0 correct_version_~j~0) correct_version_~i~0))) (and (not (< 0 correct_version_~i~0)) (= correct_version_~y~0 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|)))))} [160] L52-3-->correct_versionFINAL: Formula: (= |v_correct_version_#res_1| v_correct_version_~y~0_3) InVars {correct_version_~y~0=v_correct_version_~y~0_3} OutVars{correct_version_#res=|v_correct_version_#res_1|, correct_version_~y~0=v_correct_version_~y~0_3} AuxVars[] AssignedVars[correct_version_#res] {2449#(exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (or (and (< (div |correct_version_#res| correct_version_~j~0) (+ correct_version_~i~0 1)) (not (< (div |correct_version_#res| correct_version_~j~0) correct_version_~i~0)) (not (= correct_version_~j~0 0)) (< 0 (div |correct_version_#res| correct_version_~j~0)) (= (mod |correct_version_#res| correct_version_~j~0) 0)) (and (= correct_version_~j~0 0) (= |correct_version_#res| 0)) (and (not (< 0 correct_version_~i~0)) (= |correct_version_#res| 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|)))))} is VALID [2022-04-07 17:54:01,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {2449#(exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (or (and (< (div |correct_version_#res| correct_version_~j~0) (+ correct_version_~i~0 1)) (not (< (div |correct_version_#res| correct_version_~j~0) correct_version_~i~0)) (not (= correct_version_~j~0 0)) (< 0 (div |correct_version_#res| correct_version_~j~0)) (= (mod |correct_version_#res| correct_version_~j~0) 0)) (and (= correct_version_~j~0 0) (= |correct_version_#res| 0)) (and (not (< 0 correct_version_~i~0)) (= |correct_version_#res| 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|)))))} [164] correct_versionFINAL-->correct_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2449#(exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (or (and (< (div |correct_version_#res| correct_version_~j~0) (+ correct_version_~i~0 1)) (not (< (div |correct_version_#res| correct_version_~j~0) correct_version_~i~0)) (not (= correct_version_~j~0 0)) (< 0 (div |correct_version_#res| correct_version_~j~0)) (= (mod |correct_version_#res| correct_version_~j~0) 0)) (and (= correct_version_~j~0 0) (= |correct_version_#res| 0)) (and (not (< 0 correct_version_~i~0)) (= |correct_version_#res| 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|)))))} is VALID [2022-04-07 17:54:01,093 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2449#(exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (or (and (< (div |correct_version_#res| correct_version_~j~0) (+ correct_version_~i~0 1)) (not (< (div |correct_version_#res| correct_version_~j~0) correct_version_~i~0)) (not (= correct_version_~j~0 0)) (< 0 (div |correct_version_#res| correct_version_~j~0)) (= (mod |correct_version_#res| correct_version_~j~0) 0)) (and (= correct_version_~j~0 0) (= |correct_version_#res| 0)) (and (not (< 0 correct_version_~i~0)) (= |correct_version_#res| 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|)))))} {2410#(and (<= 1 main_~n~0) (<= 1 main_~m~0) (<= 1 main_~a~0))} [170] correct_versionEXIT-->L104-1: AOR: Formula: (= |v_main_#t~ret8_4| |v_correct_version_#resOutParam_1|) InVars {correct_version_#res=|v_correct_version_#resOutParam_1|} OutVars{main_#t~ret8=|v_main_#t~ret8_4|} AuxVars[] AssignedVars[main_#t~ret8, correct_version_#res] LVA: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {2456#(and (<= 1 main_~n~0) (<= 1 main_~m~0) (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (< (div |main_#t~ret8| correct_version_~j~0) (+ correct_version_~i~0 1)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (= (mod |main_#t~ret8| correct_version_~j~0) 0) (<= correct_version_~i~0 (div |main_#t~ret8| correct_version_~j~0)) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0))))))} is VALID [2022-04-07 17:54:03,098 WARN L290 TraceCheckUtils]: 19: Hoare triple {2456#(and (<= 1 main_~n~0) (<= 1 main_~m~0) (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (< (div |main_#t~ret8| correct_version_~j~0) (+ correct_version_~i~0 1)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (= (mod |main_#t~ret8| correct_version_~j~0) 0) (<= correct_version_~i~0 (div |main_#t~ret8| correct_version_~j~0)) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0))))))} [130] L104-1-->L105: Formula: (and (<= |v_main_#t~ret8_3| 2147483647) (= |v_main_#t~ret8_3| v_main_~n_stones1~0_4) (<= 0 (+ |v_main_#t~ret8_3| 2147483648))) InVars {main_#t~ret8=|v_main_#t~ret8_3|} OutVars{main_~n_stones1~0=v_main_~n_stones1~0_4} AuxVars[] AssignedVars[main_#t~ret8, main_~n_stones1~0] {2460#(and (<= 1 main_~n~0) (<= 1 main_~m~0) (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (< (div main_~n_stones1~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (<= correct_version_~i~0 (div main_~n_stones1~0 correct_version_~j~0)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (= (mod main_~n_stones1~0 correct_version_~j~0) 0) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0))))))} is UNKNOWN [2022-04-07 17:54:03,099 INFO L272 TraceCheckUtils]: 20: Hoare triple {2460#(and (<= 1 main_~n~0) (<= 1 main_~m~0) (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (< (div main_~n_stones1~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (<= correct_version_~i~0 (div main_~n_stones1~0 correct_version_~j~0)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (= (mod main_~n_stones1~0 correct_version_~j~0) 0) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0))))))} [134] L105-->student_versionENTRY: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {2387#true} is VALID [2022-04-07 17:54:03,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {2387#true} [142] student_versionENTRY-->L65-2: Formula: (and (= v_student_version_~b~1_3 0) (= v_student_version_~m_3 |v_student_version_#in~m_1|) (= v_student_version_~a_3 |v_student_version_#in~a_1|) (= v_student_version_~n_2 |v_student_version_#in~n_1|) (= v_student_version_~j~1_3 0) (= v_student_version_~l~1_4 0) (= v_student_version_~i~1_4 0)) InVars {student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_#in~a=|v_student_version_#in~a_1|} OutVars{student_version_~i~1=v_student_version_~i~1_4, student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_~a=v_student_version_~a_3, student_version_~j~1=v_student_version_~j~1_3, student_version_~l~1=v_student_version_~l~1_4, student_version_~b~1=v_student_version_~b~1_3, student_version_~n=v_student_version_~n_2, student_version_#in~a=|v_student_version_#in~a_1|, student_version_~m=v_student_version_~m_3} AuxVars[] AssignedVars[student_version_~i~1, student_version_~a, student_version_~j~1, student_version_~l~1, student_version_~b~1, student_version_~n, student_version_~m] {2467#(and (= |student_version_#in~a| student_version_~a) (= student_version_~l~1 0) (= student_version_~i~1 0) (= |student_version_#in~m| student_version_~m) (= student_version_~j~1 0) (= |student_version_#in~n| student_version_~n) (= student_version_~b~1 0))} is VALID [2022-04-07 17:54:03,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {2467#(and (= |student_version_#in~a| student_version_~a) (= student_version_~l~1 0) (= student_version_~i~1 0) (= |student_version_#in~m| student_version_~m) (= student_version_~j~1 0) (= |student_version_#in~n| student_version_~n) (= student_version_~b~1 0))} [151] L65-2-->L65-2: Formula: (or (and (<= v_student_version_~n_1 v_student_version_~b~1_2) (= v_student_version_~b~1_2 v_student_version_~b~1_1) (= v_student_version_~i~1_2 v_student_version_~i~1_1)) (and (< v_student_version_~i~1_2 v_student_version_~i~1_1) (= (+ v_student_version_~b~1_2 (* (+ v_student_version_~i~1_1 (* (- 1) v_student_version_~i~1_2)) v_student_version_~a_1)) v_student_version_~b~1_1) (< v_student_version_~b~1_2 v_student_version_~n_1) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 v_student_version_~i~1_2 1) v_student_version_~i~1_1)) (< (+ v_student_version_~b~1_2 (* v_student_version_~a_1 v_it_3)) v_student_version_~n_1))))) InVars {student_version_~i~1=v_student_version_~i~1_2, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_2, student_version_~n=v_student_version_~n_1} OutVars{student_version_~i~1=v_student_version_~i~1_1, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_1, student_version_~n=v_student_version_~n_1} AuxVars[] AssignedVars[student_version_~i~1, student_version_~b~1] {2471#(and (= |student_version_#in~a| student_version_~a) (= student_version_~l~1 0) (= |student_version_#in~m| student_version_~m) (= student_version_~j~1 0) (or (and (= student_version_~i~1 0) (<= student_version_~n 0) (= student_version_~b~1 0)) (and (< 0 student_version_~n) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (not (<= 1 v_it_3)) (< (* v_it_3 student_version_~a) student_version_~n))) (= (* student_version_~i~1 student_version_~a) student_version_~b~1) (< 0 student_version_~i~1))) (= |student_version_#in~n| student_version_~n))} is VALID [2022-04-07 17:54:03,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {2471#(and (= |student_version_#in~a| student_version_~a) (= student_version_~l~1 0) (= |student_version_#in~m| student_version_~m) (= student_version_~j~1 0) (or (and (= student_version_~i~1 0) (<= student_version_~n 0) (= student_version_~b~1 0)) (and (< 0 student_version_~n) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (not (<= 1 v_it_3)) (< (* v_it_3 student_version_~a) student_version_~n))) (= (* student_version_~i~1 student_version_~a) student_version_~b~1) (< 0 student_version_~i~1))) (= |student_version_#in~n| student_version_~n))} [150] L65-2-->L71-1: Formula: (not (< v_student_version_~b~1_4 v_student_version_~n_3)) InVars {student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} OutVars{student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} AuxVars[] AssignedVars[] {2475#(and (= |student_version_#in~a| student_version_~a) (= student_version_~l~1 0) (= |student_version_#in~m| student_version_~m) (= student_version_~j~1 0) (or (and (not (< (* student_version_~i~1 student_version_~a) |student_version_#in~n|)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 student_version_~a) |student_version_#in~n|))) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))))} is VALID [2022-04-07 17:54:03,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {2475#(and (= |student_version_#in~a| student_version_~a) (= student_version_~l~1 0) (= |student_version_#in~m| student_version_~m) (= student_version_~j~1 0) (or (and (not (< (* student_version_~i~1 student_version_~a) |student_version_#in~n|)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 student_version_~a) |student_version_#in~n|))) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))))} [155] L71-1-->L71-1: Formula: (or (and (= v_student_version_~l~1_3 v_student_version_~l~1_2) (<= v_student_version_~m_2 v_student_version_~l~1_3) (= v_student_version_~j~1_2 v_student_version_~j~1_1)) (and (= (+ v_student_version_~l~1_3 (* (+ v_student_version_~j~1_1 (* (- 1) v_student_version_~j~1_2)) v_student_version_~a_2)) v_student_version_~l~1_2) (< v_student_version_~j~1_2 v_student_version_~j~1_1) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 v_student_version_~j~1_2 1) v_student_version_~j~1_1)) (not (<= 1 v_it_4)) (< (+ (* v_student_version_~a_2 v_it_4) v_student_version_~l~1_3) v_student_version_~m_2))) (< v_student_version_~l~1_3 v_student_version_~m_2))) InVars {student_version_~l~1=v_student_version_~l~1_3, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_2, student_version_~m=v_student_version_~m_2} OutVars{student_version_~l~1=v_student_version_~l~1_2, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_1, student_version_~m=v_student_version_~m_2} AuxVars[] AssignedVars[student_version_~j~1, student_version_~l~1] {2479#(and (= |student_version_#in~m| student_version_~m) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (= student_version_~l~1 0) (= student_version_~j~1 0) (<= student_version_~m 0)) (and (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (not (<= 1 v_it_4)) (< (* v_it_4 |student_version_#in~a|) student_version_~m))) (= (* |student_version_#in~a| student_version_~j~1) student_version_~l~1) (< 0 student_version_~j~1) (< 0 student_version_~m))))} is VALID [2022-04-07 17:54:03,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {2479#(and (= |student_version_#in~m| student_version_~m) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (= student_version_~l~1 0) (= student_version_~j~1 0) (<= student_version_~m 0)) (and (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (not (<= 1 v_it_4)) (< (* v_it_4 |student_version_#in~a|) student_version_~m))) (= (* |student_version_#in~a| student_version_~j~1) student_version_~l~1) (< 0 student_version_~j~1) (< 0 student_version_~m))))} [154] L71-1-->L71-2: Formula: (not (< v_student_version_~l~1_1 v_student_version_~m_1)) InVars {student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} OutVars{student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} AuxVars[] AssignedVars[] {2483#(and (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))))} is VALID [2022-04-07 17:54:03,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {2483#(and (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))))} [159] L71-2-->L79-2: Formula: (and (= v_student_version_~y~1_1 0) (= v_student_version_~x~1_1 0)) InVars {} OutVars{student_version_~x~1=v_student_version_~x~1_1, student_version_~y~1=v_student_version_~y~1_1} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {2487#(and (= student_version_~y~1 0) (= student_version_~x~1 0) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))))} is VALID [2022-04-07 17:54:03,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {2487#(and (= student_version_~y~1 0) (= student_version_~x~1 0) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))))} [163] L79-2-->L79-2: Formula: (or (and (= (+ v_student_version_~y~1_2 (* v_student_version_~j~1_4 v_student_version_~x~1_4)) (+ v_student_version_~y~1_3 (* v_student_version_~j~1_4 v_student_version_~x~1_3))) (< v_student_version_~x~1_4 v_student_version_~x~1_3) (< v_student_version_~x~1_3 (+ v_student_version_~i~1_5 1))) (and (= v_student_version_~y~1_3 v_student_version_~y~1_2) (not (< v_student_version_~x~1_4 v_student_version_~i~1_5)) (= v_student_version_~x~1_4 v_student_version_~x~1_3))) InVars {student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_3, student_version_~x~1=v_student_version_~x~1_4, student_version_~j~1=v_student_version_~j~1_4} OutVars{student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_2, student_version_~x~1=v_student_version_~x~1_3, student_version_~j~1=v_student_version_~j~1_4} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {2491#(and (exists ((student_version_~j~1 Int)) (and (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))) (or (and (= student_version_~y~1 0) (not (< 0 student_version_~i~1)) (= student_version_~x~1 0)) (and (= student_version_~y~1 (* student_version_~j~1 student_version_~x~1)) (< student_version_~x~1 (+ student_version_~i~1 1)) (< 0 student_version_~x~1))))) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))))} is VALID [2022-04-07 17:54:05,195 WARN L290 TraceCheckUtils]: 28: Hoare triple {2491#(and (exists ((student_version_~j~1 Int)) (and (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))) (or (and (= student_version_~y~1 0) (not (< 0 student_version_~i~1)) (= student_version_~x~1 0)) (and (= student_version_~y~1 (* student_version_~j~1 student_version_~x~1)) (< student_version_~x~1 (+ student_version_~i~1 1)) (< 0 student_version_~x~1))))) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))))} [162] L79-2-->L79-3: Formula: (not (< v_student_version_~x~1_2 v_student_version_~i~1_3)) InVars {student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} OutVars{student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} AuxVars[] AssignedVars[] {2495#(exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))) (or (and (not (< (div student_version_~y~1 student_version_~j~1) student_version_~i~1)) (not (= student_version_~j~1 0)) (= (mod student_version_~y~1 student_version_~j~1) 0) (< (div student_version_~y~1 student_version_~j~1) (+ student_version_~i~1 1))) (and (= student_version_~y~1 0) (= student_version_~j~1 0)))))} is UNKNOWN [2022-04-07 17:54:07,205 WARN L290 TraceCheckUtils]: 29: Hoare triple {2495#(exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))) (or (and (not (< (div student_version_~y~1 student_version_~j~1) student_version_~i~1)) (not (= student_version_~j~1 0)) (= (mod student_version_~y~1 student_version_~j~1) 0) (< (div student_version_~y~1 student_version_~j~1) (+ student_version_~i~1 1))) (and (= student_version_~y~1 0) (= student_version_~j~1 0)))))} [165] L79-3-->student_versionFINAL: Formula: (= v_student_version_~y~1_4 |v_student_version_#res_1|) InVars {student_version_~y~1=v_student_version_~y~1_4} OutVars{student_version_#res=|v_student_version_#res_1|, student_version_~y~1=v_student_version_~y~1_4} AuxVars[] AssignedVars[student_version_#res] {2499#(exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (or (and (< (div |student_version_#res| student_version_~j~1) (+ student_version_~i~1 1)) (not (= student_version_~j~1 0)) (= (mod |student_version_#res| student_version_~j~1) 0) (not (< (div |student_version_#res| student_version_~j~1) student_version_~i~1))) (and (= |student_version_#res| 0) (= student_version_~j~1 0))) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|)))))} is UNKNOWN [2022-04-07 17:54:07,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {2499#(exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (or (and (< (div |student_version_#res| student_version_~j~1) (+ student_version_~i~1 1)) (not (= student_version_~j~1 0)) (= (mod |student_version_#res| student_version_~j~1) 0) (not (< (div |student_version_#res| student_version_~j~1) student_version_~i~1))) (and (= |student_version_#res| 0) (= student_version_~j~1 0))) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|)))))} [166] student_versionFINAL-->student_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2499#(exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (or (and (< (div |student_version_#res| student_version_~j~1) (+ student_version_~i~1 1)) (not (= student_version_~j~1 0)) (= (mod |student_version_#res| student_version_~j~1) 0) (not (< (div |student_version_#res| student_version_~j~1) student_version_~i~1))) (and (= |student_version_#res| 0) (= student_version_~j~1 0))) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|)))))} is VALID [2022-04-07 17:54:09,447 WARN L284 TraceCheckUtils]: 31: Hoare quadruple {2499#(exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (or (and (< (div |student_version_#res| student_version_~j~1) (+ student_version_~i~1 1)) (not (= student_version_~j~1 0)) (= (mod |student_version_#res| student_version_~j~1) 0) (not (< (div |student_version_#res| student_version_~j~1) student_version_~i~1))) (and (= |student_version_#res| 0) (= student_version_~j~1 0))) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|)))))} {2460#(and (<= 1 main_~n~0) (<= 1 main_~m~0) (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (< (div main_~n_stones1~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (<= correct_version_~i~0 (div main_~n_stones1~0 correct_version_~j~0)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (= (mod main_~n_stones1~0 correct_version_~j~0) 0) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0))))))} [171] student_versionEXIT-->L105-1: AOR: Formula: (= |v_main_#t~ret9_4| |v_student_version_#resOutParam_1|) InVars {student_version_#res=|v_student_version_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_4|} AuxVars[] AssignedVars[student_version_#res, main_#t~ret9] LVA: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {2506#(exists ((main_~m~0 Int) (main_~n~0 Int) (main_~a~0 Int)) (and (<= 1 main_~n~0) (<= 1 main_~m~0) (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (< (div main_~n_stones1~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (<= correct_version_~i~0 (div main_~n_stones1~0 correct_version_~j~0)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (= (mod main_~n_stones1~0 correct_version_~j~0) 0) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0))))) (exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (not (< (div |main_#t~ret9| student_version_~j~1) student_version_~i~1)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (< (div |main_#t~ret9| student_version_~j~1) (+ student_version_~i~1 1)) (= (mod |main_#t~ret9| student_version_~j~1) 0) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 main_~a~0) main_~m~0))) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (<= main_~m~0 (* main_~a~0 student_version_~j~1)) (< 0 student_version_~i~1)))))} is UNKNOWN [2022-04-07 17:54:11,483 WARN L290 TraceCheckUtils]: 32: Hoare triple {2506#(exists ((main_~m~0 Int) (main_~n~0 Int) (main_~a~0 Int)) (and (<= 1 main_~n~0) (<= 1 main_~m~0) (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (< (div main_~n_stones1~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (<= correct_version_~i~0 (div main_~n_stones1~0 correct_version_~j~0)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (= (mod main_~n_stones1~0 correct_version_~j~0) 0) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0))))) (exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (not (< (div |main_#t~ret9| student_version_~j~1) student_version_~i~1)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (< (div |main_#t~ret9| student_version_~j~1) (+ student_version_~i~1 1)) (= (mod |main_#t~ret9| student_version_~j~1) 0) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 main_~a~0) main_~m~0))) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (<= main_~m~0 (* main_~a~0 student_version_~j~1)) (< 0 student_version_~i~1)))))} [141] L105-1-->L97-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647) (= |v_main_#t~ret9_2| v_main_~n_stones2~0_1)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_~n_stones2~0=v_main_~n_stones2~0_1} AuxVars[] AssignedVars[main_~n_stones2~0, main_#t~ret9] {2510#(exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int) (main_~m~0 Int) (main_~n~0 Int) (main_~a~0 Int) (student_version_~i~1 Int) (student_version_~j~1 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (<= 1 main_~n~0) (< (div main_~n_stones1~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (<= correct_version_~i~0 (div main_~n_stones1~0 correct_version_~j~0)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (= (mod main_~n_stones2~0 student_version_~j~1) 0) (<= 1 main_~m~0) (< (div main_~n_stones2~0 student_version_~j~1) (+ student_version_~i~1 1)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 main_~a~0) main_~m~0))) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (not (< (div main_~n_stones2~0 student_version_~j~1) student_version_~i~1)) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (= (mod main_~n_stones1~0 correct_version_~j~0) 0) (<= main_~m~0 (* main_~a~0 student_version_~j~1)) (< 0 student_version_~i~1) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0)))))} is UNKNOWN [2022-04-07 17:54:13,505 WARN L272 TraceCheckUtils]: 33: Hoare triple {2510#(exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int) (main_~m~0 Int) (main_~n~0 Int) (main_~a~0 Int) (student_version_~i~1 Int) (student_version_~j~1 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (<= 1 main_~n~0) (< (div main_~n_stones1~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (<= correct_version_~i~0 (div main_~n_stones1~0 correct_version_~j~0)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (= (mod main_~n_stones2~0 student_version_~j~1) 0) (<= 1 main_~m~0) (< (div main_~n_stones2~0 student_version_~j~1) (+ student_version_~i~1 1)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 main_~a~0) main_~m~0))) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (not (< (div main_~n_stones2~0 student_version_~j~1) student_version_~i~1)) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (= (mod main_~n_stones1~0 correct_version_~j~0) 0) (<= main_~m~0 (* main_~a~0 student_version_~j~1)) (< 0 student_version_~i~1) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0)))))} [129] L97-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n_stones1~0_5 v_main_~n_stones2~0_4) 1 0)) InVars {main_~n_stones2~0=v_main_~n_stones2~0_4, main_~n_stones1~0=v_main_~n_stones1~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n_stones2~0, main_~n_stones1~0] {2514#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-07 17:54:13,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {2514#(<= 1 |__VERIFIER_assert_#in~cond|)} [133] __VERIFIER_assertENTRY-->L6: 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] {2518#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:54:13,506 INFO L290 TraceCheckUtils]: 35: Hoare triple {2518#(<= 1 __VERIFIER_assert_~cond)} [139] L6-->L7: 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[] {2388#false} is VALID [2022-04-07 17:54:13,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {2388#false} [146] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2388#false} is VALID [2022-04-07 17:54:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:54:13,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:54:47,700 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:55:16,881 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:55:17,583 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:55:18,446 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:55:19,030 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:55:20,327 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:55:23,034 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:55:25,703 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:55:27,210 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:55:29,059 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:55:32,741 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:55:36,442 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:55:37,204 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 17:55:51,559 WARN L804 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2022-04-07 17:58:57,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:58:57,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595345920] [2022-04-07 17:58:57,278 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 17:58:57,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941569420] [2022-04-07 17:58:57,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941569420] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:58:57,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 17:58:57,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2022-04-07 17:58:57,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723560640] [2022-04-07 17:58:57,278 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 17:58:57,279 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-04-07 17:58:57,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:58:57,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:59:12,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 30 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-07 17:59:12,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-07 17:59:12,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:59:12,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-07 17:59:12,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=791, Unknown=17, NotChecked=0, Total=870 [2022-04-07 17:59:12,829 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:59:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:59:26,070 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2022-04-07 17:59:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-07 17:59:26,071 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-04-07 17:59:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:59:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:59:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 71 transitions. [2022-04-07 17:59:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:59:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 71 transitions. [2022-04-07 17:59:26,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 71 transitions. [2022-04-07 17:59:43,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 63 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2022-04-07 17:59:43,812 INFO L225 Difference]: With dead ends: 62 [2022-04-07 17:59:43,812 INFO L226 Difference]: Without dead ends: 58 [2022-04-07 17:59:43,812 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 53.9s TimeCoverageRelationStatistics Valid=66, Invalid=846, Unknown=18, NotChecked=0, Total=930 [2022-04-07 17:59:43,813 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:59:43,813 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 380 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 137 Unchecked, 0.0s Time] [2022-04-07 17:59:43,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-07 17:59:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-07 17:59:43,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:59:43,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 48 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:59:43,817 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 48 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:59:43,817 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 48 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:59:43,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:59:43,819 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-07 17:59:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-07 17:59:43,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:59:43,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:59:43,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 48 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 58 states. [2022-04-07 17:59:43,820 INFO L87 Difference]: Start difference. First operand has 58 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 48 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 58 states. [2022-04-07 17:59:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:59:43,822 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-07 17:59:43,822 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-07 17:59:43,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:59:43,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:59:43,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:59:43,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:59:43,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 48 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-07 17:59:43,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2022-04-07 17:59:43,824 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 37 [2022-04-07 17:59:43,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:59:43,824 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2022-04-07 17:59:43,825 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:59:43,825 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-07 17:59:43,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-07 17:59:43,825 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:59:43,825 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-04-07 17:59:43,846 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-07 17:59:44,035 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:59:44,036 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:59:44,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:59:44,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1189593605, now seen corresponding path program 2 times [2022-04-07 17:59:44,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:59:44,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254141581] [2022-04-07 17:59:44,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:59:44,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:59:44,056 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 17:59:44,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [321213424] [2022-04-07 17:59:44,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 17:59:44,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:59:44,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:59:44,057 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-07 17:59:44,062 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-07 17:59:44,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 17:59:44,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 17:59:44,646 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-07 17:59:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-07 17:59:46,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:59:56,111 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 18:00:03,488 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 18:00:09,552 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 18:01:24,378 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 18:01:33,564 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 18:01:40,373 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 18:01:46,837 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 18:03:37,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {2783#true} [120] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2783#true} is VALID [2022-04-07 18:03:37,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {2783#true} [122] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 16) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2783#true} is VALID [2022-04-07 18:03:37,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {2783#true} [125] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2783#true} is VALID [2022-04-07 18:03:37,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2783#true} {2783#true} [167] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2783#true} is VALID [2022-04-07 18:03:37,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {2783#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2783#true} is VALID [2022-04-07 18:03:37,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {2783#true} [124] mainENTRY-->L97: Formula: (and (= v_main_~n_stones2~0_3 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~n_stones1~0_2 v_main_~n_stones2~0_3) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~m~0_2 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~n~0=v_main_~n~0_2, main_~m~0=v_main_~m~0_2, main_~n_stones2~0=v_main_~n_stones2~0_3, main_~n_stones1~0=v_main_~n_stones1~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_#t~nondet7, main_#t~nondet6, main_~m~0, main_~n~0, main_~n_stones2~0, main_~n_stones1~0, main_~a~0] {2783#true} is VALID [2022-04-07 18:03:37,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {2783#true} [126] L97-->L104: Formula: (and (<= 1 v_main_~m~0_3) (<= 1 v_main_~n~0_3) (<= v_main_~a~0_3 109) (<= v_main_~m~0_3 109) (<= 1 v_main_~a~0_3) (<= v_main_~n~0_3 109)) InVars {main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} OutVars{main_~n~0=v_main_~n~0_3, main_~m~0=v_main_~m~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {2806#(and (<= 1 main_~n~0) (<= 1 main_~m~0) (<= 1 main_~a~0))} is VALID [2022-04-07 18:03:37,278 INFO L272 TraceCheckUtils]: 7: Hoare triple {2806#(and (<= 1 main_~n~0) (<= 1 main_~m~0) (<= 1 main_~a~0))} [128] L104-->correct_versionENTRY: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {2783#true} is VALID [2022-04-07 18:03:37,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {2783#true} [131] correct_versionENTRY-->L38-2: Formula: (and (= |v_correct_version_#in~m_1| v_correct_version_~m_1) (= |v_correct_version_#in~a_1| v_correct_version_~a_1) (= v_correct_version_~i~0_2 0) (= v_correct_version_~l~0_1 0) (= |v_correct_version_#in~n_1| v_correct_version_~n_1) (= v_correct_version_~b~0_1 0) (= v_correct_version_~j~0_1 0)) InVars {correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_#in~n=|v_correct_version_#in~n_1|} OutVars{correct_version_~n=v_correct_version_~n_1, correct_version_~m=v_correct_version_~m_1, correct_version_#in~m=|v_correct_version_#in~m_1|, correct_version_~b~0=v_correct_version_~b~0_1, correct_version_#in~n=|v_correct_version_#in~n_1|, correct_version_#in~a=|v_correct_version_#in~a_1|, correct_version_~i~0=v_correct_version_~i~0_2, correct_version_~l~0=v_correct_version_~l~0_1, correct_version_~a=v_correct_version_~a_1, correct_version_~j~0=v_correct_version_~j~0_1} AuxVars[] AssignedVars[correct_version_~n, correct_version_~m, correct_version_~b~0, correct_version_~i~0, correct_version_~l~0, correct_version_~a, correct_version_~j~0] {2813#(and (= correct_version_~b~0 0) (= correct_version_~j~0 0) (= |correct_version_#in~n| correct_version_~n) (= |correct_version_#in~m| correct_version_~m) (= |correct_version_#in~a| correct_version_~a) (= correct_version_~i~0 0) (= correct_version_~l~0 0))} is VALID [2022-04-07 18:03:37,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {2813#(and (= correct_version_~b~0 0) (= correct_version_~j~0 0) (= |correct_version_#in~n| correct_version_~n) (= |correct_version_#in~m| correct_version_~m) (= |correct_version_#in~a| correct_version_~a) (= correct_version_~i~0 0) (= correct_version_~l~0 0))} [137] L38-2-->L38-2: Formula: (or (and (= v_correct_version_~i~0_5 v_correct_version_~i~0_4) (= v_correct_version_~b~0_3 v_correct_version_~b~0_4) (<= v_correct_version_~n_3 v_correct_version_~b~0_4)) (and (= (+ (* v_correct_version_~a_2 (+ (* (- 1) v_correct_version_~i~0_5) v_correct_version_~i~0_4)) v_correct_version_~b~0_4) v_correct_version_~b~0_3) (< v_correct_version_~i~0_5 v_correct_version_~i~0_4) (forall ((v_it_1 Int)) (or (< (+ v_correct_version_~b~0_4 (* v_it_1 v_correct_version_~a_2)) v_correct_version_~n_3) (not (<= 1 v_it_1)) (not (<= (+ v_it_1 v_correct_version_~i~0_5 1) v_correct_version_~i~0_4)))) (< v_correct_version_~b~0_4 v_correct_version_~n_3))) InVars {correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_5, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_4} OutVars{correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_4, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_3} AuxVars[] AssignedVars[correct_version_~b~0, correct_version_~i~0] {2817#(and (= correct_version_~j~0 0) (= |correct_version_#in~n| correct_version_~n) (= |correct_version_#in~m| correct_version_~m) (= |correct_version_#in~a| correct_version_~a) (or (and (= correct_version_~b~0 0) (<= correct_version_~n 0) (= correct_version_~i~0 0)) (and (= (* correct_version_~i~0 correct_version_~a) correct_version_~b~0) (< 0 correct_version_~n) (< 0 correct_version_~i~0) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 correct_version_~a) correct_version_~n) (not (<= 1 v_it_1)))))) (= correct_version_~l~0 0))} is VALID [2022-04-07 18:03:37,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {2817#(and (= correct_version_~j~0 0) (= |correct_version_#in~n| correct_version_~n) (= |correct_version_#in~m| correct_version_~m) (= |correct_version_#in~a| correct_version_~a) (or (and (= correct_version_~b~0 0) (<= correct_version_~n 0) (= correct_version_~i~0 0)) (and (= (* correct_version_~i~0 correct_version_~a) correct_version_~b~0) (< 0 correct_version_~n) (< 0 correct_version_~i~0) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 correct_version_~a) correct_version_~n) (not (<= 1 v_it_1)))))) (= correct_version_~l~0 0))} [136] L38-2-->L44-1: Formula: (not (< v_correct_version_~b~0_2 v_correct_version_~n_2)) InVars {correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} OutVars{correct_version_~n=v_correct_version_~n_2, correct_version_~b~0=v_correct_version_~b~0_2} AuxVars[] AssignedVars[] {2821#(and (= correct_version_~j~0 0) (or (and (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 correct_version_~a) |correct_version_#in~n|))) (not (< (* correct_version_~i~0 correct_version_~a) |correct_version_#in~n|)) (< 0 |correct_version_#in~n|)) (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0))) (= |correct_version_#in~m| correct_version_~m) (= |correct_version_#in~a| correct_version_~a) (= correct_version_~l~0 0))} is VALID [2022-04-07 18:03:37,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {2821#(and (= correct_version_~j~0 0) (or (and (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 correct_version_~a) |correct_version_#in~n|))) (not (< (* correct_version_~i~0 correct_version_~a) |correct_version_#in~n|)) (< 0 |correct_version_#in~n|)) (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0))) (= |correct_version_#in~m| correct_version_~m) (= |correct_version_#in~a| correct_version_~a) (= correct_version_~l~0 0))} [145] L44-1-->L44-1: Formula: (or (and (<= v_correct_version_~m_3 v_correct_version_~l~0_4) (= v_correct_version_~l~0_4 v_correct_version_~l~0_3) (= v_correct_version_~j~0_4 v_correct_version_~j~0_3)) (and (= (+ (* (+ (* (- 1) v_correct_version_~j~0_4) v_correct_version_~j~0_3) v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~l~0_3) (< v_correct_version_~j~0_4 v_correct_version_~j~0_3) (< v_correct_version_~l~0_4 v_correct_version_~m_3) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 v_correct_version_~j~0_4 1) v_correct_version_~j~0_3)) (< (+ (* v_it_2 v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~m_3))))) InVars {correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_4, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_4} OutVars{correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_3, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_3} AuxVars[] AssignedVars[correct_version_~l~0, correct_version_~j~0] {2825#(and (= |correct_version_#in~m| correct_version_~m) (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (not (<= 1 v_it_2)) (< (* v_it_2 |correct_version_#in~a|) correct_version_~m))) (< 0 correct_version_~j~0) (= correct_version_~l~0 (* correct_version_~j~0 |correct_version_#in~a|)) (< 0 correct_version_~m)) (and (= correct_version_~j~0 0) (= correct_version_~l~0 0) (<= correct_version_~m 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|))))} is VALID [2022-04-07 18:03:37,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {2825#(and (= |correct_version_#in~m| correct_version_~m) (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (not (<= 1 v_it_2)) (< (* v_it_2 |correct_version_#in~a|) correct_version_~m))) (< 0 correct_version_~j~0) (= correct_version_~l~0 (* correct_version_~j~0 |correct_version_#in~a|)) (< 0 correct_version_~m)) (and (= correct_version_~j~0 0) (= correct_version_~l~0 0) (<= correct_version_~m 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|))))} [144] L44-1-->L44-2: Formula: (not (< v_correct_version_~l~0_2 v_correct_version_~m_2)) InVars {correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} OutVars{correct_version_~m=v_correct_version_~m_2, correct_version_~l~0=v_correct_version_~l~0_2} AuxVars[] AssignedVars[] {2829#(and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|))))} is VALID [2022-04-07 18:03:37,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {2829#(and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|))))} [152] L44-2-->L52-2: Formula: (and (= v_correct_version_~x~0_4 0) (= v_correct_version_~y~0_4 0)) InVars {} OutVars{correct_version_~y~0=v_correct_version_~y~0_4, correct_version_~x~0=v_correct_version_~x~0_4} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] {2833#(and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (= correct_version_~x~0 0) (= correct_version_~y~0 0) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|))))} is VALID [2022-04-07 18:03:37,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {2833#(and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (= correct_version_~x~0 0) (= correct_version_~y~0 0) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|))))} [158] L52-2-->L52-2: Formula: (or (and (< v_correct_version_~x~0_3 v_correct_version_~x~0_2) (= (+ (* v_correct_version_~j~0_2 v_correct_version_~x~0_2) v_correct_version_~y~0_2) (+ v_correct_version_~y~0_1 (* v_correct_version_~j~0_2 v_correct_version_~x~0_3))) (< v_correct_version_~x~0_2 (+ v_correct_version_~i~0_3 1))) (and (= v_correct_version_~y~0_2 v_correct_version_~y~0_1) (= v_correct_version_~x~0_3 v_correct_version_~x~0_2) (<= v_correct_version_~i~0_3 v_correct_version_~x~0_3))) InVars {correct_version_~y~0=v_correct_version_~y~0_2, correct_version_~x~0=v_correct_version_~x~0_3, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} OutVars{correct_version_~y~0=v_correct_version_~y~0_1, correct_version_~x~0=v_correct_version_~x~0_2, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] {2837#(and (exists ((correct_version_~j~0 Int)) (and (or (and (<= correct_version_~i~0 0) (= correct_version_~x~0 0) (= correct_version_~y~0 0)) (and (< correct_version_~x~0 (+ correct_version_~i~0 1)) (< 0 correct_version_~x~0) (= correct_version_~y~0 (* correct_version_~j~0 correct_version_~x~0)))) (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|))))} is VALID [2022-04-07 18:03:39,388 WARN L290 TraceCheckUtils]: 15: Hoare triple {2837#(and (exists ((correct_version_~j~0 Int)) (and (or (and (<= correct_version_~i~0 0) (= correct_version_~x~0 0) (= correct_version_~y~0 0)) (and (< correct_version_~x~0 (+ correct_version_~i~0 1)) (< 0 correct_version_~x~0) (= correct_version_~y~0 (* correct_version_~j~0 correct_version_~x~0)))) (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|))))} [157] L52-2-->L52-3: Formula: (not (< v_correct_version_~x~0_1 v_correct_version_~i~0_1)) InVars {correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} OutVars{correct_version_~i~0=v_correct_version_~i~0_1, correct_version_~x~0=v_correct_version_~x~0_1} AuxVars[] AssignedVars[] {2841#(exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (or (and (= correct_version_~j~0 0) (= correct_version_~y~0 0)) (and (< (div correct_version_~y~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (< 0 (div correct_version_~y~0 correct_version_~j~0)) (not (= correct_version_~j~0 0)) (= (mod correct_version_~y~0 correct_version_~j~0) 0) (not (< (div correct_version_~y~0 correct_version_~j~0) correct_version_~i~0))) (and (not (< 0 correct_version_~i~0)) (= correct_version_~y~0 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|)))))} is UNKNOWN [2022-04-07 18:03:41,406 WARN L290 TraceCheckUtils]: 16: Hoare triple {2841#(exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (or (and (= correct_version_~j~0 0) (= correct_version_~y~0 0)) (and (< (div correct_version_~y~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (< 0 (div correct_version_~y~0 correct_version_~j~0)) (not (= correct_version_~j~0 0)) (= (mod correct_version_~y~0 correct_version_~j~0) 0) (not (< (div correct_version_~y~0 correct_version_~j~0) correct_version_~i~0))) (and (not (< 0 correct_version_~i~0)) (= correct_version_~y~0 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|)))))} [160] L52-3-->correct_versionFINAL: Formula: (= |v_correct_version_#res_1| v_correct_version_~y~0_3) InVars {correct_version_~y~0=v_correct_version_~y~0_3} OutVars{correct_version_#res=|v_correct_version_#res_1|, correct_version_~y~0=v_correct_version_~y~0_3} AuxVars[] AssignedVars[correct_version_#res] {2845#(exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (or (and (< (div |correct_version_#res| correct_version_~j~0) (+ correct_version_~i~0 1)) (not (< (div |correct_version_#res| correct_version_~j~0) correct_version_~i~0)) (not (= correct_version_~j~0 0)) (< 0 (div |correct_version_#res| correct_version_~j~0)) (= (mod |correct_version_#res| correct_version_~j~0) 0)) (and (= correct_version_~j~0 0) (= |correct_version_#res| 0)) (and (not (< 0 correct_version_~i~0)) (= |correct_version_#res| 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|)))))} is UNKNOWN [2022-04-07 18:03:43,422 WARN L290 TraceCheckUtils]: 17: Hoare triple {2845#(exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (or (and (< (div |correct_version_#res| correct_version_~j~0) (+ correct_version_~i~0 1)) (not (< (div |correct_version_#res| correct_version_~j~0) correct_version_~i~0)) (not (= correct_version_~j~0 0)) (< 0 (div |correct_version_#res| correct_version_~j~0)) (= (mod |correct_version_#res| correct_version_~j~0) 0)) (and (= correct_version_~j~0 0) (= |correct_version_#res| 0)) (and (not (< 0 correct_version_~i~0)) (= |correct_version_#res| 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|)))))} [164] correct_versionFINAL-->correct_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2845#(exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (or (and (< (div |correct_version_#res| correct_version_~j~0) (+ correct_version_~i~0 1)) (not (< (div |correct_version_#res| correct_version_~j~0) correct_version_~i~0)) (not (= correct_version_~j~0 0)) (< 0 (div |correct_version_#res| correct_version_~j~0)) (= (mod |correct_version_#res| correct_version_~j~0) 0)) (and (= correct_version_~j~0 0) (= |correct_version_#res| 0)) (and (not (< 0 correct_version_~i~0)) (= |correct_version_#res| 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|)))))} is UNKNOWN [2022-04-07 18:03:45,435 WARN L284 TraceCheckUtils]: 18: Hoare quadruple {2845#(exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 |correct_version_#in~a|) |correct_version_#in~m|))) (not (< (* correct_version_~j~0 |correct_version_#in~a|) |correct_version_#in~m|)) (< 0 correct_version_~j~0)) (and (= correct_version_~j~0 0) (<= |correct_version_#in~m| 0))) (or (and (< (div |correct_version_#res| correct_version_~j~0) (+ correct_version_~i~0 1)) (not (< (div |correct_version_#res| correct_version_~j~0) correct_version_~i~0)) (not (= correct_version_~j~0 0)) (< 0 (div |correct_version_#res| correct_version_~j~0)) (= (mod |correct_version_#res| correct_version_~j~0) 0)) (and (= correct_version_~j~0 0) (= |correct_version_#res| 0)) (and (not (< 0 correct_version_~i~0)) (= |correct_version_#res| 0))) (or (and (<= |correct_version_#in~n| 0) (= correct_version_~i~0 0)) (and (not (< (* correct_version_~i~0 |correct_version_#in~a|) |correct_version_#in~n|)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 |correct_version_#in~a|) |correct_version_#in~n|))) (< 0 |correct_version_#in~n|)))))} {2806#(and (<= 1 main_~n~0) (<= 1 main_~m~0) (<= 1 main_~a~0))} [170] correct_versionEXIT-->L104-1: AOR: Formula: (= |v_main_#t~ret8_4| |v_correct_version_#resOutParam_1|) InVars {correct_version_#res=|v_correct_version_#resOutParam_1|} OutVars{main_#t~ret8=|v_main_#t~ret8_4|} AuxVars[] AssignedVars[main_#t~ret8, correct_version_#res] LVA: Formula: (and (= v_main_~n~0_6 |v_correct_version_#in~nInParam_1|) (= v_main_~a~0_6 |v_correct_version_#in~aInParam_1|) (= v_main_~m~0_6 |v_correct_version_#in~mInParam_1|)) InVars {main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6, main_~a~0=v_main_~a~0_6} OutVars{correct_version_#in~a=|v_correct_version_#in~aInParam_1|, correct_version_#in~m=|v_correct_version_#in~mInParam_1|, correct_version_#in~n=|v_correct_version_#in~nInParam_1|} AuxVars[] AssignedVars[main_~m~0, correct_version_#in~m, correct_version_#in~n, correct_version_#in~a, main_~n~0, main_~a~0] {2852#(and (<= 1 main_~n~0) (<= 1 main_~m~0) (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (< (div |main_#t~ret8| correct_version_~j~0) (+ correct_version_~i~0 1)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (= (mod |main_#t~ret8| correct_version_~j~0) 0) (<= correct_version_~i~0 (div |main_#t~ret8| correct_version_~j~0)) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0))))))} is UNKNOWN [2022-04-07 18:03:45,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {2852#(and (<= 1 main_~n~0) (<= 1 main_~m~0) (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (< (div |main_#t~ret8| correct_version_~j~0) (+ correct_version_~i~0 1)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (= (mod |main_#t~ret8| correct_version_~j~0) 0) (<= correct_version_~i~0 (div |main_#t~ret8| correct_version_~j~0)) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0))))))} [130] L104-1-->L105: Formula: (and (<= |v_main_#t~ret8_3| 2147483647) (= |v_main_#t~ret8_3| v_main_~n_stones1~0_4) (<= 0 (+ |v_main_#t~ret8_3| 2147483648))) InVars {main_#t~ret8=|v_main_#t~ret8_3|} OutVars{main_~n_stones1~0=v_main_~n_stones1~0_4} AuxVars[] AssignedVars[main_#t~ret8, main_~n_stones1~0] {2856#(and (<= 1 main_~n~0) (<= 1 main_~m~0) (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (< (div main_~n_stones1~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (<= correct_version_~i~0 (div main_~n_stones1~0 correct_version_~j~0)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (= (mod main_~n_stones1~0 correct_version_~j~0) 0) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0))))))} is VALID [2022-04-07 18:03:45,673 INFO L272 TraceCheckUtils]: 20: Hoare triple {2856#(and (<= 1 main_~n~0) (<= 1 main_~m~0) (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (< (div main_~n_stones1~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (<= correct_version_~i~0 (div main_~n_stones1~0 correct_version_~j~0)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (= (mod main_~n_stones1~0 correct_version_~j~0) 0) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0))))))} [134] L105-->student_versionENTRY: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {2783#true} is VALID [2022-04-07 18:03:45,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {2783#true} [142] student_versionENTRY-->L65-2: Formula: (and (= v_student_version_~b~1_3 0) (= v_student_version_~m_3 |v_student_version_#in~m_1|) (= v_student_version_~a_3 |v_student_version_#in~a_1|) (= v_student_version_~n_2 |v_student_version_#in~n_1|) (= v_student_version_~j~1_3 0) (= v_student_version_~l~1_4 0) (= v_student_version_~i~1_4 0)) InVars {student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_#in~a=|v_student_version_#in~a_1|} OutVars{student_version_~i~1=v_student_version_~i~1_4, student_version_#in~n=|v_student_version_#in~n_1|, student_version_#in~m=|v_student_version_#in~m_1|, student_version_~a=v_student_version_~a_3, student_version_~j~1=v_student_version_~j~1_3, student_version_~l~1=v_student_version_~l~1_4, student_version_~b~1=v_student_version_~b~1_3, student_version_~n=v_student_version_~n_2, student_version_#in~a=|v_student_version_#in~a_1|, student_version_~m=v_student_version_~m_3} AuxVars[] AssignedVars[student_version_~i~1, student_version_~a, student_version_~j~1, student_version_~l~1, student_version_~b~1, student_version_~n, student_version_~m] {2863#(and (= |student_version_#in~a| student_version_~a) (= student_version_~l~1 0) (= student_version_~i~1 0) (= |student_version_#in~m| student_version_~m) (= student_version_~j~1 0) (= |student_version_#in~n| student_version_~n) (= student_version_~b~1 0))} is VALID [2022-04-07 18:03:45,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {2863#(and (= |student_version_#in~a| student_version_~a) (= student_version_~l~1 0) (= student_version_~i~1 0) (= |student_version_#in~m| student_version_~m) (= student_version_~j~1 0) (= |student_version_#in~n| student_version_~n) (= student_version_~b~1 0))} [151] L65-2-->L65-2: Formula: (or (and (<= v_student_version_~n_1 v_student_version_~b~1_2) (= v_student_version_~b~1_2 v_student_version_~b~1_1) (= v_student_version_~i~1_2 v_student_version_~i~1_1)) (and (< v_student_version_~i~1_2 v_student_version_~i~1_1) (= (+ v_student_version_~b~1_2 (* (+ v_student_version_~i~1_1 (* (- 1) v_student_version_~i~1_2)) v_student_version_~a_1)) v_student_version_~b~1_1) (< v_student_version_~b~1_2 v_student_version_~n_1) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 v_student_version_~i~1_2 1) v_student_version_~i~1_1)) (< (+ v_student_version_~b~1_2 (* v_student_version_~a_1 v_it_3)) v_student_version_~n_1))))) InVars {student_version_~i~1=v_student_version_~i~1_2, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_2, student_version_~n=v_student_version_~n_1} OutVars{student_version_~i~1=v_student_version_~i~1_1, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_1, student_version_~n=v_student_version_~n_1} AuxVars[] AssignedVars[student_version_~i~1, student_version_~b~1] {2867#(and (= |student_version_#in~a| student_version_~a) (= student_version_~l~1 0) (= |student_version_#in~m| student_version_~m) (= student_version_~j~1 0) (or (and (= student_version_~i~1 0) (<= student_version_~n 0) (= student_version_~b~1 0)) (and (< 0 student_version_~n) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (not (<= 1 v_it_3)) (< (* v_it_3 student_version_~a) student_version_~n))) (= (* student_version_~i~1 student_version_~a) student_version_~b~1) (< 0 student_version_~i~1))) (= |student_version_#in~n| student_version_~n))} is VALID [2022-04-07 18:03:45,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {2867#(and (= |student_version_#in~a| student_version_~a) (= student_version_~l~1 0) (= |student_version_#in~m| student_version_~m) (= student_version_~j~1 0) (or (and (= student_version_~i~1 0) (<= student_version_~n 0) (= student_version_~b~1 0)) (and (< 0 student_version_~n) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (not (<= 1 v_it_3)) (< (* v_it_3 student_version_~a) student_version_~n))) (= (* student_version_~i~1 student_version_~a) student_version_~b~1) (< 0 student_version_~i~1))) (= |student_version_#in~n| student_version_~n))} [150] L65-2-->L71-1: Formula: (not (< v_student_version_~b~1_4 v_student_version_~n_3)) InVars {student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} OutVars{student_version_~b~1=v_student_version_~b~1_4, student_version_~n=v_student_version_~n_3} AuxVars[] AssignedVars[] {2871#(and (= |student_version_#in~a| student_version_~a) (= student_version_~l~1 0) (= |student_version_#in~m| student_version_~m) (= student_version_~j~1 0) (or (and (not (< (* student_version_~i~1 student_version_~a) |student_version_#in~n|)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 student_version_~a) |student_version_#in~n|))) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))))} is VALID [2022-04-07 18:03:45,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {2871#(and (= |student_version_#in~a| student_version_~a) (= student_version_~l~1 0) (= |student_version_#in~m| student_version_~m) (= student_version_~j~1 0) (or (and (not (< (* student_version_~i~1 student_version_~a) |student_version_#in~n|)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 student_version_~a) |student_version_#in~n|))) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))))} [155] L71-1-->L71-1: Formula: (or (and (= v_student_version_~l~1_3 v_student_version_~l~1_2) (<= v_student_version_~m_2 v_student_version_~l~1_3) (= v_student_version_~j~1_2 v_student_version_~j~1_1)) (and (= (+ v_student_version_~l~1_3 (* (+ v_student_version_~j~1_1 (* (- 1) v_student_version_~j~1_2)) v_student_version_~a_2)) v_student_version_~l~1_2) (< v_student_version_~j~1_2 v_student_version_~j~1_1) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 v_student_version_~j~1_2 1) v_student_version_~j~1_1)) (not (<= 1 v_it_4)) (< (+ (* v_student_version_~a_2 v_it_4) v_student_version_~l~1_3) v_student_version_~m_2))) (< v_student_version_~l~1_3 v_student_version_~m_2))) InVars {student_version_~l~1=v_student_version_~l~1_3, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_2, student_version_~m=v_student_version_~m_2} OutVars{student_version_~l~1=v_student_version_~l~1_2, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_1, student_version_~m=v_student_version_~m_2} AuxVars[] AssignedVars[student_version_~j~1, student_version_~l~1] {2875#(and (= |student_version_#in~m| student_version_~m) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (= student_version_~l~1 0) (= student_version_~j~1 0) (<= student_version_~m 0)) (and (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (not (<= 1 v_it_4)) (< (* v_it_4 |student_version_#in~a|) student_version_~m))) (= (* |student_version_#in~a| student_version_~j~1) student_version_~l~1) (< 0 student_version_~j~1) (< 0 student_version_~m))))} is VALID [2022-04-07 18:03:45,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {2875#(and (= |student_version_#in~m| student_version_~m) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (= student_version_~l~1 0) (= student_version_~j~1 0) (<= student_version_~m 0)) (and (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (not (<= 1 v_it_4)) (< (* v_it_4 |student_version_#in~a|) student_version_~m))) (= (* |student_version_#in~a| student_version_~j~1) student_version_~l~1) (< 0 student_version_~j~1) (< 0 student_version_~m))))} [154] L71-1-->L71-2: Formula: (not (< v_student_version_~l~1_1 v_student_version_~m_1)) InVars {student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} OutVars{student_version_~l~1=v_student_version_~l~1_1, student_version_~m=v_student_version_~m_1} AuxVars[] AssignedVars[] {2879#(and (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))))} is VALID [2022-04-07 18:03:45,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {2879#(and (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))))} [159] L71-2-->L79-2: Formula: (and (= v_student_version_~y~1_1 0) (= v_student_version_~x~1_1 0)) InVars {} OutVars{student_version_~x~1=v_student_version_~x~1_1, student_version_~y~1=v_student_version_~y~1_1} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {2883#(and (= student_version_~y~1 0) (= student_version_~x~1 0) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))))} is VALID [2022-04-07 18:03:45,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {2883#(and (= student_version_~y~1 0) (= student_version_~x~1 0) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))))} [163] L79-2-->L79-2: Formula: (or (and (= (+ v_student_version_~y~1_2 (* v_student_version_~j~1_4 v_student_version_~x~1_4)) (+ v_student_version_~y~1_3 (* v_student_version_~j~1_4 v_student_version_~x~1_3))) (< v_student_version_~x~1_4 v_student_version_~x~1_3) (< v_student_version_~x~1_3 (+ v_student_version_~i~1_5 1))) (and (= v_student_version_~y~1_3 v_student_version_~y~1_2) (not (< v_student_version_~x~1_4 v_student_version_~i~1_5)) (= v_student_version_~x~1_4 v_student_version_~x~1_3))) InVars {student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_3, student_version_~x~1=v_student_version_~x~1_4, student_version_~j~1=v_student_version_~j~1_4} OutVars{student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_2, student_version_~x~1=v_student_version_~x~1_3, student_version_~j~1=v_student_version_~j~1_4} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {2887#(and (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))) (or (and (= student_version_~y~1 0) (not (< 0 student_version_~i~1)) (= student_version_~x~1 0)) (and (= student_version_~y~1 (* student_version_~j~1 student_version_~x~1)) (< student_version_~x~1 (+ student_version_~i~1 1)) (< 0 student_version_~x~1))))} is VALID [2022-04-07 18:03:45,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {2887#(and (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))) (or (and (= student_version_~y~1 0) (not (< 0 student_version_~i~1)) (= student_version_~x~1 0)) (and (= student_version_~y~1 (* student_version_~j~1 student_version_~x~1)) (< student_version_~x~1 (+ student_version_~i~1 1)) (< 0 student_version_~x~1))))} [163] L79-2-->L79-2: Formula: (or (and (= (+ v_student_version_~y~1_2 (* v_student_version_~j~1_4 v_student_version_~x~1_4)) (+ v_student_version_~y~1_3 (* v_student_version_~j~1_4 v_student_version_~x~1_3))) (< v_student_version_~x~1_4 v_student_version_~x~1_3) (< v_student_version_~x~1_3 (+ v_student_version_~i~1_5 1))) (and (= v_student_version_~y~1_3 v_student_version_~y~1_2) (not (< v_student_version_~x~1_4 v_student_version_~i~1_5)) (= v_student_version_~x~1_4 v_student_version_~x~1_3))) InVars {student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_3, student_version_~x~1=v_student_version_~x~1_4, student_version_~j~1=v_student_version_~j~1_4} OutVars{student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_2, student_version_~x~1=v_student_version_~x~1_3, student_version_~j~1=v_student_version_~j~1_4} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {2891#(and (exists ((student_version_~j~1 Int)) (and (or (and (exists ((v_student_version_~x~1_22 Int)) (and (< v_student_version_~x~1_22 student_version_~x~1) (= (* student_version_~j~1 v_student_version_~x~1_22) (+ (* (- 1) student_version_~j~1 student_version_~x~1) (* student_version_~j~1 v_student_version_~x~1_22) student_version_~y~1)) (< 0 v_student_version_~x~1_22))) (< student_version_~x~1 (+ student_version_~i~1 1))) (and (= student_version_~y~1 (* student_version_~j~1 student_version_~x~1)) (< student_version_~x~1 (+ student_version_~i~1 1)) (not (< student_version_~x~1 student_version_~i~1)))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))))) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))))} is VALID [2022-04-07 18:03:47,864 WARN L290 TraceCheckUtils]: 29: Hoare triple {2891#(and (exists ((student_version_~j~1 Int)) (and (or (and (exists ((v_student_version_~x~1_22 Int)) (and (< v_student_version_~x~1_22 student_version_~x~1) (= (* student_version_~j~1 v_student_version_~x~1_22) (+ (* (- 1) student_version_~j~1 student_version_~x~1) (* student_version_~j~1 v_student_version_~x~1_22) student_version_~y~1)) (< 0 v_student_version_~x~1_22))) (< student_version_~x~1 (+ student_version_~i~1 1))) (and (= student_version_~y~1 (* student_version_~j~1 student_version_~x~1)) (< student_version_~x~1 (+ student_version_~i~1 1)) (not (< student_version_~x~1 student_version_~i~1)))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))))) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))))} [162] L79-2-->L79-3: Formula: (not (< v_student_version_~x~1_2 v_student_version_~i~1_3)) InVars {student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} OutVars{student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} AuxVars[] AssignedVars[] {2895#(exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))) (or (and (not (< (div student_version_~y~1 student_version_~j~1) student_version_~i~1)) (not (= student_version_~j~1 0)) (= (mod student_version_~y~1 student_version_~j~1) 0) (< (div student_version_~y~1 student_version_~j~1) (+ student_version_~i~1 1))) (and (= student_version_~y~1 0) (= student_version_~j~1 0)))))} is UNKNOWN [2022-04-07 18:03:47,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {2895#(exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|))) (or (and (not (< (div student_version_~y~1 student_version_~j~1) student_version_~i~1)) (not (= student_version_~j~1 0)) (= (mod student_version_~y~1 student_version_~j~1) 0) (< (div student_version_~y~1 student_version_~j~1) (+ student_version_~i~1 1))) (and (= student_version_~y~1 0) (= student_version_~j~1 0)))))} [165] L79-3-->student_versionFINAL: Formula: (= v_student_version_~y~1_4 |v_student_version_#res_1|) InVars {student_version_~y~1=v_student_version_~y~1_4} OutVars{student_version_#res=|v_student_version_#res_1|, student_version_~y~1=v_student_version_~y~1_4} AuxVars[] AssignedVars[student_version_#res] {2899#(exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (or (and (< (div |student_version_#res| student_version_~j~1) (+ student_version_~i~1 1)) (not (= student_version_~j~1 0)) (= (mod |student_version_#res| student_version_~j~1) 0) (not (< (div |student_version_#res| student_version_~j~1) student_version_~i~1))) (and (= |student_version_#res| 0) (= student_version_~j~1 0))) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|)))))} is VALID [2022-04-07 18:03:48,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {2899#(exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (or (and (< (div |student_version_#res| student_version_~j~1) (+ student_version_~i~1 1)) (not (= student_version_~j~1 0)) (= (mod |student_version_#res| student_version_~j~1) 0) (not (< (div |student_version_#res| student_version_~j~1) student_version_~i~1))) (and (= |student_version_#res| 0) (= student_version_~j~1 0))) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|)))))} [166] student_versionFINAL-->student_versionEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2899#(exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (or (and (< (div |student_version_#res| student_version_~j~1) (+ student_version_~i~1 1)) (not (= student_version_~j~1 0)) (= (mod |student_version_#res| student_version_~j~1) 0) (not (< (div |student_version_#res| student_version_~j~1) student_version_~i~1))) (and (= |student_version_#res| 0) (= student_version_~j~1 0))) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|)))))} is VALID [2022-04-07 18:03:50,143 WARN L284 TraceCheckUtils]: 32: Hoare quadruple {2899#(exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (or (and (< (div |student_version_#res| student_version_~j~1) (+ student_version_~i~1 1)) (not (= student_version_~j~1 0)) (= (mod |student_version_#res| student_version_~j~1) 0) (not (< (div |student_version_#res| student_version_~j~1) student_version_~i~1))) (and (= |student_version_#res| 0) (= student_version_~j~1 0))) (or (and (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 |student_version_#in~a|) |student_version_#in~n|))) (not (< (* |student_version_#in~a| student_version_~i~1) |student_version_#in~n|)) (< 0 student_version_~i~1)) (and (= student_version_~i~1 0) (<= |student_version_#in~n| 0))) (or (and (<= |student_version_#in~m| 0) (= student_version_~j~1 0)) (and (not (< (* |student_version_#in~a| student_version_~j~1) |student_version_#in~m|)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 |student_version_#in~a|) |student_version_#in~m|))) (< 0 |student_version_#in~m|)))))} {2856#(and (<= 1 main_~n~0) (<= 1 main_~m~0) (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (< (div main_~n_stones1~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (<= correct_version_~i~0 (div main_~n_stones1~0 correct_version_~j~0)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (= (mod main_~n_stones1~0 correct_version_~j~0) 0) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0))))))} [171] student_versionEXIT-->L105-1: AOR: Formula: (= |v_main_#t~ret9_4| |v_student_version_#resOutParam_1|) InVars {student_version_#res=|v_student_version_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_4|} AuxVars[] AssignedVars[student_version_#res, main_#t~ret9] LVA: Formula: (and (= v_main_~n~0_7 |v_student_version_#in~nInParam_1|) (= v_main_~m~0_7 |v_student_version_#in~mInParam_1|) (= |v_student_version_#in~aInParam_1| v_main_~a~0_7)) InVars {main_~n~0=v_main_~n~0_7, main_~m~0=v_main_~m~0_7, main_~a~0=v_main_~a~0_7} OutVars{student_version_#in~n=|v_student_version_#in~nInParam_1|, student_version_#in~m=|v_student_version_#in~mInParam_1|, student_version_#in~a=|v_student_version_#in~aInParam_1|} AuxVars[] AssignedVars[student_version_#in~n, student_version_#in~m, main_~m~0, main_~n~0, student_version_#in~a, main_~a~0] {2906#(exists ((main_~m~0 Int) (main_~n~0 Int) (main_~a~0 Int)) (and (<= 1 main_~n~0) (<= 1 main_~m~0) (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (< (div main_~n_stones1~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (<= correct_version_~i~0 (div main_~n_stones1~0 correct_version_~j~0)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (= (mod main_~n_stones1~0 correct_version_~j~0) 0) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0))))) (exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (not (< (div |main_#t~ret9| student_version_~j~1) student_version_~i~1)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (< (div |main_#t~ret9| student_version_~j~1) (+ student_version_~i~1 1)) (= (mod |main_#t~ret9| student_version_~j~1) 0) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 main_~a~0) main_~m~0))) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (<= main_~m~0 (* main_~a~0 student_version_~j~1)) (< 0 student_version_~i~1)))))} is UNKNOWN [2022-04-07 18:03:52,149 WARN L290 TraceCheckUtils]: 33: Hoare triple {2906#(exists ((main_~m~0 Int) (main_~n~0 Int) (main_~a~0 Int)) (and (<= 1 main_~n~0) (<= 1 main_~m~0) (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (< (div main_~n_stones1~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (<= correct_version_~i~0 (div main_~n_stones1~0 correct_version_~j~0)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (= (mod main_~n_stones1~0 correct_version_~j~0) 0) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0))))) (exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (not (< (div |main_#t~ret9| student_version_~j~1) student_version_~i~1)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (< (div |main_#t~ret9| student_version_~j~1) (+ student_version_~i~1 1)) (= (mod |main_#t~ret9| student_version_~j~1) 0) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 main_~a~0) main_~m~0))) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (<= main_~m~0 (* main_~a~0 student_version_~j~1)) (< 0 student_version_~i~1)))))} [141] L105-1-->L97-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647) (= |v_main_#t~ret9_2| v_main_~n_stones2~0_1)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_~n_stones2~0=v_main_~n_stones2~0_1} AuxVars[] AssignedVars[main_~n_stones2~0, main_#t~ret9] {2910#(exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int) (main_~m~0 Int) (main_~n~0 Int) (main_~a~0 Int) (student_version_~i~1 Int) (student_version_~j~1 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (<= 1 main_~n~0) (< (div main_~n_stones1~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (<= correct_version_~i~0 (div main_~n_stones1~0 correct_version_~j~0)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (= (mod main_~n_stones2~0 student_version_~j~1) 0) (<= 1 main_~m~0) (< (div main_~n_stones2~0 student_version_~j~1) (+ student_version_~i~1 1)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 main_~a~0) main_~m~0))) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (not (< (div main_~n_stones2~0 student_version_~j~1) student_version_~i~1)) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (= (mod main_~n_stones1~0 correct_version_~j~0) 0) (<= main_~m~0 (* main_~a~0 student_version_~j~1)) (< 0 student_version_~i~1) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0)))))} is UNKNOWN [2022-04-07 18:03:54,158 WARN L272 TraceCheckUtils]: 34: Hoare triple {2910#(exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int) (main_~m~0 Int) (main_~n~0 Int) (main_~a~0 Int) (student_version_~i~1 Int) (student_version_~j~1 Int)) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (<= 1 main_~n~0) (< (div main_~n_stones1~0 correct_version_~j~0) (+ correct_version_~i~0 1)) (<= correct_version_~i~0 (div main_~n_stones1~0 correct_version_~j~0)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (= (mod main_~n_stones2~0 student_version_~j~1) 0) (<= 1 main_~m~0) (< (div main_~n_stones2~0 student_version_~j~1) (+ student_version_~i~1 1)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 main_~a~0) main_~m~0))) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (not (< (div main_~n_stones2~0 student_version_~j~1) student_version_~i~1)) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (= (mod main_~n_stones1~0 correct_version_~j~0) 0) (<= main_~m~0 (* main_~a~0 student_version_~j~1)) (< 0 student_version_~i~1) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0)))))} [129] L97-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n_stones1~0_5 v_main_~n_stones2~0_4) 1 0)) InVars {main_~n_stones2~0=v_main_~n_stones2~0_4, main_~n_stones1~0=v_main_~n_stones1~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n_stones2~0, main_~n_stones1~0] {2914#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-07 18:03:54,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {2914#(<= 1 |__VERIFIER_assert_#in~cond|)} [133] __VERIFIER_assertENTRY-->L6: 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] {2918#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:03:54,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {2918#(<= 1 __VERIFIER_assert_~cond)} [139] L6-->L7: 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[] {2784#false} is VALID [2022-04-07 18:03:54,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {2784#false} [146] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2784#false} is VALID [2022-04-07 18:03:54,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 18:03:54,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 18:04:26,295 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 18:04:28,707 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful