/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-7390193 [2022-04-05 01:11:08,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 01:11:08,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 01:11:09,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 01:11:09,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 01:11:09,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 01:11:09,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 01:11:09,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 01:11:09,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 01:11:09,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 01:11:09,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 01:11:09,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 01:11:09,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 01:11:09,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 01:11:09,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 01:11:09,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 01:11:09,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 01:11:09,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 01:11:09,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 01:11:09,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 01:11:09,040 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 01:11:09,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 01:11:09,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 01:11:09,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 01:11:09,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 01:11:09,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 01:11:09,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 01:11:09,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 01:11:09,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 01:11:09,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 01:11:09,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 01:11:09,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 01:11:09,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 01:11:09,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 01:11:09,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 01:11:09,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 01:11:09,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 01:11:09,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 01:11:09,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 01:11:09,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 01:11:09,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 01:11:09,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 01:11:09,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-05 01:11:09,073 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 01:11:09,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 01:11:09,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 01:11:09,075 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-05 01:11:09,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 01:11:09,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-05 01:11:09,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 01:11:09,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 01:11:09,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 01:11:09,076 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 01:11:09,077 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-05 01:11:09,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 01:11:09,077 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 01:11:09,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 01:11:09,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 01:11:09,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 01:11:09,077 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-05 01:11:09,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 01:11:09,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 01:11:09,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 01:11:09,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 01:11:09,079 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 01:11:09,079 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-05 01:11:09,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 01:11:09,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 01:11:09,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 01:11:09,315 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 01:11:09,315 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 01:11:09,317 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/theatreSquare.c [2022-04-05 01:11:09,373 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1948546/61014d13d4a34eef970c879500fa944c/FLAGb81a5f269 [2022-04-05 01:11:09,817 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 01:11:09,817 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c [2022-04-05 01:11:09,825 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1948546/61014d13d4a34eef970c879500fa944c/FLAGb81a5f269 [2022-04-05 01:11:09,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e1948546/61014d13d4a34eef970c879500fa944c [2022-04-05 01:11:09,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 01:11:09,842 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 01:11:09,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 01:11:09,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 01:11:09,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 01:11:09,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 01:11:09" (1/1) ... [2022-04-05 01:11:09,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2d6b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:11:09, skipping insertion in model container [2022-04-05 01:11:09,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 01:11:09" (1/1) ... [2022-04-05 01:11:09,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 01:11:09,874 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 01:11:10,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c[370,383] [2022-04-05 01:11:10,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 01:11:10,047 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 01:11:10,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c[370,383] [2022-04-05 01:11:10,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 01:11:10,085 INFO L208 MainTranslator]: Completed translation [2022-04-05 01:11:10,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:11:10 WrapperNode [2022-04-05 01:11:10,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 01:11:10,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 01:11:10,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 01:11:10,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 01:11:10,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:11:10" (1/1) ... [2022-04-05 01:11:10,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:11:10" (1/1) ... [2022-04-05 01:11:10,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:11:10" (1/1) ... [2022-04-05 01:11:10,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:11:10" (1/1) ... [2022-04-05 01:11:10,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:11:10" (1/1) ... [2022-04-05 01:11:10,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:11:10" (1/1) ... [2022-04-05 01:11:10,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:11:10" (1/1) ... [2022-04-05 01:11:10,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 01:11:10,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 01:11:10,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 01:11:10,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 01:11:10,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:11:10" (1/1) ... [2022-04-05 01:11:10,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 01:11:10,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:11:10,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-05 01:11:10,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-05 01:11:10,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 01:11:10,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 01:11:10,197 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 01:11:10,197 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-05 01:11:10,197 INFO L138 BoogieDeclarations]: Found implementation of procedure correct_version [2022-04-05 01:11:10,198 INFO L138 BoogieDeclarations]: Found implementation of procedure student_version [2022-04-05 01:11:10,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 01:11:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 01:11:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 01:11:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 01:11:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 01:11:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-05 01:11:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-05 01:11:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure correct_version [2022-04-05 01:11:10,200 INFO L130 BoogieDeclarations]: Found specification of procedure student_version [2022-04-05 01:11:10,201 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 01:11:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 01:11:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 01:11:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 01:11:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 01:11:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 01:11:10,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 01:11:10,297 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 01:11:10,299 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 01:11:10,543 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 01:11:10,549 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 01:11:10,549 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-05 01:11:10,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 01:11:10 BoogieIcfgContainer [2022-04-05 01:11:10,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 01:11:10,558 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 01:11:10,558 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 01:11:10,559 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 01:11:10,562 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 01:11:10" (1/1) ... [2022-04-05 01:11:10,564 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-05 01:11:10,838 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-05 01:11:10,839 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_correct_version_~i~0_5 1) v_correct_version_~i~0_4) (= (+ v_correct_version_~b~0_4 v_correct_version_~a_2) v_correct_version_~b~0_3) (< v_correct_version_~b~0_4 v_correct_version_~n_3)) InVars {correct_version_~n=v_correct_version_~n_3, correct_version_~b~0=v_correct_version_~b~0_4, correct_version_~i~0=v_correct_version_~i~0_5, correct_version_~a=v_correct_version_~a_2} OutVars{correct_version_~n=v_correct_version_~n_3, correct_version_~b~0=v_correct_version_~b~0_3, correct_version_~i~0=v_correct_version_~i~0_4, correct_version_~a=v_correct_version_~a_2} AuxVars[] AssignedVars[correct_version_~b~0, correct_version_~i~0] to Formula: (or (and (= v_correct_version_~i~0_5 v_correct_version_~i~0_4) (= v_correct_version_~b~0_3 v_correct_version_~b~0_4) (<= v_correct_version_~n_3 v_correct_version_~b~0_4)) (and (= (+ (* v_correct_version_~a_2 (+ (* (- 1) v_correct_version_~i~0_5) v_correct_version_~i~0_4)) v_correct_version_~b~0_4) v_correct_version_~b~0_3) (< v_correct_version_~i~0_5 v_correct_version_~i~0_4) (forall ((v_it_1 Int)) (or (< (+ v_correct_version_~b~0_4 (* v_it_1 v_correct_version_~a_2)) v_correct_version_~n_3) (not (<= 1 v_it_1)) (not (<= (+ v_it_1 v_correct_version_~i~0_5 1) v_correct_version_~i~0_4)))) (< v_correct_version_~b~0_4 v_correct_version_~n_3))) InVars {correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_5, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_4} OutVars{correct_version_~n=v_correct_version_~n_3, correct_version_~i~0=v_correct_version_~i~0_4, correct_version_~a=v_correct_version_~a_2, correct_version_~b~0=v_correct_version_~b~0_3} AuxVars[] AssignedVars[correct_version_~b~0, correct_version_~i~0] [2022-04-05 01:11:10,940 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-05 01:11:10,941 INFO L91 elerationTransformer]: Accelerated Formula: (and (< v_correct_version_~l~0_4 v_correct_version_~m_3) (= (+ v_correct_version_~l~0_4 v_correct_version_~a_3) v_correct_version_~l~0_3) (= (+ v_correct_version_~j~0_4 1) v_correct_version_~j~0_3)) InVars {correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_4, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_4} OutVars{correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_3, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_3} AuxVars[] AssignedVars[correct_version_~l~0, correct_version_~j~0] to Formula: (or (and (<= v_correct_version_~m_3 v_correct_version_~l~0_4) (= v_correct_version_~l~0_4 v_correct_version_~l~0_3) (= v_correct_version_~j~0_4 v_correct_version_~j~0_3)) (and (= (+ (* (+ (* (- 1) v_correct_version_~j~0_4) v_correct_version_~j~0_3) v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~l~0_3) (< v_correct_version_~j~0_4 v_correct_version_~j~0_3) (< v_correct_version_~l~0_4 v_correct_version_~m_3) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 v_correct_version_~j~0_4 1) v_correct_version_~j~0_3)) (< (+ (* v_it_2 v_correct_version_~a_3) v_correct_version_~l~0_4) v_correct_version_~m_3))))) InVars {correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_4, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_4} OutVars{correct_version_~m=v_correct_version_~m_3, correct_version_~l~0=v_correct_version_~l~0_3, correct_version_~a=v_correct_version_~a_3, correct_version_~j~0=v_correct_version_~j~0_3} AuxVars[] AssignedVars[correct_version_~l~0, correct_version_~j~0] [2022-04-05 01:11:11,008 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-05 01:11:11,009 INFO L91 elerationTransformer]: Accelerated Formula: (and (< v_student_version_~b~1_2 v_student_version_~n_1) (= (+ v_student_version_~i~1_2 1) v_student_version_~i~1_1) (= v_student_version_~b~1_1 (+ v_student_version_~a_1 v_student_version_~b~1_2))) InVars {student_version_~i~1=v_student_version_~i~1_2, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_2, student_version_~n=v_student_version_~n_1} OutVars{student_version_~i~1=v_student_version_~i~1_1, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_1, student_version_~n=v_student_version_~n_1} AuxVars[] AssignedVars[student_version_~i~1, student_version_~b~1] to Formula: (or (and (<= v_student_version_~n_1 v_student_version_~b~1_2) (= v_student_version_~b~1_2 v_student_version_~b~1_1) (= v_student_version_~i~1_2 v_student_version_~i~1_1)) (and (< v_student_version_~i~1_2 v_student_version_~i~1_1) (= (+ v_student_version_~b~1_2 (* (+ v_student_version_~i~1_1 (* (- 1) v_student_version_~i~1_2)) v_student_version_~a_1)) v_student_version_~b~1_1) (< v_student_version_~b~1_2 v_student_version_~n_1) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 v_student_version_~i~1_2 1) v_student_version_~i~1_1)) (< (+ v_student_version_~b~1_2 (* v_student_version_~a_1 v_it_3)) v_student_version_~n_1))))) InVars {student_version_~i~1=v_student_version_~i~1_2, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_2, student_version_~n=v_student_version_~n_1} OutVars{student_version_~i~1=v_student_version_~i~1_1, student_version_~a=v_student_version_~a_1, student_version_~b~1=v_student_version_~b~1_1, student_version_~n=v_student_version_~n_1} AuxVars[] AssignedVars[student_version_~i~1, student_version_~b~1] [2022-04-05 01:11:11,067 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-05 01:11:11,068 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_student_version_~j~1_2 1) v_student_version_~j~1_1) (< v_student_version_~l~1_3 v_student_version_~m_2) (= (+ v_student_version_~a_2 v_student_version_~l~1_3) v_student_version_~l~1_2)) InVars {student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_2, student_version_~l~1=v_student_version_~l~1_3, student_version_~m=v_student_version_~m_2} OutVars{student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_1, student_version_~l~1=v_student_version_~l~1_2, student_version_~m=v_student_version_~m_2} AuxVars[] AssignedVars[student_version_~j~1, student_version_~l~1] to Formula: (or (and (= v_student_version_~l~1_3 v_student_version_~l~1_2) (<= v_student_version_~m_2 v_student_version_~l~1_3) (= v_student_version_~j~1_2 v_student_version_~j~1_1)) (and (= (+ v_student_version_~l~1_3 (* (+ v_student_version_~j~1_1 (* (- 1) v_student_version_~j~1_2)) v_student_version_~a_2)) v_student_version_~l~1_2) (< v_student_version_~j~1_2 v_student_version_~j~1_1) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 v_student_version_~j~1_2 1) v_student_version_~j~1_1)) (not (<= 1 v_it_4)) (< (+ (* v_student_version_~a_2 v_it_4) v_student_version_~l~1_3) v_student_version_~m_2))) (< v_student_version_~l~1_3 v_student_version_~m_2))) InVars {student_version_~l~1=v_student_version_~l~1_3, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_2, student_version_~m=v_student_version_~m_2} OutVars{student_version_~l~1=v_student_version_~l~1_2, student_version_~a=v_student_version_~a_2, student_version_~j~1=v_student_version_~j~1_1, student_version_~m=v_student_version_~m_2} AuxVars[] AssignedVars[student_version_~j~1, student_version_~l~1] [2022-04-05 01:11:11,161 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-05 01:11:11,162 INFO L91 elerationTransformer]: Accelerated Formula: (and (< v_correct_version_~x~0_3 v_correct_version_~i~0_3) (= (+ v_correct_version_~j~0_2 v_correct_version_~y~0_2) v_correct_version_~y~0_1) (= (+ v_correct_version_~x~0_3 1) v_correct_version_~x~0_2)) InVars {correct_version_~y~0=v_correct_version_~y~0_2, correct_version_~x~0=v_correct_version_~x~0_3, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} OutVars{correct_version_~y~0=v_correct_version_~y~0_1, correct_version_~x~0=v_correct_version_~x~0_2, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] to Formula: (or (and (< v_correct_version_~x~0_3 v_correct_version_~x~0_2) (= (+ (* v_correct_version_~j~0_2 v_correct_version_~x~0_2) v_correct_version_~y~0_2) (+ v_correct_version_~y~0_1 (* v_correct_version_~j~0_2 v_correct_version_~x~0_3))) (< v_correct_version_~x~0_2 (+ v_correct_version_~i~0_3 1))) (and (= v_correct_version_~y~0_2 v_correct_version_~y~0_1) (= v_correct_version_~x~0_3 v_correct_version_~x~0_2) (<= v_correct_version_~i~0_3 v_correct_version_~x~0_3))) InVars {correct_version_~y~0=v_correct_version_~y~0_2, correct_version_~x~0=v_correct_version_~x~0_3, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} OutVars{correct_version_~y~0=v_correct_version_~y~0_1, correct_version_~x~0=v_correct_version_~x~0_2, correct_version_~i~0=v_correct_version_~i~0_3, correct_version_~j~0=v_correct_version_~j~0_2} AuxVars[] AssignedVars[correct_version_~y~0, correct_version_~x~0] [2022-04-05 01:11:11,218 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-05 01:11:11,219 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_student_version_~x~1_3 (+ v_student_version_~x~1_4 1)) (= v_student_version_~y~1_2 (+ v_student_version_~j~1_4 v_student_version_~y~1_3)) (< v_student_version_~x~1_4 v_student_version_~i~1_5)) InVars {student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_3, student_version_~x~1=v_student_version_~x~1_4, student_version_~j~1=v_student_version_~j~1_4} OutVars{student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_2, student_version_~x~1=v_student_version_~x~1_3, student_version_~j~1=v_student_version_~j~1_4} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] to Formula: (or (and (= (+ v_student_version_~y~1_2 (* v_student_version_~j~1_4 v_student_version_~x~1_4)) (+ v_student_version_~y~1_3 (* v_student_version_~j~1_4 v_student_version_~x~1_3))) (< v_student_version_~x~1_4 v_student_version_~x~1_3) (< v_student_version_~x~1_3 (+ v_student_version_~i~1_5 1))) (and (= v_student_version_~y~1_3 v_student_version_~y~1_2) (not (< v_student_version_~x~1_4 v_student_version_~i~1_5)) (= v_student_version_~x~1_4 v_student_version_~x~1_3))) InVars {student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_3, student_version_~x~1=v_student_version_~x~1_4, student_version_~j~1=v_student_version_~j~1_4} OutVars{student_version_~i~1=v_student_version_~i~1_5, student_version_~y~1=v_student_version_~y~1_2, student_version_~x~1=v_student_version_~x~1_3, student_version_~j~1=v_student_version_~j~1_4} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] [2022-04-05 01:11:11,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 01:11:11 BasicIcfg [2022-04-05 01:11:11,224 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 01:11:11,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 01:11:11,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 01:11:11,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 01:11:11,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 01:11:09" (1/4) ... [2022-04-05 01:11:11,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1749990f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 01:11:11, skipping insertion in model container [2022-04-05 01:11:11,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 01:11:10" (2/4) ... [2022-04-05 01:11:11,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1749990f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 01:11:11, skipping insertion in model container [2022-04-05 01:11:11,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 01:11:10" (3/4) ... [2022-04-05 01:11:11,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1749990f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 01:11:11, skipping insertion in model container [2022-04-05 01:11:11,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 01:11:11" (4/4) ... [2022-04-05 01:11:11,237 INFO L111 eAbstractionObserver]: Analyzing ICFG theatreSquare.cJordan [2022-04-05 01:11:11,242 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-05 01:11:11,242 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 01:11:11,277 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 01:11:11,283 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-05 01:11:11,283 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 01:11:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-05 01:11:11,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-05 01:11:11,301 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:11:11,302 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:11:11,302 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:11:11,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:11:11,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1121522138, now seen corresponding path program 1 times [2022-04-05 01:11:11,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:11:11,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714613405] [2022-04-05 01:11:11,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:11:11,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:11:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:11:11,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 01:11:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:11:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 01:11:11,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:11:11,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714613405] [2022-04-05 01:11:11,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714613405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 01:11:11,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 01:11:11,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 01:11:11,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373363515] [2022-04-05 01:11:11,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 01:11:11,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 01:11:11,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:11:11,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 01:11:11,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 01:11:11,560 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 01:11:11,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:11:11,752 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-05 01:11:11,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 01:11:11,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-05 01:11:11,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:11:11,759 INFO L225 Difference]: With dead ends: 47 [2022-04-05 01:11:11,759 INFO L226 Difference]: Without dead ends: 32 [2022-04-05 01:11:11,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-05 01:11:11,763 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 01:11:11,764 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 61 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 12 Unchecked, 0.1s Time] [2022-04-05 01:11:11,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-05 01:11:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-05 01:11:11,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 01:11:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-05 01:11:11,789 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2022-04-05 01:11:11,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:11:11,790 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-05 01:11:11,790 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 01:11:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-05 01:11:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-05 01:11:11,791 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:11:11,791 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:11:11,791 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 01:11:11,791 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:11:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:11:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1342094697, now seen corresponding path program 1 times [2022-04-05 01:11:11,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:11:11,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862918410] [2022-04-05 01:11:11,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:11:11,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:11:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:11:11,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 01:11:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:11:11,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-05 01:11:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:11:11,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-05 01:11:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:11:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 01:11:11,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:11:11,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862918410] [2022-04-05 01:11:11,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862918410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 01:11:11,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 01:11:11,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-05 01:11:11,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858780927] [2022-04-05 01:11:11,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 01:11:11,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-05 01:11:11,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:11:11,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-05 01:11:11,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-04-05 01:11:11,994 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 01:11:12,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:11:12,317 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-05 01:11:12,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-05 01:11:12,317 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-05 01:11:12,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:11:12,320 INFO L225 Difference]: With dead ends: 48 [2022-04-05 01:11:12,320 INFO L226 Difference]: Without dead ends: 44 [2022-04-05 01:11:12,321 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-04-05 01:11:12,322 INFO L913 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.2s IncrementalHoareTripleChecker+Time [2022-04-05 01:11:12,323 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 80 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 295 Invalid, 0 Unknown, 40 Unchecked, 0.2s Time] [2022-04-05 01:11:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-05 01:11:12,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-04-05 01:11:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-05 01:11:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-05 01:11:12,332 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 31 [2022-04-05 01:11:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:11:12,333 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-05 01:11:12,333 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 01:11:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-05 01:11:12,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-05 01:11:12,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:11:12,334 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:11:12,335 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 01:11:12,335 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:11:12,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:11:12,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1260090278, now seen corresponding path program 1 times [2022-04-05 01:11:12,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:11:12,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051248724] [2022-04-05 01:11:12,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:11:12,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:11:12,349 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:11:12,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [535609731] [2022-04-05 01:11:12,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:11:12,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:11:12,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:11:12,357 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:11:12,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-05 01:11:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:11:12,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-05 01:11:12,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:11:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-05 01:11:12,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 01:11:12,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:11:12,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051248724] [2022-04-05 01:11:12,545 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:11:12,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535609731] [2022-04-05 01:11:12,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535609731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 01:11:12,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 01:11:12,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 01:11:12,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265906297] [2022-04-05 01:11:12,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 01:11:12,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 01:11:12,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:11:12,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 01:11:12,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 01:11:12,547 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 01:11:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:11:12,581 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-05 01:11:12,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 01:11:12,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-04-05 01:11:12,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:11:12,582 INFO L225 Difference]: With dead ends: 53 [2022-04-05 01:11:12,582 INFO L226 Difference]: Without dead ends: 43 [2022-04-05 01:11:12,582 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 01:11:12,583 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 01:11:12,584 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 127 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-05 01:11:12,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-05 01:11:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-05 01:11:12,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-05 01:11:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-05 01:11:12,590 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 32 [2022-04-05 01:11:12,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:11:12,603 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-05 01:11:12,603 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 01:11:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-05 01:11:12,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-05 01:11:12,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:11:12,605 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:11:12,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-05 01:11:12,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:11:12,828 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:11:12,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:11:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1007047745, now seen corresponding path program 1 times [2022-04-05 01:11:12,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:11:12,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399633087] [2022-04-05 01:11:12,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:11:12,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:11:12,841 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:11:12,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754095538] [2022-04-05 01:11:12,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:11:12,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:11:12,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:11:12,845 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:11:12,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-05 01:11:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:11:12,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-05 01:11:12,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:11:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-05 01:11:12,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 01:11:12,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:11:12,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399633087] [2022-04-05 01:11:12,998 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:11:12,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754095538] [2022-04-05 01:11:12,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754095538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 01:11:12,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 01:11:12,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 01:11:12,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560236720] [2022-04-05 01:11:12,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 01:11:12,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 01:11:12,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:11:13,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 01:11:13,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 01:11:13,000 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 01:11:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:11:13,019 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-05 01:11:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 01:11:13,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2022-04-05 01:11:13,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:11:13,020 INFO L225 Difference]: With dead ends: 53 [2022-04-05 01:11:13,020 INFO L226 Difference]: Without dead ends: 44 [2022-04-05 01:11:13,020 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 01:11:13,021 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 01:11:13,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 125 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-05 01:11:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-05 01:11:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-05 01:11:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.25) internal successors, (40), 34 states have internal predecessors, (40), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-05 01:11:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-05 01:11:13,028 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 33 [2022-04-05 01:11:13,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:11:13,028 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-05 01:11:13,028 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 01:11:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-05 01:11:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-05 01:11:13,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:11:13,029 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:11:13,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-05 01:11:13,251 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-05 01:11:13,252 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:11:13,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:11:13,252 INFO L85 PathProgramCache]: Analyzing trace with hash 111102768, now seen corresponding path program 1 times [2022-04-05 01:11:13,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:11:13,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892491554] [2022-04-05 01:11:13,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:11:13,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:11:13,265 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:11:13,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2132405603] [2022-04-05 01:11:13,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:11:13,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:11:13,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:11:13,266 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:11:13,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-05 01:11:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:11:13,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-05 01:11:13,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:11:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-05 01:11:13,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 01:11:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:11:13,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892491554] [2022-04-05 01:11:13,417 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:11:13,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132405603] [2022-04-05 01:11:13,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132405603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 01:11:13,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 01:11:13,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 01:11:13,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067976399] [2022-04-05 01:11:13,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 01:11:13,419 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 01:11:13,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:11:13,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 01:11:13,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 01:11:13,420 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 01:11:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:11:13,447 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-05 01:11:13,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 01:11:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-04-05 01:11:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:11:13,449 INFO L225 Difference]: With dead ends: 55 [2022-04-05 01:11:13,449 INFO L226 Difference]: Without dead ends: 45 [2022-04-05 01:11:13,450 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 01:11:13,452 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 01:11:13,452 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 127 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-05 01:11:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-05 01:11:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-05 01:11:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-05 01:11:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-04-05 01:11:13,472 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 34 [2022-04-05 01:11:13,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:11:13,473 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-04-05 01:11:13,473 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 01:11:13,473 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-05 01:11:13,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-05 01:11:13,475 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:11:13,475 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:11:13,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-05 01:11:13,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:11:13,692 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:11:13,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:11:13,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1980049385, now seen corresponding path program 1 times [2022-04-05 01:11:13,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:11:13,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115199427] [2022-04-05 01:11:13,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:11:13,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:11:13,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:11:13,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236384003] [2022-04-05 01:11:13,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:11:13,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:11:13,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:11:13,708 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:11:13,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-05 01:11:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:11:13,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-05 01:11:13,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:11:13,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-05 01:11:13,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 01:11:13,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:11:13,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115199427] [2022-04-05 01:11:13,850 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:11:13,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236384003] [2022-04-05 01:11:13,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236384003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 01:11:13,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 01:11:13,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 01:11:13,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633604131] [2022-04-05 01:11:13,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 01:11:13,851 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 01:11:13,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:11:13,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 01:11:13,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 01:11:13,852 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 01:11:13,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:11:13,874 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-05 01:11:13,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-05 01:11:13,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-04-05 01:11:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:11:13,879 INFO L225 Difference]: With dead ends: 55 [2022-04-05 01:11:13,879 INFO L226 Difference]: Without dead ends: 46 [2022-04-05 01:11:13,879 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-05 01:11:13,881 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 01:11:13,882 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 125 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-05 01:11:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-05 01:11:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-05 01:11:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-05 01:11:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-04-05 01:11:13,890 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 35 [2022-04-05 01:11:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:11:13,890 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-04-05 01:11:13,891 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 01:11:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-05 01:11:13,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-05 01:11:13,893 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:11:13,893 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:11:13,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-05 01:11:14,110 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:11:14,111 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:11:14,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:11:14,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1173604042, now seen corresponding path program 1 times [2022-04-05 01:11:14,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:11:14,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997442596] [2022-04-05 01:11:14,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:11:14,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:11:14,121 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:11:14,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481976868] [2022-04-05 01:11:14,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:11:14,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:11:14,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:11:14,122 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:11:14,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-05 01:11:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:11:14,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-05 01:11:14,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:11:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-05 01:11:16,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:11:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-05 01:11:16,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:11:16,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997442596] [2022-04-05 01:11:16,947 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:11:16,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481976868] [2022-04-05 01:11:16,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481976868] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-05 01:11:16,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-05 01:11:16,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2022-04-05 01:11:16,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311418038] [2022-04-05 01:11:16,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 01:11:16,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 01:11:16,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:11:16,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 01:11:16,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-05 01:11:16,948 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 01:11:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:11:17,002 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-05 01:11:17,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 01:11:17,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-04-05 01:11:17,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:11:17,004 INFO L225 Difference]: With dead ends: 44 [2022-04-05 01:11:17,004 INFO L226 Difference]: Without dead ends: 41 [2022-04-05 01:11:17,004 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-05 01:11:17,005 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 01:11:17,005 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 149 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-04-05 01:11:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-05 01:11:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-04-05 01:11:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 01:11:17,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-04-05 01:11:17,019 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 36 [2022-04-05 01:11:17,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:11:17,019 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-04-05 01:11:17,020 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 01:11:17,020 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-05 01:11:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-05 01:11:17,020 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:11:17,020 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:11:17,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-05 01:11:17,235 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:11:17,236 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:11:17,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:11:17,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1887612187, now seen corresponding path program 1 times [2022-04-05 01:11:17,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:11:17,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561651042] [2022-04-05 01:11:17,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:11:17,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:11:17,246 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:11:17,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [306043514] [2022-04-05 01:11:17,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:11:17,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:11:17,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:11:17,247 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:11:17,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-05 01:11:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:11:17,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-05 01:11:17,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:11:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-05 01:11:25,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:11:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-05 01:11:26,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:11:26,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561651042] [2022-04-05 01:11:26,181 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:11:26,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306043514] [2022-04-05 01:11:26,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306043514] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-05 01:11:26,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-05 01:11:26,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2022-04-05 01:11:26,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499975875] [2022-04-05 01:11:26,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 01:11:26,182 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 01:11:26,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:11:26,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 01:11:26,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-05 01:11:26,182 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 01:11:26,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:11:26,227 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-05 01:11:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 01:11:26,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-05 01:11:26,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:11:26,228 INFO L225 Difference]: With dead ends: 41 [2022-04-05 01:11:26,228 INFO L226 Difference]: Without dead ends: 38 [2022-04-05 01:11:26,228 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-05 01:11:26,229 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 15 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 01:11:26,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 142 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-04-05 01:11:26,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-05 01:11:26,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-05 01:11:26,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 01:11:26,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-04-05 01:11:26,231 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 36 [2022-04-05 01:11:26,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:11:26,232 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-04-05 01:11:26,232 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-05 01:11:26,232 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-05 01:11:26,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-05 01:11:26,232 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:11:26,232 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:11:26,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-05 01:11:26,433 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:11:26,433 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:11:26,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:11:26,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1698211422, now seen corresponding path program 1 times [2022-04-05 01:11:26,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:11:26,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566681948] [2022-04-05 01:11:26,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:11:26,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:11:26,441 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:11:26,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [35680613] [2022-04-05 01:11:26,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:11:26,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:11:26,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:11:26,443 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:11:26,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-05 01:11:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 01:11:26,927 WARN L261 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-05 01:11:26,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:11:27,923 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:11:28,493 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:11:28,918 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:11:53,115 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:11:53,612 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:12:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 01:12:50,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:12:58,881 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:13:00,752 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:13:12,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:13:12,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566681948] [2022-04-05 01:13:12,307 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:13:12,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35680613] [2022-04-05 01:13:12,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35680613] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 01:13:12,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-05 01:13:12,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2022-04-05 01:13:12,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543093910] [2022-04-05 01:13:12,307 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-05 01:13:12,307 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-05 01:13:12,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:13:12,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-05 01:13:12,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=787, Unknown=22, NotChecked=0, Total=870 [2022-04-05 01:13:12,308 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 01:13:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:13:12,628 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2022-04-05 01:13:12,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-05 01:13:12,628 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-04-05 01:13:12,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:13:12,629 INFO L225 Difference]: With dead ends: 62 [2022-04-05 01:13:12,629 INFO L226 Difference]: Without dead ends: 58 [2022-04-05 01:13:12,630 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 64.3s TimeCoverageRelationStatistics Valid=65, Invalid=843, Unknown=22, NotChecked=0, Total=930 [2022-04-05 01:13:12,630 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 01:13:12,630 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 397 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 143 Unchecked, 0.0s Time] [2022-04-05 01:13:12,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-05 01:13:12,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-05 01:13:12,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 48 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-05 01:13:12,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2022-04-05 01:13:12,634 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 37 [2022-04-05 01:13:12,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:13:12,634 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2022-04-05 01:13:12,634 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 01:13:12,634 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-05 01:13:12,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-05 01:13:12,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:13:12,635 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:13:12,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-05 01:13:12,835 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:13:12,835 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:13:12,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:13:12,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1189593605, now seen corresponding path program 2 times [2022-04-05 01:13:12,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:13:12,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33363298] [2022-04-05 01:13:12,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:13:12,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:13:12,843 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:13:12,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136821963] [2022-04-05 01:13:12,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 01:13:12,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:13:12,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:13:12,850 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:13:12,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-05 01:13:13,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 01:13:13,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 01:13:13,508 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-05 01:13:13,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:13:15,179 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:13:15,625 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:13:16,018 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:13:39,917 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:13:40,333 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:13:41,149 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:13:41,227 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:15:49,988 WARN L833 $PredicateComparison]: unable to prove that (exists ((correct_version_~j~0 Int) (v_main_~n_stones1~0_BEFORE_CALL_4 Int) (main_~m~0 Int) (correct_version_~i~0 Int) (main_~n~0 Int) (main_~a~0 Int) (student_version_~i~1 Int) (student_version_~j~1 Int) (v_main_~n_stones2~0_BEFORE_CALL_2 Int)) (let ((.cse0 (div v_main_~n_stones2~0_BEFORE_CALL_2 student_version_~j~1)) (.cse1 (div v_main_~n_stones1~0_BEFORE_CALL_4 correct_version_~j~0))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (< .cse0 (+ student_version_~i~1 1)) (<= 1 main_~n~0) (<= correct_version_~i~0 .cse1) (not (< .cse0 student_version_~i~1)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (not (= v_main_~n_stones1~0_BEFORE_CALL_4 v_main_~n_stones2~0_BEFORE_CALL_2)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (< .cse1 (+ correct_version_~i~0 1)) (<= 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))) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (= (mod v_main_~n_stones1~0_BEFORE_CALL_4 correct_version_~j~0) 0) (= (mod v_main_~n_stones2~0_BEFORE_CALL_2 student_version_~j~1) 0) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (<= main_~m~0 (* main_~a~0 student_version_~j~1)) (< 0 student_version_~i~1) (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-04-05 01:15:51,992 WARN L855 $PredicateComparison]: unable to prove that (exists ((correct_version_~j~0 Int) (v_main_~n_stones1~0_BEFORE_CALL_4 Int) (main_~m~0 Int) (correct_version_~i~0 Int) (main_~n~0 Int) (main_~a~0 Int) (student_version_~i~1 Int) (student_version_~j~1 Int) (v_main_~n_stones2~0_BEFORE_CALL_2 Int)) (let ((.cse0 (div v_main_~n_stones2~0_BEFORE_CALL_2 student_version_~j~1)) (.cse1 (div v_main_~n_stones1~0_BEFORE_CALL_4 correct_version_~j~0))) (and (<= main_~n~0 (* correct_version_~i~0 main_~a~0)) (< .cse0 (+ student_version_~i~1 1)) (<= 1 main_~n~0) (<= correct_version_~i~0 .cse1) (not (< .cse0 student_version_~i~1)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) student_version_~i~1)) (< (* v_it_3 main_~a~0) main_~n~0))) (not (= v_main_~n_stones1~0_BEFORE_CALL_4 v_main_~n_stones2~0_BEFORE_CALL_2)) (not (< (* correct_version_~j~0 main_~a~0) main_~m~0)) (< .cse1 (+ correct_version_~i~0 1)) (<= 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))) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (= (mod v_main_~n_stones1~0_BEFORE_CALL_4 correct_version_~j~0) 0) (= (mod v_main_~n_stones2~0_BEFORE_CALL_2 student_version_~j~1) 0) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (<= main_~m~0 (* main_~a~0 student_version_~j~1)) (< 0 student_version_~i~1) (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-04-05 01:15:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 01:15:51,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:16:14,559 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:16:15,135 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:16:19,226 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:16:26,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:16:26,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33363298] [2022-04-05 01:16:26,009 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:16:26,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136821963] [2022-04-05 01:16:26,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136821963] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 01:16:26,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-05 01:16:26,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-04-05 01:16:26,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601247562] [2022-04-05 01:16:26,010 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-05 01:16:26,010 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-05 01:16:26,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:16:26,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-05 01:16:26,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=947, Unknown=39, NotChecked=62, Total=1122 [2022-04-05 01:16:26,012 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 29 states, 25 states have (on average 1.2) 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-04-05 01:16:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:16:26,032 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2022-04-05 01:16:26,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-05 01:16:26,033 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 1.2) 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-04-05 01:16:26,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:16:26,034 INFO L225 Difference]: With dead ends: 67 [2022-04-05 01:16:26,034 INFO L226 Difference]: Without dead ends: 62 [2022-04-05 01:16:26,034 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 125.0s TimeCoverageRelationStatistics Valid=74, Invalid=947, Unknown=39, NotChecked=62, Total=1122 [2022-04-05 01:16:26,035 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 01:16:26,035 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 435 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 217 Unchecked, 0.0s Time] [2022-04-05 01:16:26,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-05 01:16:26,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2022-04-05 01:16:26,038 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-04-05 01:16:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-04-05 01:16:26,038 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 38 [2022-04-05 01:16:26,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:16:26,039 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-04-05 01:16:26,039 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 1.2) 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-04-05 01:16:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-04-05 01:16:26,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-05 01:16:26,039 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:16:26,039 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:16:26,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-05 01:16:26,240 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-05 01:16:26,240 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:16:26,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:16:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash 764427933, now seen corresponding path program 3 times [2022-04-05 01:16:26,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:16:26,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070820338] [2022-04-05 01:16:26,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:16:26,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:16:26,250 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:16:26,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [20609513] [2022-04-05 01:16:26,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 01:16:26,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:16:26,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:16:26,276 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:16:26,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-05 01:16:27,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-05 01:16:27,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 01:16:27,760 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-05 01:16:27,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:16:29,390 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:16:29,956 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:16:30,344 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:16:56,438 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:16:57,290 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:16:59,559 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:18:30,547 WARN L855 $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 ((.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) (exists ((v_student_version_~j~1_26 Int)) (and (let ((.cse1 (* 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)))) (< .cse1 main_~m~0)) (and (<= main_~m~0 .cse1) (= 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))))) (= (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)) (<= 1 main_~m~0) (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) correct_version_~i~0)) (< (* v_it_1 main_~a~0) main_~n~0))) (not (< (* main_~a~0 student_version_~i~1) main_~n~0)) (let ((.cse3 (= student_version_~j~1 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 .cse3) (< .cse2 (+ student_version_~i~1 1)))) (and (= c_main_~n_stones2~0 0) .cse3))) (< .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-04-05 01:19:07,668 WARN L833 $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-04-05 01:20:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 01:20:39,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:21:29,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 01:21:29,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070820338] [2022-04-05 01:21:29,086 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-05 01:21:29,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20609513] [2022-04-05 01:21:29,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20609513] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 01:21:29,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-05 01:21:29,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2022-04-05 01:21:29,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881536663] [2022-04-05 01:21:29,086 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-05 01:21:29,087 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-05 01:21:29,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 01:21:29,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-05 01:21:29,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=840, Unknown=30, NotChecked=118, Total=1056 [2022-04-05 01:21:29,088 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-04-05 01:21:29,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 01:21:29,119 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-05 01:21:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-05 01:21:29,121 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-04-05 01:21:29,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 01:21:29,123 INFO L225 Difference]: With dead ends: 70 [2022-04-05 01:21:29,123 INFO L226 Difference]: Without dead ends: 66 [2022-04-05 01:21:29,123 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 89.7s TimeCoverageRelationStatistics Valid=68, Invalid=840, Unknown=30, NotChecked=118, Total=1056 [2022-04-05 01:21:29,124 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 01:21:29,124 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 471 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 205 Unchecked, 0.0s Time] [2022-04-05 01:21:29,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-05 01:21:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2022-04-05 01:21:29,127 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-04-05 01:21:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-04-05 01:21:29,128 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 38 [2022-04-05 01:21:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 01:21:29,128 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2022-04-05 01:21:29,128 INFO L479 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-04-05 01:21:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2022-04-05 01:21:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-05 01:21:29,129 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 01:21:29,129 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 01:21:29,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-05 01:21:29,342 WARN L460 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-04-05 01:21:29,343 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 01:21:29,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 01:21:29,343 INFO L85 PathProgramCache]: Analyzing trace with hash 504805571, now seen corresponding path program 4 times [2022-04-05 01:21:29,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 01:21:29,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042551310] [2022-04-05 01:21:29,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 01:21:29,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 01:21:29,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-05 01:21:29,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151715322] [2022-04-05 01:21:29,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-05 01:21:29,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 01:21:29,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 01:21:29,353 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 01:21:29,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-05 01:21:37,660 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-05 01:21:37,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 01:21:37,667 WARN L261 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 81 conjunts are in the unsatisfiable core [2022-04-05 01:21:37,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 01:21:40,595 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:21:41,567 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:21:42,053 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:22:34,185 WARN L232 SmtUtils]: Spent 12.39s 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-04-05 01:22:41,399 WARN L232 SmtUtils]: Spent 6.33s 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-04-05 01:22:46,453 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:22:47,757 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:24:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 01:24:53,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 01:25:11,907 WARN L232 SmtUtils]: Spent 8.73s on a formula simplification. DAG size of input: 116 DAG size of output: 93 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-05 01:25:13,398 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:25:14,733 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:25:18,449 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:25:22,314 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:25:23,264 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-05 01:25:26,901 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful