/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-fb4f59a-m [2022-04-27 17:01:57,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 17:01:57,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 17:01:57,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 17:01:57,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 17:01:57,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 17:01:57,783 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 17:01:57,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 17:01:57,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 17:01:57,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 17:01:57,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 17:01:57,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 17:01:57,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 17:01:57,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 17:01:57,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 17:01:57,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 17:01:57,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 17:01:57,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 17:01:57,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 17:01:57,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 17:01:57,794 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 17:01:57,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 17:01:57,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 17:01:57,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 17:01:57,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 17:01:57,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 17:01:57,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 17:01:57,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 17:01:57,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 17:01:57,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 17:01:57,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 17:01:57,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 17:01:57,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 17:01:57,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 17:01:57,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 17:01:57,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 17:01:57,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 17:01:57,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 17:01:57,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 17:01:57,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 17:01:57,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 17:01:57,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 17:01:57,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 17:01:57,821 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 17:01:57,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 17:01:57,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 17:01:57,822 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 17:01:57,822 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 17:01:57,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 17:01:57,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 17:01:57,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 17:01:57,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 17:01:57,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 17:01:57,823 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 17:01:57,823 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 17:01:57,823 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 17:01:57,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 17:01:57,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 17:01:57,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 17:01:57,824 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 17:01:57,824 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 17:01:57,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:01:57,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 17:01:57,824 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 17:01:57,825 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 17:01:57,825 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 17:01:58,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 17:01:58,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 17:01:58,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 17:01:58,035 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 17:01:58,036 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 17:01:58,036 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-27 17:01:58,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231874f75/886b6fcbe7e94e51bef06e27913d8418/FLAG695cf263e [2022-04-27 17:01:58,455 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 17:01:58,455 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c [2022-04-27 17:01:58,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231874f75/886b6fcbe7e94e51bef06e27913d8418/FLAG695cf263e [2022-04-27 17:01:58,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231874f75/886b6fcbe7e94e51bef06e27913d8418 [2022-04-27 17:01:58,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 17:01:58,482 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 17:01:58,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 17:01:58,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 17:01:58,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 17:01:58,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:01:58" (1/1) ... [2022-04-27 17:01:58,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3982926b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:01:58, skipping insertion in model container [2022-04-27 17:01:58,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:01:58" (1/1) ... [2022-04-27 17:01:58,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 17:01:58,512 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 17:01:58,676 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-27 17:01:58,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:01:58,717 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 17:01:58,732 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-27 17:01:58,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:01:58,765 INFO L208 MainTranslator]: Completed translation [2022-04-27 17:01:58,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:01:58 WrapperNode [2022-04-27 17:01:58,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 17:01:58,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 17:01:58,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 17:01:58,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 17:01:58,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:01:58" (1/1) ... [2022-04-27 17:01:58,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:01:58" (1/1) ... [2022-04-27 17:01:58,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:01:58" (1/1) ... [2022-04-27 17:01:58,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:01:58" (1/1) ... [2022-04-27 17:01:58,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:01:58" (1/1) ... [2022-04-27 17:01:58,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:01:58" (1/1) ... [2022-04-27 17:01:58,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:01:58" (1/1) ... [2022-04-27 17:01:58,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 17:01:58,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 17:01:58,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 17:01:58,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 17:01:58,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:01:58" (1/1) ... [2022-04-27 17:01:58,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:01:58,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:01:58,838 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 17:01:58,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 17:01:58,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 17:01:58,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 17:01:58,870 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 17:01:58,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 17:01:58,870 INFO L138 BoogieDeclarations]: Found implementation of procedure correct_version [2022-04-27 17:01:58,870 INFO L138 BoogieDeclarations]: Found implementation of procedure student_version [2022-04-27 17:01:58,870 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 17:01:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 17:01:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 17:01:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 17:01:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 17:01:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 17:01:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 17:01:58,871 INFO L130 BoogieDeclarations]: Found specification of procedure correct_version [2022-04-27 17:01:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure student_version [2022-04-27 17:01:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 17:01:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 17:01:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 17:01:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 17:01:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 17:01:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 17:01:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 17:01:58,926 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 17:01:58,927 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 17:01:59,140 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 17:01:59,145 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 17:01:59,145 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-27 17:01:59,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:01:59 BoogieIcfgContainer [2022-04-27 17:01:59,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 17:01:59,147 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 17:01:59,147 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 17:01:59,148 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 17:01:59,150 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:01:59" (1/1) ... [2022-04-27 17:01:59,151 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 17:01:59,925 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-27 17:01:59,925 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-27 17:02:04,062 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-27 17:02:04,263 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-27 17:02:04,263 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-27 17:02:08,389 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-27 17:02:08,518 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-27 17:02:08,518 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-27 17:02:08,801 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-27 17:02:08,802 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-27 17:02:09,062 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-27 17:02:09,062 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-27 17:02:13,166 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-27 17:02:13,263 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-27 17:02:13,264 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-27 17:02:13,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:02:13 BasicIcfg [2022-04-27 17:02:13,267 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 17:02:13,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 17:02:13,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 17:02:13,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 17:02:13,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 05:01:58" (1/4) ... [2022-04-27 17:02:13,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6c5879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:02:13, skipping insertion in model container [2022-04-27 17:02:13,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:01:58" (2/4) ... [2022-04-27 17:02:13,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6c5879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:02:13, skipping insertion in model container [2022-04-27 17:02:13,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:01:59" (3/4) ... [2022-04-27 17:02:13,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6c5879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:02:13, skipping insertion in model container [2022-04-27 17:02:13,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:02:13" (4/4) ... [2022-04-27 17:02:13,277 INFO L111 eAbstractionObserver]: Analyzing ICFG theatreSquare.cJordan [2022-04-27 17:02:13,288 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 17:02:13,289 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 17:02:13,326 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 17:02:13,330 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@10ec35f7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@67727835 [2022-04-27 17:02:13,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 17:02:13,336 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-27 17:02:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 17:02:13,341 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:02:13,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:02:13,341 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:02:13,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:02:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1121522138, now seen corresponding path program 1 times [2022-04-27 17:02:13,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:02:13,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001576279] [2022-04-27 17:02:13,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:02:13,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:02:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:13,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:02:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:13,545 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-27 17:02:13,545 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-27 17:02:13,546 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-27 17:02:13,547 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-27 17:02:13,547 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-27 17:02:13,548 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-27 17:02:13,548 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-27 17:02:13,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 17:02:13,549 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-27 17:02:13,549 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-27 17:02:13,550 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-27 17:02:13,551 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-27 17:02:13,551 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-27 17:02:13,551 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-27 17:02:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:02:13,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:02:13,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001576279] [2022-04-27 17:02:13,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001576279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:02:13,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:02:13,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 17:02:13,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654645732] [2022-04-27 17:02:13,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:02:13,559 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-27 17:02:13,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:02:13,562 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-27 17:02:13,573 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-27 17:02:13,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 17:02:13,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:02:13,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 17:02:13,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 17:02:13,595 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-27 17:02:13,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:13,917 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-27 17:02:13,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 17:02:13,917 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-27 17:02:13,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:02:13,919 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-27 17:02:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-27 17:02:13,930 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-27 17:02:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-27 17:02:13,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2022-04-27 17:02:13,982 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-27 17:02:13,989 INFO L225 Difference]: With dead ends: 47 [2022-04-27 17:02:13,990 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 17:02:13,992 INFO L412 NwaCegarLoop]: 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-27 17:02:13,995 INFO L413 NwaCegarLoop]: 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-27 17:02:13,996 INFO L414 NwaCegarLoop]: 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-27 17:02:14,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 17:02:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 17:02:14,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:02:14,015 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-27 17:02:14,016 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-27 17:02:14,016 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-27 17:02:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:14,018 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-27 17:02:14,018 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-27 17:02:14,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:02:14,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:02:14,020 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-27 17:02:14,022 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-27 17:02:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:14,028 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-27 17:02:14,028 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-27 17:02:14,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:02:14,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:02:14,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:02:14,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:02:14,031 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-27 17:02:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-27 17:02:14,035 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2022-04-27 17:02:14,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:02:14,036 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-27 17:02:14,036 INFO L496 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-27 17:02:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-27 17:02:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 17:02:14,037 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:02:14,037 INFO L195 NwaCegarLoop]: 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-27 17:02:14,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 17:02:14,037 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:02:14,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:02:14,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1342094697, now seen corresponding path program 1 times [2022-04-27 17:02:14,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:02:14,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59933692] [2022-04-27 17:02:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:02:14,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:02:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:14,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:02:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:14,152 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-27 17:02:14,152 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-27 17:02:14,152 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-27 17:02:14,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 17:02:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:14,188 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-27 17:02:14,189 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-27 17:02:14,189 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-27 17:02:14,189 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-27 17:02:14,190 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-27 17:02:14,190 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-27 17:02:14,191 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-27 17:02:14,192 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-27 17:02:14,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 17:02:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:14,239 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-27 17:02:14,239 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-27 17:02:14,240 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-27 17:02:14,240 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-27 17:02:14,241 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-27 17:02:14,242 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-27 17:02:14,242 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-27 17:02:14,243 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-27 17:02:14,243 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-27 17:02:14,243 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-27 17:02:14,244 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-27 17:02:14,244 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-27 17:02:14,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {204#true} is VALID [2022-04-27 17:02:14,245 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-27 17:02:14,245 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-27 17:02:14,245 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-27 17:02:14,245 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-27 17:02:14,245 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-27 17:02:14,245 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-27 17:02:14,246 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-27 17:02:14,247 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-27 17:02:14,247 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-27 17:02:14,247 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-27 17:02:14,250 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-27 17:02:14,251 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-27 17:02:14,251 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-27 17:02:14,252 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-27 17:02:14,253 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-27 17:02:14,253 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-27 17:02:14,253 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-27 17:02:14,254 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-27 17:02:14,255 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-27 17:02:14,255 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-27 17:02:14,256 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-27 17:02:14,256 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-27 17:02:14,257 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-27 17:02:14,257 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-27 17:02:14,257 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-27 17:02:14,258 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-27 17:02:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:02:14,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:02:14,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59933692] [2022-04-27 17:02:14,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59933692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:02:14,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:02:14,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-27 17:02:14,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697858755] [2022-04-27 17:02:14,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:02:14,264 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-27 17:02:14,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:02:14,265 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-27 17:02:14,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:02:14,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 17:02:14,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:02:14,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 17:02:14,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-04-27 17:02:14,285 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-27 17:02:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:14,978 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-27 17:02:14,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 17:02:14,978 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-27 17:02:14,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:02:14,979 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-27 17:02:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 57 transitions. [2022-04-27 17:02:14,981 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-27 17:02:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 57 transitions. [2022-04-27 17:02:14,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 57 transitions. [2022-04-27 17:02:15,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:02:15,031 INFO L225 Difference]: With dead ends: 48 [2022-04-27 17:02:15,031 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 17:02:15,031 INFO L412 NwaCegarLoop]: 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-27 17:02:15,032 INFO L413 NwaCegarLoop]: 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-27 17:02:15,032 INFO L414 NwaCegarLoop]: 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-27 17:02:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 17:02:15,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-04-27 17:02:15,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:02:15,036 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-27 17:02:15,037 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-27 17:02:15,037 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-27 17:02:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:15,039 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-27 17:02:15,039 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-27 17:02:15,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:02:15,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:02:15,040 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-27 17:02:15,040 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-27 17:02:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:15,042 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-27 17:02:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-27 17:02:15,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:02:15,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:02:15,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:02:15,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:02:15,043 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-27 17:02:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-27 17:02:15,045 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 31 [2022-04-27 17:02:15,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:02:15,045 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-27 17:02:15,045 INFO L496 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-27 17:02:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-27 17:02:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 17:02:15,046 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:02:15,046 INFO L195 NwaCegarLoop]: 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-27 17:02:15,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 17:02:15,046 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:02:15,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:02:15,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1260090278, now seen corresponding path program 1 times [2022-04-27 17:02:15,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:02:15,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690676291] [2022-04-27 17:02:15,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:02:15,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:02:15,084 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:02:15,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [132479925] [2022-04-27 17:02:15,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:02:15,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:02:15,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:02:15,093 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:02:15,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 17:02:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:15,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 17:02:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:15,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:02:15,286 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-27 17:02:15,286 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-27 17:02:15,286 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-27 17:02:15,286 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-27 17:02:15,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {439#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#true} is VALID [2022-04-27 17:02:15,287 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-27 17:02:15,287 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-27 17:02:15,287 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-27 17:02:15,288 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-27 17:02:15,288 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-27 17:02:15,289 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-27 17:02:15,289 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-27 17:02:15,289 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-27 17:02:15,290 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-27 17:02:15,290 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-27 17:02:15,291 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-27 17:02:15,292 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-27 17:02:15,292 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-27 17:02:15,292 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-27 17:02:15,292 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-27 17:02:15,292 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-27 17:02:15,292 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-27 17:02:15,293 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-27 17:02:15,294 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-27 17:02:15,294 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-27 17:02:15,294 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-27 17:02:15,294 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-27 17:02:15,294 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-27 17:02:15,294 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-27 17:02:15,295 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-27 17:02:15,295 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-27 17:02:15,295 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-27 17:02:15,295 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-27 17:02:15,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:02:15,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:02:15,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690676291] [2022-04-27 17:02:15,297 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:02:15,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132479925] [2022-04-27 17:02:15,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132479925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:02:15,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:02:15,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:02:15,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785142413] [2022-04-27 17:02:15,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:02:15,300 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-27 17:02:15,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:02:15,301 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-27 17:02:15,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:02:15,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:02:15,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:02:15,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:02:15,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:02:15,321 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-27 17:02:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:15,424 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-27 17:02:15,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:02:15,424 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-27 17:02:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:02:15,424 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-27 17:02:15,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 17:02:15,426 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-27 17:02:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 17:02:15,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-27 17:02:15,465 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-27 17:02:15,466 INFO L225 Difference]: With dead ends: 53 [2022-04-27 17:02:15,466 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 17:02:15,466 INFO L412 NwaCegarLoop]: 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-27 17:02:15,467 INFO L413 NwaCegarLoop]: 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-27 17:02:15,467 INFO L414 NwaCegarLoop]: 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-27 17:02:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 17:02:15,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 17:02:15,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:02:15,471 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-27 17:02:15,471 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-27 17:02:15,471 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-27 17:02:15,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:15,473 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-27 17:02:15,473 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-27 17:02:15,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:02:15,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:02:15,473 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-27 17:02:15,474 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-27 17:02:15,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:15,476 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-27 17:02:15,476 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-27 17:02:15,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:02:15,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:02:15,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:02:15,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:02:15,477 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-27 17:02:15,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-27 17:02:15,478 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 32 [2022-04-27 17:02:15,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:02:15,479 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-27 17:02:15,479 INFO L496 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-27 17:02:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-27 17:02:15,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 17:02:15,480 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:02:15,480 INFO L195 NwaCegarLoop]: 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-27 17:02:15,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 17:02:15,699 WARN L477 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-27 17:02:15,700 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:02:15,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:02:15,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1007047745, now seen corresponding path program 1 times [2022-04-27 17:02:15,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:02:15,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469816108] [2022-04-27 17:02:15,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:02:15,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:02:15,719 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:02:15,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1455469937] [2022-04-27 17:02:15,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:02:15,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:02:15,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:02:15,721 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:02:15,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 17:02:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:15,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 17:02:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:15,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:02:15,893 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-27 17:02:15,893 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-27 17:02:15,893 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-27 17:02:15,893 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-27 17:02:15,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {723#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {723#true} is VALID [2022-04-27 17:02:15,894 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-27 17:02:15,894 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-27 17:02:15,894 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-27 17:02:15,896 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-27 17:02:15,897 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-27 17:02:15,897 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-27 17:02:15,898 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-27 17:02:15,898 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-27 17:02:15,898 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-27 17:02:15,899 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-27 17:02:15,899 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-27 17:02:15,901 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-27 17:02:15,901 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-27 17:02:15,901 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-27 17:02:15,901 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-27 17:02:15,901 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-27 17:02:15,901 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-27 17:02:15,901 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-27 17:02:15,901 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-27 17:02:15,902 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-27 17:02:15,902 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-27 17:02:15,902 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-27 17:02:15,902 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-27 17:02:15,902 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-27 17:02:15,902 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-27 17:02:15,902 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-27 17:02:15,902 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-27 17:02:15,903 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-27 17:02:15,903 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-27 17:02:15,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:02:15,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:02:15,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469816108] [2022-04-27 17:02:15,903 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:02:15,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455469937] [2022-04-27 17:02:15,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455469937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:02:15,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:02:15,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:02:15,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059633917] [2022-04-27 17:02:15,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:02:15,904 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-27 17:02:15,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:02:15,904 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-27 17:02:15,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:02:15,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:02:15,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:02:15,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:02:15,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:02:15,937 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-27 17:02:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:16,030 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-27 17:02:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:02:16,031 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-27 17:02:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:02:16,031 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-27 17:02:16,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-27 17:02:16,035 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-27 17:02:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-27 17:02:16,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-27 17:02:16,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:02:16,075 INFO L225 Difference]: With dead ends: 53 [2022-04-27 17:02:16,075 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 17:02:16,076 INFO L412 NwaCegarLoop]: 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-27 17:02:16,076 INFO L413 NwaCegarLoop]: 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-27 17:02:16,076 INFO L414 NwaCegarLoop]: 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-27 17:02:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 17:02:16,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-27 17:02:16,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:02:16,079 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-27 17:02:16,080 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-27 17:02:16,080 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-27 17:02:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:16,081 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-27 17:02:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-27 17:02:16,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:02:16,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:02:16,082 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-27 17:02:16,082 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-27 17:02:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:16,083 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-27 17:02:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-27 17:02:16,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:02:16,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:02:16,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:02:16,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:02:16,084 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-27 17:02:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-27 17:02:16,085 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 33 [2022-04-27 17:02:16,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:02:16,086 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-27 17:02:16,086 INFO L496 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-27 17:02:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-27 17:02:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 17:02:16,086 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:02:16,086 INFO L195 NwaCegarLoop]: 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-27 17:02:16,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 17:02:16,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 17:02:16,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:02:16,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:02:16,295 INFO L85 PathProgramCache]: Analyzing trace with hash 111102768, now seen corresponding path program 1 times [2022-04-27 17:02:16,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:02:16,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452710806] [2022-04-27 17:02:16,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:02:16,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:02:16,316 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:02:16,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2111857854] [2022-04-27 17:02:16,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:02:16,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:02:16,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:02:16,317 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:02:16,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 17:02:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:16,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 17:02:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:16,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:02:16,489 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-27 17:02:16,490 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-27 17:02:16,490 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-27 17:02:16,490 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-27 17:02:16,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {1013#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1013#true} is VALID [2022-04-27 17:02:16,491 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-27 17:02:16,491 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-27 17:02:16,491 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-27 17:02:16,491 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-27 17:02:16,491 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-27 17:02:16,492 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-27 17:02:16,492 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-27 17:02:16,492 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-27 17:02:16,492 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-27 17:02:16,492 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-27 17:02:16,492 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-27 17:02:16,492 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-27 17:02:16,493 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-27 17:02:16,493 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-27 17:02:16,493 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-27 17:02:16,494 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-27 17:02:16,495 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-27 17:02:16,495 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-27 17:02:16,495 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-27 17:02:16,495 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-27 17:02:16,496 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-27 17:02:16,496 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-27 17:02:16,496 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-27 17:02:16,497 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-27 17:02:16,498 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-27 17:02:16,498 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-27 17:02:16,498 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-27 17:02:16,498 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-27 17:02:16,498 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-27 17:02:16,498 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-27 17:02:16,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:02:16,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:02:16,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452710806] [2022-04-27 17:02:16,499 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:02:16,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111857854] [2022-04-27 17:02:16,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111857854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:02:16,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:02:16,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:02:16,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118854189] [2022-04-27 17:02:16,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:02:16,499 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-27 17:02:16,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:02:16,500 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-27 17:02:16,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:02:16,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:02:16,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:02:16,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:02:16,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:02:16,522 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-27 17:02:16,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:16,612 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-27 17:02:16,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:02:16,613 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-27 17:02:16,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:02:16,613 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-27 17:02:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 17:02:16,614 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-27 17:02:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 17:02:16,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-27 17:02:16,667 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-27 17:02:16,668 INFO L225 Difference]: With dead ends: 55 [2022-04-27 17:02:16,668 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 17:02:16,668 INFO L412 NwaCegarLoop]: 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-27 17:02:16,669 INFO L413 NwaCegarLoop]: 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-27 17:02:16,669 INFO L414 NwaCegarLoop]: 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-27 17:02:16,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 17:02:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 17:02:16,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:02:16,672 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-27 17:02:16,672 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-27 17:02:16,672 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-27 17:02:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:16,673 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-27 17:02:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-27 17:02:16,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:02:16,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:02:16,674 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-27 17:02:16,674 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-27 17:02:16,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:16,676 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-27 17:02:16,676 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-27 17:02:16,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:02:16,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:02:16,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:02:16,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:02:16,676 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-27 17:02:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-04-27 17:02:16,677 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 34 [2022-04-27 17:02:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:02:16,678 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-04-27 17:02:16,678 INFO L496 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-27 17:02:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-27 17:02:16,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 17:02:16,678 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:02:16,678 INFO L195 NwaCegarLoop]: 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-27 17:02:16,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 17:02:16,895 WARN L477 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-27 17:02:16,895 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:02:16,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:02:16,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1980049385, now seen corresponding path program 1 times [2022-04-27 17:02:16,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:02:16,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780724062] [2022-04-27 17:02:16,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:02:16,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:02:16,915 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:02:16,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1802960749] [2022-04-27 17:02:16,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:02:16,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:02:16,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:02:16,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:02:16,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 17:02:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:16,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 17:02:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:16,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:02:17,094 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-27 17:02:17,095 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-27 17:02:17,096 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-27 17:02:17,096 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-27 17:02:17,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {1311#true} [121] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1311#true} is VALID [2022-04-27 17:02:17,096 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-27 17:02:17,097 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-27 17:02:17,097 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-27 17:02:17,097 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-27 17:02:17,097 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-27 17:02:17,097 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-27 17:02:17,097 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-27 17:02:17,097 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-27 17:02:17,097 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-27 17:02:17,097 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-27 17:02:17,098 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-27 17:02:17,098 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-27 17:02:17,098 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-27 17:02:17,099 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-27 17:02:17,100 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-27 17:02:17,100 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-27 17:02:17,101 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-27 17:02:17,101 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-27 17:02:17,102 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-27 17:02:17,102 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-27 17:02:17,103 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-27 17:02:17,103 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-27 17:02:17,103 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-27 17:02:17,103 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-27 17:02:17,104 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-27 17:02:17,104 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-27 17:02:17,105 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-27 17:02:17,105 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-27 17:02:17,105 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-27 17:02:17,105 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-27 17:02:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 17:02:17,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:02:17,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:02:17,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780724062] [2022-04-27 17:02:17,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:02:17,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802960749] [2022-04-27 17:02:17,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802960749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:02:17,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:02:17,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:02:17,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252982010] [2022-04-27 17:02:17,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:02:17,106 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-27 17:02:17,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:02:17,107 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-27 17:02:17,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:02:17,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:02:17,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:02:17,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:02:17,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:02:17,131 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-27 17:02:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:17,228 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-27 17:02:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:02:17,229 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-27 17:02:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:02:17,229 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-27 17:02:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-27 17:02:17,230 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-27 17:02:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-27 17:02:17,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-27 17:02:17,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:02:17,266 INFO L225 Difference]: With dead ends: 55 [2022-04-27 17:02:17,266 INFO L226 Difference]: Without dead ends: 46 [2022-04-27 17:02:17,267 INFO L412 NwaCegarLoop]: 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-27 17:02:17,267 INFO L413 NwaCegarLoop]: 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-27 17:02:17,267 INFO L414 NwaCegarLoop]: 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-27 17:02:17,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-27 17:02:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-27 17:02:17,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:02:17,270 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-27 17:02:17,270 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-27 17:02:17,270 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-27 17:02:17,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:17,271 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-27 17:02:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-27 17:02:17,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:02:17,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:02:17,272 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-27 17:02:17,272 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-27 17:02:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:02:17,273 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-27 17:02:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-27 17:02:17,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:02:17,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:02:17,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:02:17,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:02:17,274 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-27 17:02:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-04-27 17:02:17,275 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 35 [2022-04-27 17:02:17,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:02:17,275 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-04-27 17:02:17,275 INFO L496 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-27 17:02:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-27 17:02:17,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 17:02:17,276 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:02:17,276 INFO L195 NwaCegarLoop]: 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-27 17:02:17,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 17:02:17,495 WARN L477 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-27 17:02:17,495 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:02:17,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:02:17,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1173604042, now seen corresponding path program 1 times [2022-04-27 17:02:17,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:02:17,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407938340] [2022-04-27 17:02:17,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:02:17,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:02:17,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:02:17,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [828565945] [2022-04-27 17:02:17,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:02:17,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:02:17,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:02:17,515 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:02:17,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 17:02:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:17,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 17:02:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:02:17,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:02:17,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:02:17,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407938340] [2022-04-27 17:02:17,966 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:02:17,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828565945] [2022-04-27 17:02:17,966 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-27 17:02:17,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 17:02:18,179 WARN L477 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-27 17:02:18,180 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Illegal for the call above at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForLocalEliminatees.findSomePushableLocalEliminateeSet(QuantifierPushUtilsForLocalEliminatees.java:177) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForLocalEliminatees.pushLocalEliminateesOverCorrespondingFiniteJunction(QuantifierPushUtilsForLocalEliminatees.java:74) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtils.preprocessDualFiniteJunction(QuantifierPushUtils.java:174) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:330) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:232) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:389) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:250) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-27 17:02:18,182 INFO L158 Benchmark]: Toolchain (without parser) took 19700.62ms. Allocated memory was 186.6MB in the beginning and 250.6MB in the end (delta: 64.0MB). Free memory was 131.5MB in the beginning and 125.7MB in the end (delta: 5.8MB). Peak memory consumption was 70.6MB. Max. memory is 8.0GB. [2022-04-27 17:02:18,183 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 186.6MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 17:02:18,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.27ms. Allocated memory is still 186.6MB. Free memory was 131.3MB in the beginning and 155.8MB in the end (delta: -24.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 17:02:18,183 INFO L158 Benchmark]: Boogie Preprocessor took 42.19ms. Allocated memory is still 186.6MB. Free memory was 155.8MB in the beginning and 154.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 17:02:18,183 INFO L158 Benchmark]: RCFGBuilder took 337.62ms. Allocated memory is still 186.6MB. Free memory was 154.3MB in the beginning and 140.1MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 17:02:18,184 INFO L158 Benchmark]: IcfgTransformer took 14119.73ms. Allocated memory was 186.6MB in the beginning and 250.6MB in the end (delta: 64.0MB). Free memory was 140.1MB in the beginning and 198.2MB in the end (delta: -58.1MB). Peak memory consumption was 88.2MB. Max. memory is 8.0GB. [2022-04-27 17:02:18,184 INFO L158 Benchmark]: TraceAbstraction took 4913.85ms. Allocated memory is still 250.6MB. Free memory was 197.7MB in the beginning and 125.7MB in the end (delta: 72.0MB). Peak memory consumption was 72.0MB. Max. memory is 8.0GB. [2022-04-27 17:02:18,185 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 186.6MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 282.27ms. Allocated memory is still 186.6MB. Free memory was 131.3MB in the beginning and 155.8MB in the end (delta: -24.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.19ms. Allocated memory is still 186.6MB. Free memory was 155.8MB in the beginning and 154.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 337.62ms. Allocated memory is still 186.6MB. Free memory was 154.3MB in the beginning and 140.1MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 14119.73ms. Allocated memory was 186.6MB in the beginning and 250.6MB in the end (delta: 64.0MB). Free memory was 140.1MB in the beginning and 198.2MB in the end (delta: -58.1MB). Peak memory consumption was 88.2MB. Max. memory is 8.0GB. * TraceAbstraction took 4913.85ms. Allocated memory is still 250.6MB. Free memory was 197.7MB in the beginning and 125.7MB in the end (delta: 72.0MB). Peak memory consumption was 72.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Illegal for the call above de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Illegal for the call above: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForLocalEliminatees.findSomePushableLocalEliminateeSet(QuantifierPushUtilsForLocalEliminatees.java:177) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-27 17:02:18,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...