/usr/bin/java -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-05ce600 [2022-02-23 16:50:05,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-23 16:50:05,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-23 16:50:05,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-23 16:50:05,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-23 16:50:05,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-23 16:50:05,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-23 16:50:05,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-23 16:50:05,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-23 16:50:05,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-23 16:50:05,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-23 16:50:05,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-23 16:50:05,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-23 16:50:05,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-23 16:50:05,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-23 16:50:05,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-23 16:50:05,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-23 16:50:05,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-23 16:50:05,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-23 16:50:05,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-23 16:50:05,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-23 16:50:05,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-23 16:50:05,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-23 16:50:05,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-23 16:50:05,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-23 16:50:05,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-23 16:50:05,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-23 16:50:05,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-23 16:50:05,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-23 16:50:05,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-23 16:50:05,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-23 16:50:05,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-23 16:50:05,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-23 16:50:05,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-23 16:50:05,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-23 16:50:05,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-23 16:50:05,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-23 16:50:05,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-23 16:50:05,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-23 16:50:05,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-23 16:50:05,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-23 16:50:05,928 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-23 16:50:05,934 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-23 16:50:05,934 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-23 16:50:05,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-23 16:50:05,935 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-23 16:50:05,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-23 16:50:05,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-23 16:50:05,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-23 16:50:05,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-23 16:50:05,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-23 16:50:05,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-23 16:50:05,936 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-23 16:50:05,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-23 16:50:05,936 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-23 16:50:05,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-23 16:50:05,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-23 16:50:05,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-23 16:50:05,937 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-23 16:50:05,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-23 16:50:05,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-23 16:50:05,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-23 16:50:05,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-23 16:50:05,938 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-23 16:50:05,938 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-02-23 16:50:06,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-23 16:50:06,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-23 16:50:06,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-23 16:50:06,161 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-23 16:50:06,161 INFO L275 PluginConnector]: CDTParser initialized [2022-02-23 16:50:06,162 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-02-23 16:50:06,214 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff241bfc5/ea0ec30ff51a400c82bab43d8c866d98/FLAG6069fb503 [2022-02-23 16:50:06,535 INFO L306 CDTParser]: Found 1 translation units. [2022-02-23 16:50:06,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c [2022-02-23 16:50:06,540 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff241bfc5/ea0ec30ff51a400c82bab43d8c866d98/FLAG6069fb503 [2022-02-23 16:50:06,978 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff241bfc5/ea0ec30ff51a400c82bab43d8c866d98 [2022-02-23 16:50:06,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-23 16:50:06,981 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-23 16:50:06,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-23 16:50:06,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-23 16:50:06,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-23 16:50:06,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 04:50:06" (1/1) ... [2022-02-23 16:50:06,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8198ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:50:06, skipping insertion in model container [2022-02-23 16:50:06,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 04:50:06" (1/1) ... [2022-02-23 16:50:07,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-23 16:50:07,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-23 16:50:07,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c[370,383] [2022-02-23 16:50:07,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-23 16:50:07,186 INFO L203 MainTranslator]: Completed pre-run [2022-02-23 16:50:07,193 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-02-23 16:50:07,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-23 16:50:07,207 INFO L208 MainTranslator]: Completed translation [2022-02-23 16:50:07,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:50:07 WrapperNode [2022-02-23 16:50:07,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-23 16:50:07,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-23 16:50:07,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-23 16:50:07,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-23 16:50:07,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:50:07" (1/1) ... [2022-02-23 16:50:07,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:50:07" (1/1) ... [2022-02-23 16:50:07,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:50:07" (1/1) ... [2022-02-23 16:50:07,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:50:07" (1/1) ... [2022-02-23 16:50:07,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:50:07" (1/1) ... [2022-02-23 16:50:07,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:50:07" (1/1) ... [2022-02-23 16:50:07,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:50:07" (1/1) ... [2022-02-23 16:50:07,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-23 16:50:07,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-23 16:50:07,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-23 16:50:07,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-23 16:50:07,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:50:07" (1/1) ... [2022-02-23 16:50:07,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-23 16:50:07,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:50:07,267 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-02-23 16:50:07,275 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-02-23 16:50:07,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-23 16:50:07,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-23 16:50:07,296 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-23 16:50:07,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-23 16:50:07,296 INFO L138 BoogieDeclarations]: Found implementation of procedure correct_version [2022-02-23 16:50:07,296 INFO L138 BoogieDeclarations]: Found implementation of procedure student_version [2022-02-23 16:50:07,296 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-23 16:50:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-23 16:50:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-23 16:50:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-23 16:50:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-23 16:50:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-23 16:50:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-23 16:50:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure correct_version [2022-02-23 16:50:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure student_version [2022-02-23 16:50:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-23 16:50:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-23 16:50:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-23 16:50:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-23 16:50:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-23 16:50:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-23 16:50:07,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-23 16:50:07,343 INFO L234 CfgBuilder]: Building ICFG [2022-02-23 16:50:07,344 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-23 16:50:07,434 INFO L275 CfgBuilder]: Performing block encoding [2022-02-23 16:50:07,437 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-23 16:50:07,438 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-23 16:50:07,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 04:50:07 BoogieIcfgContainer [2022-02-23 16:50:07,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-23 16:50:07,440 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-23 16:50:07,440 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-23 16:50:07,440 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-23 16:50:07,442 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 04:50:07" (1/1) ... [2022-02-23 16:50:07,601 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-23 16:50:07,602 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-02-23 16:50:07,673 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-23 16:50:07,674 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-02-23 16:50:07,759 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-23 16:50:07,759 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-02-23 16:50:07,817 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-02-23 16:50:07,817 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-02-23 16:50:07,901 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-23 16:50:07,902 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-02-23 16:50:07,949 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-02-23 16:50:07,949 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-02-23 16:50:07,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.02 04:50:07 BasicIcfg [2022-02-23 16:50:07,955 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-23 16:50:07,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-23 16:50:07,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-23 16:50:07,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-23 16:50:07,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.02 04:50:06" (1/4) ... [2022-02-23 16:50:07,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27676218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 04:50:07, skipping insertion in model container [2022-02-23 16:50:07,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:50:07" (2/4) ... [2022-02-23 16:50:07,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27676218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 04:50:07, skipping insertion in model container [2022-02-23 16:50:07,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 04:50:07" (3/4) ... [2022-02-23 16:50:07,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27676218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.02 04:50:07, skipping insertion in model container [2022-02-23 16:50:07,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.02 04:50:07" (4/4) ... [2022-02-23 16:50:07,961 INFO L111 eAbstractionObserver]: Analyzing ICFG theatreSquare.cJordan [2022-02-23 16:50:07,965 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-23 16:50:07,965 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-23 16:50:07,999 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-23 16:50:08,005 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-23 16:50:08,005 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-23 16:50:08,014 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-02-23 16:50:08,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-23 16:50:08,020 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:50:08,020 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:50:08,021 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:50:08,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:50:08,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1121522138, now seen corresponding path program 1 times [2022-02-23 16:50:08,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:50:08,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459999181] [2022-02-23 16:50:08,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:50:08,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:50:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:50:08,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:50:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:50:08,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:50:08,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:50:08,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459999181] [2022-02-23 16:50:08,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459999181] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 16:50:08,245 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 16:50:08,245 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-23 16:50:08,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36896134] [2022-02-23 16:50:08,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:50:08,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-23 16:50:08,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:50:08,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-23 16:50:08,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-23 16:50:08,283 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-02-23 16:50:08,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:50:08,433 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-02-23 16:50:08,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-23 16:50:08,436 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-02-23 16:50:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:50:08,444 INFO L225 Difference]: With dead ends: 47 [2022-02-23 16:50:08,444 INFO L226 Difference]: Without dead ends: 32 [2022-02-23 16:50:08,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-23 16:50:08,449 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 16:50:08,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 61 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 12 Unchecked, 0.1s Time] [2022-02-23 16:50:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-23 16:50:08,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-23 16:50:08,473 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-02-23 16:50:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-02-23 16:50:08,475 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2022-02-23 16:50:08,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:50:08,475 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-02-23 16:50:08,475 INFO L471 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-02-23 16:50:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-23 16:50:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-23 16:50:08,477 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:50:08,477 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:50:08,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-23 16:50:08,478 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:50:08,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:50:08,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1342094697, now seen corresponding path program 1 times [2022-02-23 16:50:08,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:50:08,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426708928] [2022-02-23 16:50:08,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:50:08,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:50:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:50:08,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:50:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:50:08,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-23 16:50:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:50:08,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-23 16:50:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:50:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:50:08,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:50:08,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426708928] [2022-02-23 16:50:08,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426708928] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 16:50:08,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 16:50:08,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-23 16:50:08,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395974158] [2022-02-23 16:50:08,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:50:08,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-23 16:50:08,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:50:08,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-23 16:50:08,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-02-23 16:50:08,685 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-02-23 16:50:08,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:50:08,912 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-02-23 16:50:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-23 16:50:08,914 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-02-23 16:50:08,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:50:08,921 INFO L225 Difference]: With dead ends: 48 [2022-02-23 16:50:08,921 INFO L226 Difference]: Without dead ends: 44 [2022-02-23 16:50:08,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-02-23 16:50:08,922 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-02-23 16:50:08,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 80 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 295 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2022-02-23 16:50:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-23 16:50:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-02-23 16:50:08,939 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-02-23 16:50:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-02-23 16:50:08,941 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 31 [2022-02-23 16:50:08,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:50:08,942 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-02-23 16:50:08,942 INFO L471 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-02-23 16:50:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-02-23 16:50:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-23 16:50:08,944 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:50:08,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:50:08,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-23 16:50:08,945 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:50:08,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:50:08,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1260090278, now seen corresponding path program 1 times [2022-02-23 16:50:08,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:50:08,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214757265] [2022-02-23 16:50:08,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:50:08,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:50:08,969 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 16:50:08,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [593830793] [2022-02-23 16:50:08,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:50:08,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:50:08,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:50:08,979 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-02-23 16:50:08,989 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-02-23 16:50:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:50:09,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-23 16:50:09,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:50:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-23 16:50:09,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 16:50:09,093 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:50:09,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214757265] [2022-02-23 16:50:09,094 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 16:50:09,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593830793] [2022-02-23 16:50:09,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593830793] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 16:50:09,094 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 16:50:09,094 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-23 16:50:09,094 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856121254] [2022-02-23 16:50:09,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:50:09,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-23 16:50:09,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:50:09,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-23 16:50:09,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-23 16:50:09,095 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-02-23 16:50:09,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:50:09,106 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-02-23 16:50:09,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-23 16:50:09,107 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-02-23 16:50:09,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:50:09,107 INFO L225 Difference]: With dead ends: 53 [2022-02-23 16:50:09,107 INFO L226 Difference]: Without dead ends: 43 [2022-02-23 16:50:09,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-23 16:50:09,108 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 16:50:09,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-02-23 16:50:09,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-23 16:50:09,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-23 16:50:09,112 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-02-23 16:50:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-02-23 16:50:09,112 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 32 [2022-02-23 16:50:09,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:50:09,112 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-02-23 16:50:09,112 INFO L471 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-02-23 16:50:09,113 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-02-23 16:50:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-23 16:50:09,113 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:50:09,113 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:50:09,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-23 16:50:09,355 WARN L452 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-02-23 16:50:09,356 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:50:09,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:50:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1007047745, now seen corresponding path program 1 times [2022-02-23 16:50:09,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:50:09,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152841604] [2022-02-23 16:50:09,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:50:09,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:50:09,364 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 16:50:09,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [334060388] [2022-02-23 16:50:09,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:50:09,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:50:09,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:50:09,369 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-02-23 16:50:09,375 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-02-23 16:50:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:50:09,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-23 16:50:09,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:50:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-23 16:50:09,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 16:50:09,480 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:50:09,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152841604] [2022-02-23 16:50:09,480 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 16:50:09,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334060388] [2022-02-23 16:50:09,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334060388] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 16:50:09,480 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 16:50:09,480 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-23 16:50:09,480 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658159092] [2022-02-23 16:50:09,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:50:09,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-23 16:50:09,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:50:09,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-23 16:50:09,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-23 16:50:09,481 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-02-23 16:50:09,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:50:09,519 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-02-23 16:50:09,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-23 16:50:09,520 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-02-23 16:50:09,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:50:09,521 INFO L225 Difference]: With dead ends: 53 [2022-02-23 16:50:09,521 INFO L226 Difference]: Without dead ends: 44 [2022-02-23 16:50:09,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-23 16:50:09,525 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 16:50:09,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 129 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-02-23 16:50:09,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-23 16:50:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-23 16:50:09,534 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-02-23 16:50:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-02-23 16:50:09,535 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 33 [2022-02-23 16:50:09,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:50:09,535 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-02-23 16:50:09,535 INFO L471 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-02-23 16:50:09,536 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-02-23 16:50:09,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-23 16:50:09,536 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:50:09,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:50:09,560 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-02-23 16:50:09,751 WARN L452 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-02-23 16:50:09,752 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:50:09,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:50:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash 111102768, now seen corresponding path program 1 times [2022-02-23 16:50:09,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:50:09,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928927812] [2022-02-23 16:50:09,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:50:09,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:50:09,759 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 16:50:09,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [802265324] [2022-02-23 16:50:09,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:50:09,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:50:09,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:50:09,761 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-02-23 16:50:09,762 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-02-23 16:50:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:50:09,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-23 16:50:09,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:50:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-23 16:50:09,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 16:50:09,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:50:09,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928927812] [2022-02-23 16:50:09,879 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 16:50:09,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802265324] [2022-02-23 16:50:09,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802265324] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 16:50:09,879 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 16:50:09,879 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-23 16:50:09,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567005661] [2022-02-23 16:50:09,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:50:09,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-23 16:50:09,880 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:50:09,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-23 16:50:09,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-23 16:50:09,880 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-02-23 16:50:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:50:09,892 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-02-23 16:50:09,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-23 16:50:09,893 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-02-23 16:50:09,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:50:09,893 INFO L225 Difference]: With dead ends: 55 [2022-02-23 16:50:09,893 INFO L226 Difference]: Without dead ends: 45 [2022-02-23 16:50:09,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-23 16:50:09,894 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 16:50:09,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-02-23 16:50:09,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-23 16:50:09,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-02-23 16:50:09,899 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-02-23 16:50:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-02-23 16:50:09,900 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 34 [2022-02-23 16:50:09,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:50:09,900 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-02-23 16:50:09,900 INFO L471 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-02-23 16:50:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-02-23 16:50:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-23 16:50:09,901 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:50:09,901 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:50:09,932 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-02-23 16:50:10,132 WARN L452 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-02-23 16:50:10,133 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:50:10,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:50:10,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1980049385, now seen corresponding path program 1 times [2022-02-23 16:50:10,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:50:10,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013207904] [2022-02-23 16:50:10,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:50:10,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:50:10,141 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 16:50:10,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1531572471] [2022-02-23 16:50:10,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:50:10,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:50:10,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:50:10,146 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-02-23 16:50:10,147 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-02-23 16:50:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:50:10,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-23 16:50:10,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:50:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 16:50:10,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 16:50:10,247 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:50:10,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013207904] [2022-02-23 16:50:10,247 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 16:50:10,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531572471] [2022-02-23 16:50:10,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531572471] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 16:50:10,247 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 16:50:10,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-23 16:50:10,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42870344] [2022-02-23 16:50:10,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:50:10,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-23 16:50:10,248 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:50:10,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-23 16:50:10,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-23 16:50:10,248 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-02-23 16:50:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:50:10,264 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-02-23 16:50:10,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-23 16:50:10,264 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-02-23 16:50:10,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:50:10,268 INFO L225 Difference]: With dead ends: 55 [2022-02-23 16:50:10,268 INFO L226 Difference]: Without dead ends: 46 [2022-02-23 16:50:10,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-23 16:50:10,269 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 16:50:10,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-02-23 16:50:10,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-23 16:50:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-23 16:50:10,275 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-02-23 16:50:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-02-23 16:50:10,275 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 35 [2022-02-23 16:50:10,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:50:10,275 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-02-23 16:50:10,276 INFO L471 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-02-23 16:50:10,276 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-02-23 16:50:10,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-23 16:50:10,276 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:50:10,276 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:50:10,294 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-02-23 16:50:10,493 WARN L452 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-02-23 16:50:10,494 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:50:10,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:50:10,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1173604042, now seen corresponding path program 1 times [2022-02-23 16:50:10,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:50:10,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516039881] [2022-02-23 16:50:10,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:50:10,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:50:10,501 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 16:50:10,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [346271345] [2022-02-23 16:50:10,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:50:10,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:50:10,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:50:10,513 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-02-23 16:50:10,519 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-02-23 16:50:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:50:10,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-23 16:50:10,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:50:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 16:50:12,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:50:12,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 16:50:12,417 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:50:12,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516039881] [2022-02-23 16:50:12,417 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 16:50:12,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346271345] [2022-02-23 16:50:12,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346271345] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-23 16:50:12,417 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-23 16:50:12,417 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2022-02-23 16:50:12,417 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286168695] [2022-02-23 16:50:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:50:12,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-23 16:50:12,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:50:12,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-23 16:50:12,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-23 16:50:12,418 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 16:50:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:50:12,445 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-02-23 16:50:12,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-23 16:50:12,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-02-23 16:50:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:50:12,446 INFO L225 Difference]: With dead ends: 44 [2022-02-23 16:50:12,446 INFO L226 Difference]: Without dead ends: 41 [2022-02-23 16:50:12,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-23 16:50:12,447 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 16:50:12,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 154 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-02-23 16:50:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-23 16:50:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-02-23 16:50:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 16:50:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-02-23 16:50:12,449 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 36 [2022-02-23 16:50:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:50:12,449 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-02-23 16:50:12,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 16:50:12,449 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-02-23 16:50:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-23 16:50:12,450 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:50:12,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:50:12,468 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-02-23 16:50:12,650 WARN L452 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-02-23 16:50:12,651 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:50:12,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:50:12,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1887612187, now seen corresponding path program 1 times [2022-02-23 16:50:12,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:50:12,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451861626] [2022-02-23 16:50:12,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:50:12,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:50:12,657 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 16:50:12,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [335639673] [2022-02-23 16:50:12,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:50:12,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:50:12,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:50:12,676 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 16:50:12,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-23 16:50:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:50:12,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-23 16:50:12,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:50:18,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 16:50:18,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:50:18,668 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-23 16:50:18,669 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:50:18,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451861626] [2022-02-23 16:50:18,669 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 16:50:18,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335639673] [2022-02-23 16:50:18,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335639673] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-23 16:50:18,669 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-23 16:50:18,669 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2022-02-23 16:50:18,669 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795765447] [2022-02-23 16:50:18,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:50:18,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-23 16:50:18,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:50:18,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-23 16:50:18,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-23 16:50:18,670 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-23 16:50:18,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:50:18,701 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-02-23 16:50:18,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-23 16:50:18,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-02-23 16:50:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:50:18,702 INFO L225 Difference]: With dead ends: 41 [2022-02-23 16:50:18,702 INFO L226 Difference]: Without dead ends: 38 [2022-02-23 16:50:18,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-23 16:50:18,703 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 15 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 16:50:18,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 147 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 3 Unchecked, 0.0s Time] [2022-02-23 16:50:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-23 16:50:18,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-23 16:50:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 16:50:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-02-23 16:50:18,705 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 36 [2022-02-23 16:50:18,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:50:18,705 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-02-23 16:50:18,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-23 16:50:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-02-23 16:50:18,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-23 16:50:18,706 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:50:18,706 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:50:18,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-23 16:50:18,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:50:18,915 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:50:18,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:50:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1698211422, now seen corresponding path program 1 times [2022-02-23 16:50:18,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:50:18,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866471405] [2022-02-23 16:50:18,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:50:18,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:50:18,921 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 16:50:18,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [883887326] [2022-02-23 16:50:18,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:50:18,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:50:18,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:50:18,927 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 16:50:18,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-23 16:50:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:50:19,399 WARN L261 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-23 16:50:19,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:50:20,483 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:50:20,933 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:50:21,223 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:50:47,363 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:50:47,905 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:51:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:51:25,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:51:33,640 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:51:35,335 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:51:45,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:51:45,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866471405] [2022-02-23 16:51:45,140 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 16:51:45,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883887326] [2022-02-23 16:51:45,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883887326] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:51:45,140 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-23 16:51:45,140 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2022-02-23 16:51:45,141 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608008566] [2022-02-23 16:51:45,141 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-23 16:51:45,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-23 16:51:45,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:51:45,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-23 16:51:45,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=794, Unknown=14, NotChecked=0, Total=870 [2022-02-23 16:51:45,142 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 16:51:45,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:51:45,338 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2022-02-23 16:51:45,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-23 16:51:45,338 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-02-23 16:51:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:51:45,339 INFO L225 Difference]: With dead ends: 62 [2022-02-23 16:51:45,339 INFO L226 Difference]: Without dead ends: 58 [2022-02-23 16:51:45,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 49.8s TimeCoverageRelationStatistics Valid=66, Invalid=850, Unknown=14, NotChecked=0, Total=930 [2022-02-23 16:51:45,340 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 16:51:45,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 418 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 94 Unchecked, 0.0s Time] [2022-02-23 16:51:45,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-23 16:51:45,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-02-23 16:51:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 48 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-23 16:51:45,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2022-02-23 16:51:45,343 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 37 [2022-02-23 16:51:45,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:51:45,343 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2022-02-23 16:51:45,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 16:51:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-02-23 16:51:45,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-23 16:51:45,344 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:51:45,344 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:51:45,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-23 16:51:45,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:51:45,562 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:51:45,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:51:45,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1189593605, now seen corresponding path program 2 times [2022-02-23 16:51:45,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:51:45,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468642562] [2022-02-23 16:51:45,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:51:45,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:51:45,568 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 16:51:45,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077192478] [2022-02-23 16:51:45,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 16:51:45,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:51:45,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:51:45,570 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 16:51:45,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-23 16:51:46,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 16:51:46,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 16:51:46,175 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 79 conjunts are in the unsatisfiable core [2022-02-23 16:51:46,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:51:47,725 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:51:48,286 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:51:48,612 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:52:16,214 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:52:16,555 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:52:18,063 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:52:18,142 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:53:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:53:23,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:53:34,779 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:53:35,459 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:53:39,165 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:53:44,482 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:53:44,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468642562] [2022-02-23 16:53:44,482 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 16:53:44,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077192478] [2022-02-23 16:53:44,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077192478] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:53:44,482 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-23 16:53:44,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-02-23 16:53:44,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937204198] [2022-02-23 16:53:44,483 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-23 16:53:44,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-23 16:53:44,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:53:44,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-23 16:53:44,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=844, Unknown=20, NotChecked=0, Total=930 [2022-02-23 16:53:44,484 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 16:53:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:53:44,673 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-02-23 16:53:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-23 16:53:44,673 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2022-02-23 16:53:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:53:44,675 INFO L225 Difference]: With dead ends: 66 [2022-02-23 16:53:44,675 INFO L226 Difference]: Without dead ends: 62 [2022-02-23 16:53:44,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 68.0s TimeCoverageRelationStatistics Valid=70, Invalid=902, Unknown=20, NotChecked=0, Total=992 [2022-02-23 16:53:44,676 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 16:53:44,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 506 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 153 Unchecked, 0.0s Time] [2022-02-23 16:53:44,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-23 16:53:44,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2022-02-23 16:53:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 49 states have internal predecessors, (60), 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-02-23 16:53:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-02-23 16:53:44,679 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 38 [2022-02-23 16:53:44,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:53:44,680 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-02-23 16:53:44,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 16:53:44,680 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-02-23 16:53:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-23 16:53:44,680 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:53:44,681 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:53:44,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-23 16:53:44,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-23 16:53:44,887 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:53:44,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:53:44,887 INFO L85 PathProgramCache]: Analyzing trace with hash 764427933, now seen corresponding path program 3 times [2022-02-23 16:53:44,887 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:53:44,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528242650] [2022-02-23 16:53:44,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:53:44,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:53:44,892 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 16:53:44,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1616883900] [2022-02-23 16:53:44,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-23 16:53:44,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:53:44,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:53:44,897 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 16:53:44,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-23 16:53:46,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-23 16:53:46,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 16:53:46,460 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 79 conjunts are in the unsatisfiable core [2022-02-23 16:53:46,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:53:48,103 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:53:48,801 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:53:49,270 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:54:18,272 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:54:19,125 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:54:21,682 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:55:16,070 WARN L860 $PredicateComparison]: unable to prove that (exists ((main_~m~0 Int) (main_~n~0 Int) (main_~a~0 Int)) (and (<= 1 main_~n~0) (<= 1 main_~m~0) (exists ((student_version_~i~1 Int) (student_version_~j~1 Int)) (and (exists ((v_student_version_~j~1_26 Int)) (and (let ((.cse0 (* main_~a~0 v_student_version_~j~1_26))) (or (and (not (< (* main_~a~0 student_version_~j~1) main_~m~0)) (forall ((v_it_4 Int)) (or (< (+ (* v_it_4 main_~a~0) (* main_~a~0 v_student_version_~j~1_26)) main_~m~0) (not (<= (+ v_it_4 v_student_version_~j~1_26 1) student_version_~j~1)))) (< .cse0 main_~m~0)) (and (<= main_~m~0 .cse0) (= student_version_~j~1 v_student_version_~j~1_26)))) (< 0 v_student_version_~j~1_26) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) v_student_version_~j~1_26)) (< (* v_it_4 main_~a~0) main_~m~0))))) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (let ((.cse1 (= student_version_~j~1 0))) (or (and (= |c_main_#t~ret9| 0) .cse1) (let ((.cse2 (div |c_main_#t~ret9| student_version_~j~1))) (and (< .cse2 (+ student_version_~i~1 1)) (not .cse1) (= (mod |c_main_#t~ret9| student_version_~j~1) 0) (not (< .cse2 student_version_~i~1)))))) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (< 0 student_version_~i~1))) (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int)) (let ((.cse3 (div c_main_~n_stones1~0 correct_version_~j~0))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (<= correct_version_~i~0 .cse3) (= (mod c_main_~n_stones1~0 correct_version_~j~0) 0) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (< .cse3 (+ correct_version_~i~0 1)) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0)))))))) is different from true [2022-02-23 16:56:28,613 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_main_~n_stones1~0_BEFORE_CALL_6 Int) (v_main_~n_stones2~0_BEFORE_CALL_3 Int)) (and (or (<= 1 |c___VERIFIER_assert_#in~cond|) (and (not (= v_main_~n_stones1~0_BEFORE_CALL_6 v_main_~n_stones2~0_BEFORE_CALL_3)) (<= 0 |c___VERIFIER_assert_#in~cond|))) (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int) (main_~m~0 Int) (main_~n~0 Int) (main_~a~0 Int) (student_version_~i~1 Int) (student_version_~j~1 Int)) (let ((.cse1 (div v_main_~n_stones1~0_BEFORE_CALL_6 correct_version_~j~0))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (<= 1 main_~n~0) (exists ((v_student_version_~j~1_26 Int)) (and (let ((.cse0 (* main_~a~0 v_student_version_~j~1_26))) (or (and (not (< (* main_~a~0 student_version_~j~1) main_~m~0)) (forall ((v_it_4 Int)) (or (< (+ (* v_it_4 main_~a~0) (* main_~a~0 v_student_version_~j~1_26)) main_~m~0) (not (<= (+ v_it_4 v_student_version_~j~1_26 1) student_version_~j~1)))) (< .cse0 main_~m~0)) (and (<= main_~m~0 .cse0) (= student_version_~j~1 v_student_version_~j~1_26)))) (< 0 v_student_version_~j~1_26) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) v_student_version_~j~1_26)) (< (* v_it_4 main_~a~0) main_~m~0))))) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (<= 1 main_~m~0) (= (mod v_main_~n_stones1~0_BEFORE_CALL_6 correct_version_~j~0) 0) (<= correct_version_~i~0 .cse1) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (< .cse1 (+ correct_version_~i~0 1)) (let ((.cse2 (= student_version_~j~1 0))) (or (and (= v_main_~n_stones2~0_BEFORE_CALL_3 0) .cse2) (let ((.cse3 (div v_main_~n_stones2~0_BEFORE_CALL_3 student_version_~j~1))) (and (= (mod v_main_~n_stones2~0_BEFORE_CALL_3 student_version_~j~1) 0) (not (< .cse3 student_version_~i~1)) (< .cse3 (+ student_version_~i~1 1)) (not .cse2))))) (< 0 student_version_~i~1) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0)))))))) is different from false [2022-02-23 16:57:21,210 WARN L838 $PredicateComparison]: unable to prove that (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int) (main_~m~0 Int) (main_~n~0 Int) (v_main_~n_stones1~0_BEFORE_CALL_6 Int) (main_~a~0 Int) (student_version_~i~1 Int) (student_version_~j~1 Int) (v_main_~n_stones2~0_BEFORE_CALL_3 Int)) (let ((.cse1 (div v_main_~n_stones1~0_BEFORE_CALL_6 correct_version_~j~0))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (<= 1 main_~n~0) (exists ((v_student_version_~j~1_26 Int)) (and (let ((.cse0 (* main_~a~0 v_student_version_~j~1_26))) (or (and (not (< (* main_~a~0 student_version_~j~1) main_~m~0)) (forall ((v_it_4 Int)) (or (< (+ (* v_it_4 main_~a~0) (* main_~a~0 v_student_version_~j~1_26)) main_~m~0) (not (<= (+ v_it_4 v_student_version_~j~1_26 1) student_version_~j~1)))) (< .cse0 main_~m~0)) (and (<= main_~m~0 .cse0) (= student_version_~j~1 v_student_version_~j~1_26)))) (< 0 v_student_version_~j~1_26) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) v_student_version_~j~1_26)) (< (* v_it_4 main_~a~0) main_~m~0))))) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (<= 1 main_~m~0) (= (mod v_main_~n_stones1~0_BEFORE_CALL_6 correct_version_~j~0) 0) (<= correct_version_~i~0 .cse1) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (or (<= 1 c___VERIFIER_assert_~cond) (and (not (= v_main_~n_stones1~0_BEFORE_CALL_6 v_main_~n_stones2~0_BEFORE_CALL_3)) (<= 0 c___VERIFIER_assert_~cond))) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (< .cse1 (+ correct_version_~i~0 1)) (let ((.cse2 (= student_version_~j~1 0))) (or (and (= v_main_~n_stones2~0_BEFORE_CALL_3 0) .cse2) (let ((.cse3 (div v_main_~n_stones2~0_BEFORE_CALL_3 student_version_~j~1))) (and (= (mod v_main_~n_stones2~0_BEFORE_CALL_3 student_version_~j~1) 0) (not (< .cse3 student_version_~i~1)) (< .cse3 (+ student_version_~i~1 1)) (not .cse2))))) (< 0 student_version_~i~1) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0)))))) is different from false [2022-02-23 16:57:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:57:22,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:58:04,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:58:04,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528242650] [2022-02-23 16:58:04,097 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 16:58:04,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616883900] [2022-02-23 16:58:04,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616883900] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:58:04,097 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-23 16:58:04,097 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-02-23 16:58:04,097 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180486712] [2022-02-23 16:58:04,097 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-23 16:58:04,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-23 16:58:04,098 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:58:04,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-23 16:58:04,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=791, Unknown=24, NotChecked=174, Total=1056 [2022-02-23 16:58:04,098 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 16:58:20,083 WARN L232 SmtUtils]: Spent 6.82s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-23 16:58:20,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:58:20,085 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-02-23 16:58:20,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-23 16:58:20,086 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2022-02-23 16:58:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:58:20,086 INFO L225 Difference]: With dead ends: 70 [2022-02-23 16:58:20,086 INFO L226 Difference]: Without dead ends: 66 [2022-02-23 16:58:20,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 79.1s TimeCoverageRelationStatistics Valid=77, Invalid=900, Unknown=27, NotChecked=186, Total=1190 [2022-02-23 16:58:20,087 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 247 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 16:58:20,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 475 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 247 Unchecked, 0.0s Time] [2022-02-23 16:58:20,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-23 16:58:20,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2022-02-23 16:58:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.28) internal successors, (64), 52 states have internal predecessors, (64), 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-02-23 16:58:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-02-23 16:58:20,095 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 38 [2022-02-23 16:58:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:58:20,095 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2022-02-23 16:58:20,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 16:58:20,095 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2022-02-23 16:58:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-23 16:58:20,095 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:58:20,098 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:58:20,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-23 16:58:20,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:58:20,305 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:58:20,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:58:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash 504805571, now seen corresponding path program 4 times [2022-02-23 16:58:20,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:58:20,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176068804] [2022-02-23 16:58:20,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:58:20,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:58:20,310 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 16:58:20,311 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [320054218] [2022-02-23 16:58:20,311 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-23 16:58:20,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:58:20,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:58:20,322 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 16:58:20,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-23 16:58:27,510 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-23 16:58:27,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 16:58:27,513 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 81 conjunts are in the unsatisfiable core [2022-02-23 16:58:27,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:58:29,314 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:58:29,950 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:58:30,327 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:59:12,585 WARN L232 SmtUtils]: Spent 12.28s on a formula simplification. DAG size of input: 48 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-23 16:59:19,429 WARN L232 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-23 16:59:26,409 WARN L232 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 59 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-23 16:59:27,115 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 16:59:28,031 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 17:00:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 17:00:31,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 17:00:39,154 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 17:00:40,021 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 17:00:43,094 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 17:00:47,058 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 17:00:47,805 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 17:00:50,761 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 17:00:55,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 17:00:55,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176068804] [2022-02-23 17:00:55,724 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-23 17:00:55,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320054218] [2022-02-23 17:00:55,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320054218] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 17:00:55,725 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-23 17:00:55,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2022-02-23 17:00:55,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437038276] [2022-02-23 17:00:55,725 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-23 17:00:55,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-23 17:00:55,725 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 17:00:55,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-23 17:00:55,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=909, Unknown=17, NotChecked=0, Total=992 [2022-02-23 17:00:55,726 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 29 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 17:01:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 17:01:01,537 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2022-02-23 17:01:01,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-23 17:01:01,539 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2022-02-23 17:01:01,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 17:01:01,540 INFO L225 Difference]: With dead ends: 75 [2022-02-23 17:01:01,540 INFO L226 Difference]: Without dead ends: 71 [2022-02-23 17:01:01,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 88.0s TimeCoverageRelationStatistics Valid=82, Invalid=1159, Unknown=19, NotChecked=0, Total=1260 [2022-02-23 17:01:01,541 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 17:01:01,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 577 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 224 Unchecked, 0.1s Time] [2022-02-23 17:01:01,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-23 17:01:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2022-02-23 17:01:01,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 54 states have internal predecessors, (67), 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-02-23 17:01:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2022-02-23 17:01:01,544 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 38 [2022-02-23 17:01:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 17:01:01,544 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2022-02-23 17:01:01,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 17:01:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2022-02-23 17:01:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-23 17:01:01,545 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 17:01:01,545 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 17:01:01,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-23 17:01:01,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-23 17:01:01,758 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 17:01:01,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 17:01:01,758 INFO L85 PathProgramCache]: Analyzing trace with hash -781171018, now seen corresponding path program 5 times [2022-02-23 17:01:01,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 17:01:01,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483853839] [2022-02-23 17:01:01,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 17:01:01,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 17:01:01,786 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-23 17:01:01,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124045280] [2022-02-23 17:01:01,786 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-23 17:01:01,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 17:01:01,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 17:01:01,791 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 17:01:01,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-23 17:01:03,088 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 17:01:03,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 17:01:03,091 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-23 17:01:03,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 17:01:06,438 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 17:01:07,341 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 17:01:08,709 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 17:01:08,991 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 17:01:09,882 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 17:01:51,214 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 17:01:52,350 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-02-23 17:02:55,404 WARN L860 $PredicateComparison]: unable to prove that (exists ((correct_version_~j~0 Int) (correct_version_~i~0 Int) (main_~m~0 Int) (main_~n~0 Int) (main_~a~0 Int) (student_version_~i~1 Int) (student_version_~j~1 Int)) (let ((.cse1 (= student_version_~j~1 0)) (.cse0 (div c_main_~n_stones1~0 correct_version_~j~0))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (<= 1 main_~n~0) (<= correct_version_~i~0 .cse0) (= (mod c_main_~n_stones1~0 correct_version_~j~0) 0) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (or (and .cse1 (<= main_~m~0 0)) (and (< 0 main_~m~0) (not (< (* main_~a~0 student_version_~j~1) main_~m~0)) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) student_version_~j~1)) (< (* v_it_4 main_~a~0) main_~m~0))))) (< 0 correct_version_~j~0) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (or (let ((.cse2 (div c_main_~n_stones2~0 student_version_~j~1))) (and (= (mod c_main_~n_stones2~0 student_version_~j~1) 0) (not (< .cse2 student_version_~i~1)) (not .cse1) (< .cse2 (+ student_version_~i~1 1)))) (and (= c_main_~n_stones2~0 0) .cse1)) (< .cse0 (+ correct_version_~i~0 1)) (< 0 student_version_~i~1) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) correct_version_~j~0)) (< (* v_it_2 main_~a~0) main_~m~0)))))) is different from true [2022-02-23 17:04:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 17:04:34,843 INFO L328 TraceCheckSpWp]: Computing backward predicates...