/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/in-de62.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7968f31 [2022-03-17 15:26:01,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 15:26:01,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 15:26:01,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 15:26:01,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 15:26:01,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 15:26:01,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 15:26:01,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 15:26:01,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 15:26:01,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 15:26:01,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 15:26:01,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 15:26:01,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 15:26:01,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 15:26:01,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 15:26:01,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 15:26:01,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 15:26:01,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 15:26:01,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 15:26:01,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 15:26:01,911 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 15:26:01,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 15:26:01,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 15:26:01,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 15:26:01,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 15:26:01,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 15:26:01,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 15:26:01,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 15:26:01,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 15:26:01,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 15:26:01,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 15:26:01,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 15:26:01,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 15:26:01,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 15:26:01,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 15:26:01,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 15:26:01,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 15:26:01,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 15:26:01,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 15:26:01,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 15:26:01,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 15:26:01,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 15:26:01,926 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-17 15:26:01,933 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 15:26:01,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 15:26:01,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 15:26:01,935 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-17 15:26:01,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 15:26:01,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-17 15:26:01,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 15:26:01,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 15:26:01,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 15:26:01,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 15:26:01,936 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-17 15:26:01,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 15:26:01,936 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 15:26:01,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 15:26:01,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 15:26:01,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 15:26:01,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-17 15:26:01,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 15:26:01,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 15:26:01,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 15:26:01,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 15:26:01,937 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 15:26:01,938 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-17 15:26:02,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 15:26:02,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 15:26:02,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 15:26:02,123 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 15:26:02,123 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 15:26:02,124 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-03-17 15:26:02,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5898a277/825591beaf094fe4baa48c944ea42301/FLAGdbf9eba59 [2022-03-17 15:26:02,539 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 15:26:02,540 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-03-17 15:26:02,544 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5898a277/825591beaf094fe4baa48c944ea42301/FLAGdbf9eba59 [2022-03-17 15:26:02,554 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5898a277/825591beaf094fe4baa48c944ea42301 [2022-03-17 15:26:02,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 15:26:02,558 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 15:26:02,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 15:26:02,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 15:26:02,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 15:26:02,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:26:02" (1/1) ... [2022-03-17 15:26:02,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:26:02, skipping insertion in model container [2022-03-17 15:26:02,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:26:02" (1/1) ... [2022-03-17 15:26:02,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 15:26:02,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 15:26:02,724 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/in-de62.c[368,381] [2022-03-17 15:26:02,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 15:26:02,740 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 15:26:02,748 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/in-de62.c[368,381] [2022-03-17 15:26:02,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 15:26:02,760 INFO L208 MainTranslator]: Completed translation [2022-03-17 15:26:02,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:26:02 WrapperNode [2022-03-17 15:26:02,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 15:26:02,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 15:26:02,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 15:26:02,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 15:26:02,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:26:02" (1/1) ... [2022-03-17 15:26:02,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:26:02" (1/1) ... [2022-03-17 15:26:02,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:26:02" (1/1) ... [2022-03-17 15:26:02,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:26:02" (1/1) ... [2022-03-17 15:26:02,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:26:02" (1/1) ... [2022-03-17 15:26:02,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:26:02" (1/1) ... [2022-03-17 15:26:02,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:26:02" (1/1) ... [2022-03-17 15:26:02,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 15:26:02,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 15:26:02,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 15:26:02,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 15:26:02,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:26:02" (1/1) ... [2022-03-17 15:26:02,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 15:26:02,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:26:02,807 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-03-17 15:26:02,817 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-03-17 15:26:02,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 15:26:02,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 15:26:02,834 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 15:26:02,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-17 15:26:02,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 15:26:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 15:26:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 15:26:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 15:26:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 15:26:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-17 15:26:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-17 15:26:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 15:26:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 15:26:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 15:26:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 15:26:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 15:26:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 15:26:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 15:26:02,878 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 15:26:02,879 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 15:26:02,990 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 15:26:02,993 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 15:26:02,994 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-17 15:26:02,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:26:02 BoogieIcfgContainer [2022-03-17 15:26:02,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 15:26:02,996 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 15:26:02,996 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 15:26:02,996 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 15:26:02,999 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:26:02" (1/1) ... [2022-03-17 15:26:03,158 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:26:03,159 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_8 (+ v_main_~y~0_9 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] to Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~y~0_9 v_main_~y~0_8) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~x~0_7 v_main_~x~0_6)) (and (< 0 .cse0) (= v_main_~x~0_6 (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_7 v_main_~y~0_9)) (< v_main_~y~0_9 v_main_~y~0_8) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_7 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~y~0_9 v_it_1 1) v_main_~y~0_8))))))) InVars {main_~y~0=v_main_~y~0_9, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_7, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] [2022-03-17 15:26:03,237 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:26:03,237 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_8 (+ v_main_~z~0_7 1)) (< 0 (mod v_main_~z~0_8 4294967296)) (= v_main_~x~0_11 (+ v_main_~x~0_12 1))) InVars {main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_8} OutVars{main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_7, main_#t~post8=|v_main_#t~post8_1|, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] to Formula: (let ((.cse0 (mod v_main_~z~0_8 4294967296))) (or (and (forall ((v_it_2 Int)) (or (< 0 (mod (+ v_main_~z~0_8 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~z~0_7 v_it_2 1) v_main_~z~0_8)) (not (<= 1 v_it_2)))) (= v_main_~x~0_11 (+ v_main_~x~0_12 v_main_~z~0_8 (* (- 1) v_main_~z~0_7))) (< 0 .cse0) (< v_main_~z~0_7 v_main_~z~0_8)) (and (<= .cse0 0) (= v_main_~z~0_8 v_main_~z~0_7) (= v_main_~x~0_12 v_main_~x~0_11) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)))) InVars {main_~x~0=v_main_~x~0_12, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_8, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_11, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_7, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] [2022-03-17 15:26:03,316 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:26:03,316 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~z~0=v_main_~z~0_3, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post10=|v_main_#t~post10_1|, main_~z~0=v_main_~z~0_2, main_~y~0=v_main_~y~0_4, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] to Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|) (<= .cse0 0)) (and (= v_main_~y~0_4 (+ v_main_~y~0_5 v_main_~z~0_3 (* (- 1) v_main_~z~0_2))) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= (+ v_main_~z~0_3 v_it_3 1) v_main_~z~0_2)) (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_5 (* v_it_3 4294967295)) 4294967296)))) (< v_main_~z~0_3 v_main_~z~0_2)))) InVars {main_~y~0=v_main_~y~0_5, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] [2022-03-17 15:26:03,394 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:26:03,394 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~x~0_10 4294967296)) (= v_main_~x~0_10 (+ v_main_~x~0_9 1)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] to Formula: (let ((.cse0 (mod v_main_~x~0_10 4294967296))) (or (and (<= .cse0 0) (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (= v_main_~y~0_11 v_main_~y~0_10) (= v_main_~x~0_10 v_main_~x~0_9)) (and (= (+ v_main_~x~0_10 v_main_~y~0_11 (* (- 1) v_main_~x~0_9)) v_main_~y~0_10) (< 0 .cse0) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_10) 4294967296)) (not (<= (+ v_main_~x~0_9 v_it_4 1) v_main_~x~0_10)) (not (<= 1 v_it_4)))) (< v_main_~x~0_9 v_main_~x~0_10)))) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_9, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] [2022-03-17 15:26:03,445 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:26:03,446 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_10 (+ v_main_~z~0_9 1)) (< 0 (mod v_main_~z~0_10 4294967296)) (= v_main_~x~0_13 (+ v_main_~x~0_14 1))) InVars {main_~x~0=v_main_~x~0_14, main_~z~0=v_main_~z~0_10} OutVars{main_~x~0=v_main_~x~0_13, main_~z~0=v_main_~z~0_9, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] to Formula: (let ((.cse0 (mod v_main_~z~0_10 4294967296))) (or (and (<= .cse0 0) (= |v_main_#t~post14_3| |v_main_#t~post14_1|) (= v_main_~z~0_10 v_main_~z~0_9) (= v_main_~x~0_14 v_main_~x~0_13) (= |v_main_#t~post13_3| |v_main_#t~post13_1|)) (and (< 0 .cse0) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~z~0_9 v_it_5 1) v_main_~z~0_10)) (< 0 (mod (+ v_main_~z~0_10 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)))) (< v_main_~z~0_9 v_main_~z~0_10) (= v_main_~x~0_13 (+ v_main_~x~0_14 v_main_~z~0_10 (* (- 1) v_main_~z~0_9)))))) InVars {main_~x~0=v_main_~x~0_14, main_~z~0=v_main_~z~0_10, main_#t~post13=|v_main_#t~post13_3|, main_#t~post14=|v_main_#t~post14_3|} OutVars{main_~x~0=v_main_~x~0_13, main_~z~0=v_main_~z~0_9, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] [2022-03-17 15:26:03,507 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:26:03,508 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~x~0_3 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_#t~post15, main_#t~post16, main_~y~0] to Formula: (let ((.cse0 (mod v_main_~y~0_7 4294967296))) (or (and (= |v_main_#t~post15_3| |v_main_#t~post15_1|) (= |v_main_#t~post16_3| |v_main_#t~post16_1|) (= v_main_~y~0_7 v_main_~y~0_6) (= v_main_~x~0_3 v_main_~x~0_2) (<= .cse0 0)) (and (< 0 .cse0) (= v_main_~y~0_6 (+ v_main_~x~0_2 v_main_~y~0_7 (* (- 1) v_main_~x~0_3))) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~x~0_2 v_it_6 1) v_main_~x~0_3)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~y~0_7 (* v_it_6 4294967295)) 4294967296)))) (< v_main_~x~0_2 v_main_~x~0_3)))) InVars {main_#t~post15=|v_main_#t~post15_3|, main_~y~0=v_main_~y~0_7, main_#t~post16=|v_main_#t~post16_3|, main_~x~0=v_main_~x~0_3} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post15, main_#t~post16, main_~y~0] [2022-03-17 15:26:03,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 03:26:03 BasicIcfg [2022-03-17 15:26:03,511 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 15:26:03,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 15:26:03,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 15:26:03,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 15:26:03,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:26:02" (1/4) ... [2022-03-17 15:26:03,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8c13f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:26:03, skipping insertion in model container [2022-03-17 15:26:03,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:26:02" (2/4) ... [2022-03-17 15:26:03,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8c13f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:26:03, skipping insertion in model container [2022-03-17 15:26:03,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:26:02" (3/4) ... [2022-03-17 15:26:03,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8c13f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:26:03, skipping insertion in model container [2022-03-17 15:26:03,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 03:26:03" (4/4) ... [2022-03-17 15:26:03,520 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de62.cJordan [2022-03-17 15:26:03,526 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-17 15:26:03,526 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-17 15:26:03,562 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 15:26:03,568 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-03-17 15:26:03,569 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-17 15:26:03,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-17 15:26:03,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 15:26:03,585 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:26:03,586 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:26:03,586 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:26:03,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:26:03,590 INFO L85 PathProgramCache]: Analyzing trace with hash 430051023, now seen corresponding path program 1 times [2022-03-17 15:26:03,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:26:03,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174017442] [2022-03-17 15:26:03,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:03,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:26:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:03,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:26:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:03,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:26:03,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174017442] [2022-03-17 15:26:03,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174017442] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:26:03,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:26:03,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-17 15:26:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124855324] [2022-03-17 15:26:03,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:26:03,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-17 15:26:03,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:26:03,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-17 15:26:03,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-17 15:26:03,727 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-03-17 15:26:03,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:26:03,749 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-03-17 15:26:03,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-17 15:26:03,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 17 [2022-03-17 15:26:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:26:03,756 INFO L225 Difference]: With dead ends: 25 [2022-03-17 15:26:03,756 INFO L226 Difference]: Without dead ends: 18 [2022-03-17 15:26:03,757 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-17 15:26:03,760 INFO L912 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:26:03,760 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 15:26:03,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-03-17 15:26:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-03-17 15:26:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 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-03-17 15:26:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-03-17 15:26:03,782 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-03-17 15:26:03,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:26:03,783 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-03-17 15:26:03,783 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-03-17 15:26:03,783 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-03-17 15:26:03,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 15:26:03,784 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:26:03,784 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:26:03,784 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-17 15:26:03,785 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:26:03,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:26:03,787 INFO L85 PathProgramCache]: Analyzing trace with hash -514488111, now seen corresponding path program 1 times [2022-03-17 15:26:03,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:26:03,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454398790] [2022-03-17 15:26:03,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:03,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:26:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:03,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:26:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:03,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:26:03,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454398790] [2022-03-17 15:26:03,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454398790] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:26:03,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:26:03,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 15:26:03,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185508801] [2022-03-17 15:26:03,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:26:03,901 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 15:26:03,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:26:03,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 15:26:03,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 15:26:03,901 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 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-03-17 15:26:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:26:03,979 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-03-17 15:26:03,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 15:26:03,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-03-17 15:26:03,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:26:03,981 INFO L225 Difference]: With dead ends: 28 [2022-03-17 15:26:03,981 INFO L226 Difference]: Without dead ends: 25 [2022-03-17 15:26:03,982 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-17 15:26:03,983 INFO L912 BasicCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:26:03,984 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 37 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 10 Unchecked, 0.0s Time] [2022-03-17 15:26:03,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-03-17 15:26:03,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2022-03-17 15:26:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 3 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-03-17 15:26:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-03-17 15:26:03,987 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 17 [2022-03-17 15:26:03,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:26:03,987 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-03-17 15:26:03,987 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 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-03-17 15:26:03,987 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-03-17 15:26:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:26:03,988 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:26:03,988 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:26:03,988 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-17 15:26:03,988 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:26:03,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:26:03,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1257458414, now seen corresponding path program 1 times [2022-03-17 15:26:03,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:26:03,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228625967] [2022-03-17 15:26:03,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:03,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:26:03,999 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:26:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:04,025 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:26:04,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:26:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:04,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:26:04,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228625967] [2022-03-17 15:26:04,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228625967] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:26:04,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971022598] [2022-03-17 15:26:04,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:04,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:26:04,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:26:04,100 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-03-17 15:26:04,101 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-03-17 15:26:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:04,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-17 15:26:04,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:26:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:04,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:26:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:09,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971022598] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:26:09,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:26:09,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-03-17 15:26:09,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451488410] [2022-03-17 15:26:09,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:26:09,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-17 15:26:09,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:26:09,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-17 15:26:09,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=67, Unknown=2, NotChecked=0, Total=90 [2022-03-17 15:26:09,018 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:26:09,127 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2022-03-17 15:26:09,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-17 15:26:09,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-17 15:26:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:26:09,129 INFO L225 Difference]: With dead ends: 31 [2022-03-17 15:26:09,129 INFO L226 Difference]: Without dead ends: 28 [2022-03-17 15:26:09,130 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=45, Invalid=135, Unknown=2, NotChecked=0, Total=182 [2022-03-17 15:26:09,131 INFO L912 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:26:09,131 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 57 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2022-03-17 15:26:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-03-17 15:26:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-03-17 15:26:09,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 3 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-03-17 15:26:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-03-17 15:26:09,140 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 18 [2022-03-17 15:26:09,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:26:09,141 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-03-17 15:26:09,141 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-03-17 15:26:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:26:09,143 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:26:09,143 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:26:09,163 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-03-17 15:26:09,351 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-03-17 15:26:09,352 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:26:09,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:26:09,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2030445491, now seen corresponding path program 1 times [2022-03-17 15:26:09,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:26:09,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789813964] [2022-03-17 15:26:09,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:09,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:26:09,361 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:26:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:09,384 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:26:09,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:26:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:09,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:26:09,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789813964] [2022-03-17 15:26:09,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789813964] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:26:09,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527331415] [2022-03-17 15:26:09,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:09,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:26:09,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:26:09,442 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-03-17 15:26:09,455 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-03-17 15:26:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:09,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-17 15:26:09,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:26:09,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:09,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:26:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:12,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527331415] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:26:12,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:26:12,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-03-17 15:26:12,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140455279] [2022-03-17 15:26:12,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:26:12,077 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-17 15:26:12,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:26:12,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-17 15:26:12,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=68, Unknown=1, NotChecked=0, Total=90 [2022-03-17 15:26:12,078 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:26:12,158 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2022-03-17 15:26:12,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-17 15:26:12,159 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-17 15:26:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:26:12,161 INFO L225 Difference]: With dead ends: 38 [2022-03-17 15:26:12,161 INFO L226 Difference]: Without dead ends: 35 [2022-03-17 15:26:12,161 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=45, Invalid=136, Unknown=1, NotChecked=0, Total=182 [2022-03-17 15:26:12,162 INFO L912 BasicCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:26:12,162 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 45 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2022-03-17 15:26:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-03-17 15:26:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-03-17 15:26:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 3 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-03-17 15:26:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2022-03-17 15:26:12,165 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 18 [2022-03-17 15:26:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:26:12,165 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2022-03-17 15:26:12,165 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:12,166 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2022-03-17 15:26:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:26:12,166 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:26:12,166 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:26:12,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-17 15:26:12,371 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-03-17 15:26:12,372 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:26:12,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:26:12,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1868584369, now seen corresponding path program 1 times [2022-03-17 15:26:12,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:26:12,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314752019] [2022-03-17 15:26:12,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:12,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:26:12,379 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:26:12,383 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:26:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:12,403 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.2))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:26:12,410 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:26:12,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:26:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:12,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:26:12,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:26:12,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314752019] [2022-03-17 15:26:12,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314752019] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:26:12,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136249167] [2022-03-17 15:26:12,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:12,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:26:12,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:26:12,531 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-03-17 15:26:12,532 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-03-17 15:26:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:12,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-17 15:26:12,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:26:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:12,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:26:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:35,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136249167] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:26:35,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:26:35,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2022-03-17 15:26:35,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811171978] [2022-03-17 15:26:35,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:26:35,553 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-17 15:26:35,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:26:35,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-17 15:26:35,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=185, Unknown=8, NotChecked=0, Total=240 [2022-03-17 15:26:35,554 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:47,845 WARN L232 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:27:22,366 WARN L232 SmtUtils]: Spent 17.56s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:27:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:27:55,418 INFO L93 Difference]: Finished difference Result 60 states and 92 transitions. [2022-03-17 15:27:55,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-17 15:27:55,419 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:27:55,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:27:55,419 INFO L225 Difference]: With dead ends: 60 [2022-03-17 15:27:55,419 INFO L226 Difference]: Without dead ends: 56 [2022-03-17 15:27:55,420 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 99.4s TimeCoverageRelationStatistics Valid=148, Invalid=578, Unknown=30, NotChecked=0, Total=756 [2022-03-17 15:27:55,420 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 58 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:27:55,421 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 71 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 86 Invalid, 0 Unknown, 94 Unchecked, 0.1s Time] [2022-03-17 15:27:55,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-03-17 15:27:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 37. [2022-03-17 15:27:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.6875) internal successors, (54), 32 states have internal predecessors, (54), 3 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-03-17 15:27:55,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 58 transitions. [2022-03-17 15:27:55,424 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 58 transitions. Word has length 19 [2022-03-17 15:27:55,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:27:55,425 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 58 transitions. [2022-03-17 15:27:55,425 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 58 transitions. [2022-03-17 15:27:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:27:55,425 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:27:55,425 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:27:55,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-17 15:27:55,626 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-03-17 15:27:55,626 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:27:55,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:27:55,627 INFO L85 PathProgramCache]: Analyzing trace with hash 353225841, now seen corresponding path program 2 times [2022-03-17 15:27:55,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:27:55,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022886593] [2022-03-17 15:27:55,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:55,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:27:55,632 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:55,633 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_12 .cse0 (* (- 4294967296) (div (+ main_~y~0_12 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:55,652 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.5))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:55,661 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_12 .cse0 (* (- 4294967296) (div (+ main_~y~0_12 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:55,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:27:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-17 15:27:55,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:27:55,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022886593] [2022-03-17 15:27:55,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022886593] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:27:55,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:27:55,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-17 15:27:55,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913472959] [2022-03-17 15:27:55,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:27:55,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 15:27:55,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:27:55,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 15:27:55,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-17 15:27:55,829 INFO L87 Difference]: Start difference. First operand 37 states and 58 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-03-17 15:27:56,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:27:56,046 INFO L93 Difference]: Finished difference Result 52 states and 80 transitions. [2022-03-17 15:27:56,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 15:27:56,047 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 19 [2022-03-17 15:27:56,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:27:56,048 INFO L225 Difference]: With dead ends: 52 [2022-03-17 15:27:56,048 INFO L226 Difference]: Without dead ends: 46 [2022-03-17 15:27:56,049 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-17 15:27:56,049 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:27:56,051 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 60 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-03-17 15:27:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-03-17 15:27:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-03-17 15:27:56,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 3 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-03-17 15:27:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2022-03-17 15:27:56,057 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 61 transitions. Word has length 19 [2022-03-17 15:27:56,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:27:56,058 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 61 transitions. [2022-03-17 15:27:56,058 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-03-17 15:27:56,058 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 61 transitions. [2022-03-17 15:27:56,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:27:56,058 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:27:56,058 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:27:56,059 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-17 15:27:56,059 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:27:56,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:27:56,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1453978548, now seen corresponding path program 1 times [2022-03-17 15:27:56,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:27:56,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746662273] [2022-03-17 15:27:56,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:56,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:27:56,073 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:56,074 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:56,099 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:56,102 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:56,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:27:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:27:56,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:27:56,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746662273] [2022-03-17 15:27:56,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746662273] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:27:56,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946828260] [2022-03-17 15:27:56,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:56,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:27:56,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:27:56,301 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-03-17 15:27:56,302 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-03-17 15:27:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:56,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-17 15:27:56,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:27:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:27:56,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:28:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:28:19,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946828260] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:28:19,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:28:19,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2022-03-17 15:28:19,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107726008] [2022-03-17 15:28:19,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:28:19,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-17 15:28:19,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:28:19,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-17 15:28:19,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=139, Unknown=6, NotChecked=0, Total=182 [2022-03-17 15:28:19,419 INFO L87 Difference]: Start difference. First operand 39 states and 61 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:28:19,748 INFO L93 Difference]: Finished difference Result 56 states and 86 transitions. [2022-03-17 15:28:19,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-17 15:28:19,748 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:28:19,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:28:19,749 INFO L225 Difference]: With dead ends: 56 [2022-03-17 15:28:19,749 INFO L226 Difference]: Without dead ends: 53 [2022-03-17 15:28:19,749 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=81, Invalid=293, Unknown=6, NotChecked=0, Total=380 [2022-03-17 15:28:19,750 INFO L912 BasicCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:28:19,750 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 75 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 63 Invalid, 0 Unknown, 54 Unchecked, 0.1s Time] [2022-03-17 15:28:19,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-03-17 15:28:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2022-03-17 15:28:19,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 36 states have internal predecessors, (61), 3 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-03-17 15:28:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 65 transitions. [2022-03-17 15:28:19,754 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 65 transitions. Word has length 19 [2022-03-17 15:28:19,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:28:19,754 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 65 transitions. [2022-03-17 15:28:19,754 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 65 transitions. [2022-03-17 15:28:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:28:19,754 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:28:19,754 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:28:19,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-17 15:28:19,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:28:19,955 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:28:19,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:28:19,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1642739759, now seen corresponding path program 1 times [2022-03-17 15:28:19,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:28:19,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295226525] [2022-03-17 15:28:19,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:28:19,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:28:19,963 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:28:19,965 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:19,982 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.5))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:28:19,985 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:20,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:28:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:28:20,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:28:20,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295226525] [2022-03-17 15:28:20,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295226525] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:28:20,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:28:20,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-17 15:28:20,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750000239] [2022-03-17 15:28:20,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:28:20,124 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 15:28:20,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:28:20,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 15:28:20,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-17 15:28:20,124 INFO L87 Difference]: Start difference. First operand 41 states and 65 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-03-17 15:28:20,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:28:20,326 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2022-03-17 15:28:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 15:28:20,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 19 [2022-03-17 15:28:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:28:20,327 INFO L225 Difference]: With dead ends: 57 [2022-03-17 15:28:20,327 INFO L226 Difference]: Without dead ends: 52 [2022-03-17 15:28:20,328 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-17 15:28:20,328 INFO L912 BasicCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:28:20,328 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 41 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 54 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-03-17 15:28:20,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-17 15:28:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2022-03-17 15:28:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 38 states have internal predecessors, (64), 3 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-03-17 15:28:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 68 transitions. [2022-03-17 15:28:20,332 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 68 transitions. Word has length 19 [2022-03-17 15:28:20,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:28:20,332 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 68 transitions. [2022-03-17 15:28:20,332 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-03-17 15:28:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 68 transitions. [2022-03-17 15:28:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:28:20,333 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:28:20,333 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:28:20,333 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-17 15:28:20,333 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:28:20,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:28:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash -869752682, now seen corresponding path program 1 times [2022-03-17 15:28:20,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:28:20,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080427816] [2022-03-17 15:28:20,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:28:20,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:28:20,337 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:28:20,338 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:20,350 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.5))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:28:20,352 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.6))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:20,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:28:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:28:20,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:28:20,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080427816] [2022-03-17 15:28:20,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080427816] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:28:20,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829164768] [2022-03-17 15:28:20,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:28:20,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:28:20,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:28:20,474 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-03-17 15:28:20,475 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-03-17 15:28:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:20,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 15:28:20,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:28:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:28:20,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:28:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:28:48,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829164768] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:28:48,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:28:48,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8] total 12 [2022-03-17 15:28:48,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621977321] [2022-03-17 15:28:48,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:28:48,982 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-17 15:28:48,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:28:48,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-17 15:28:48,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=96, Unknown=8, NotChecked=0, Total=132 [2022-03-17 15:28:48,982 INFO L87 Difference]: Start difference. First operand 43 states and 68 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:51,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:28:51,198 INFO L93 Difference]: Finished difference Result 60 states and 94 transitions. [2022-03-17 15:28:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 15:28:51,199 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:28:51,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:28:51,199 INFO L225 Difference]: With dead ends: 60 [2022-03-17 15:28:51,199 INFO L226 Difference]: Without dead ends: 57 [2022-03-17 15:28:51,200 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=55, Invalid=176, Unknown=9, NotChecked=0, Total=240 [2022-03-17 15:28:51,200 INFO L912 BasicCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:28:51,200 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 56 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 46 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2022-03-17 15:28:51,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-03-17 15:28:51,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2022-03-17 15:28:51,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 3 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-03-17 15:28:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2022-03-17 15:28:51,203 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 19 [2022-03-17 15:28:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:28:51,203 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2022-03-17 15:28:51,204 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:51,204 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2022-03-17 15:28:51,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:28:51,204 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:28:51,204 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:28:51,223 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-03-17 15:28:51,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:28:51,411 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:28:51,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:28:51,412 INFO L85 PathProgramCache]: Analyzing trace with hash 84699953, now seen corresponding path program 1 times [2022-03-17 15:28:51,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:28:51,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113589027] [2022-03-17 15:28:51,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:28:51,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:28:51,417 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:51,418 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:51,427 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:51,433 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:51,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:28:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:28:51,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:28:51,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113589027] [2022-03-17 15:28:51,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113589027] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:28:51,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712110966] [2022-03-17 15:28:51,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:28:51,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:28:51,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:28:51,618 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-03-17 15:28:51,619 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-03-17 15:28:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:51,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-17 15:28:51,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:28:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:28:51,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:28:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:28:59,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712110966] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:28:59,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:28:59,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 14 [2022-03-17 15:28:59,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094674426] [2022-03-17 15:28:59,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:28:59,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-17 15:28:59,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:28:59,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-17 15:28:59,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=142, Unknown=3, NotChecked=0, Total=182 [2022-03-17 15:28:59,017 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:59,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:28:59,369 INFO L93 Difference]: Finished difference Result 64 states and 101 transitions. [2022-03-17 15:28:59,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-17 15:28:59,369 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:28:59,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:28:59,370 INFO L225 Difference]: With dead ends: 64 [2022-03-17 15:28:59,370 INFO L226 Difference]: Without dead ends: 61 [2022-03-17 15:28:59,370 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=101, Invalid=358, Unknown=3, NotChecked=0, Total=462 [2022-03-17 15:28:59,371 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:28:59,371 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 65 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 74 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-03-17 15:28:59,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-17 15:28:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2022-03-17 15:28:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 3 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-03-17 15:28:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2022-03-17 15:28:59,374 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 19 [2022-03-17 15:28:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:28:59,374 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2022-03-17 15:28:59,375 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2022-03-17 15:28:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:28:59,375 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:28:59,375 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:28:59,394 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-03-17 15:28:59,580 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:28:59,580 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:28:59,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:28:59,581 INFO L85 PathProgramCache]: Analyzing trace with hash 857687030, now seen corresponding path program 1 times [2022-03-17 15:28:59,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:28:59,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787995499] [2022-03-17 15:28:59,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:28:59,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:28:59,584 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:59,585 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:59,619 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:59,624 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.4))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:59,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:28:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:59,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:28:59,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:28:59,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787995499] [2022-03-17 15:28:59,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787995499] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:28:59,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427484208] [2022-03-17 15:28:59,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:28:59,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:28:59,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:28:59,801 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-03-17 15:28:59,802 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-03-17 15:28:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:59,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-17 15:28:59,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:29:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:29:00,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:29:07,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:29:07,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427484208] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:29:07,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:29:07,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 14 [2022-03-17 15:29:07,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597272152] [2022-03-17 15:29:07,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:29:07,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-17 15:29:07,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:29:07,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-17 15:29:07,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=143, Unknown=3, NotChecked=0, Total=182 [2022-03-17 15:29:07,028 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:29:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:29:07,420 INFO L93 Difference]: Finished difference Result 63 states and 100 transitions. [2022-03-17 15:29:07,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-17 15:29:07,421 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:29:07,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:29:07,422 INFO L225 Difference]: With dead ends: 63 [2022-03-17 15:29:07,422 INFO L226 Difference]: Without dead ends: 60 [2022-03-17 15:29:07,422 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=93, Invalid=366, Unknown=3, NotChecked=0, Total=462 [2022-03-17 15:29:07,423 INFO L912 BasicCegarLoop]: 14 mSDtfsCounter, 40 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 15:29:07,423 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 114 Invalid, 0 Unknown, 26 Unchecked, 0.2s Time] [2022-03-17 15:29:07,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-03-17 15:29:07,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2022-03-17 15:29:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 3 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-03-17 15:29:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2022-03-17 15:29:07,427 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 19 [2022-03-17 15:29:07,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:29:07,427 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2022-03-17 15:29:07,427 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:29:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2022-03-17 15:29:07,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-17 15:29:07,428 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:29:07,428 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:29:07,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-17 15:29:07,632 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:29:07,634 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:29:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:29:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1145856883, now seen corresponding path program 2 times [2022-03-17 15:29:07,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:29:07,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051305717] [2022-03-17 15:29:07,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:29:07,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:29:07,638 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:07,638 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:07,640 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_10 .cse0 (* (- 4294967296) (div (+ main_~z~0_10 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:29:07,654 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.3))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:07,656 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:07,658 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_10 .cse0 (* (- 4294967296) (div (+ main_~z~0_10 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:07,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:29:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:29:07,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:29:07,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:29:07,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051305717] [2022-03-17 15:29:07,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051305717] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:29:07,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965592904] [2022-03-17 15:29:07,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:29:07,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:29:07,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:29:07,859 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-03-17 15:29:07,860 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-03-17 15:29:07,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:29:07,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:29:07,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-17 15:29:07,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:29:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:29:08,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:29:59,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_35_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_35_31) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (<= aux_mod_v_main_~y~0_26_31 0) (<= 4294967296 aux_mod_v_main_~y~0_26_31) (and (or (forall ((aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (< aux_mod_v_main_~z~0_32_31 0) (< 0 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0)))) (forall ((aux_div_v_main_~x~0_35_31 Int) (aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0) (<= aux_mod_v_main_~z~0_32_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_32_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (< aux_mod_v_main_~y~0_26_31 0) (let ((.cse0 (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) c_main_~y~0 c_main_~z~0) 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse0) (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) (* v_it_5 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))) (not .cse0)))) (< 0 aux_mod_v_main_~y~0_26_31)))) (not .cse1)) (or .cse1 (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse2) (or (not .cse2) (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))))))) (<= aux_mod_v_main_~x~0_35_31 0))) is different from false [2022-03-17 15:30:01,524 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_35_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_35_31) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (<= aux_mod_v_main_~y~0_26_31 0) (<= 4294967296 aux_mod_v_main_~y~0_26_31) (and (or (forall ((aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (< aux_mod_v_main_~z~0_32_31 0) (< 0 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0)))) (forall ((aux_div_v_main_~x~0_35_31 Int) (aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0) (<= aux_mod_v_main_~z~0_32_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_32_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (< aux_mod_v_main_~y~0_26_31 0) (let ((.cse0 (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) c_main_~y~0 c_main_~z~0) 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse0) (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) (* v_it_5 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))) (not .cse0)))) (< 0 aux_mod_v_main_~y~0_26_31)))) (not .cse1)) (or .cse1 (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse2) (or (not .cse2) (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))))))) (<= aux_mod_v_main_~x~0_35_31 0))) is different from true [2022-03-17 15:30:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-17 15:30:43,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965592904] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:30:43,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:30:43,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2022-03-17 15:30:43,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342686303] [2022-03-17 15:30:43,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:30:43,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-17 15:30:43,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:30:43,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-17 15:30:43,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=180, Unknown=15, NotChecked=28, Total=272 [2022-03-17 15:30:43,798 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:30:58,372 WARN L232 SmtUtils]: Spent 10.22s on a formula simplification that was a NOOP. DAG size: 114 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:31:00,461 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (forall ((aux_mod_v_main_~x~0_35_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_35_31) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (<= aux_mod_v_main_~y~0_26_31 0) (<= 4294967296 aux_mod_v_main_~y~0_26_31) (and (or (forall ((aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (< aux_mod_v_main_~z~0_32_31 0) (< 0 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0)))) (forall ((aux_div_v_main_~x~0_35_31 Int) (aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0) (<= aux_mod_v_main_~z~0_32_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_32_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (< aux_mod_v_main_~y~0_26_31 0) (let ((.cse0 (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) c_main_~y~0 c_main_~z~0) 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse0) (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) (* v_it_5 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))) (not .cse0)))) (< 0 aux_mod_v_main_~y~0_26_31)))) (not .cse1)) (or .cse1 (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse2) (or (not .cse2) (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))))))) (<= aux_mod_v_main_~x~0_35_31 0))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-17 15:31:28,830 WARN L232 SmtUtils]: Spent 6.51s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:32:10,631 WARN L232 SmtUtils]: Spent 7.94s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:32:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:32:31,585 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2022-03-17 15:32:31,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-17 15:32:31,585 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-17 15:32:31,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:32:31,586 INFO L225 Difference]: With dead ends: 69 [2022-03-17 15:32:31,586 INFO L226 Difference]: Without dead ends: 66 [2022-03-17 15:32:31,586 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 144.7s TimeCoverageRelationStatistics Valid=143, Invalid=571, Unknown=50, NotChecked=106, Total=870 [2022-03-17 15:32:31,586 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:32:31,587 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 76 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 85 Invalid, 0 Unknown, 104 Unchecked, 0.1s Time] [2022-03-17 15:32:31,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-03-17 15:32:31,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2022-03-17 15:32:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 41 states have internal predecessors, (70), 3 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-03-17 15:32:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 74 transitions. [2022-03-17 15:32:31,590 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 74 transitions. Word has length 20 [2022-03-17 15:32:31,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:32:31,590 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 74 transitions. [2022-03-17 15:32:31,590 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:32:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 74 transitions. [2022-03-17 15:32:31,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-17 15:32:31,591 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:32:31,591 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:32:31,608 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-03-17 15:32:31,805 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,SelfDestructingSolverStorable11 [2022-03-17 15:32:31,807 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:32:31,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:32:31,808 INFO L85 PathProgramCache]: Analyzing trace with hash -369501645, now seen corresponding path program 1 times [2022-03-17 15:32:31,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:32:31,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489894043] [2022-03-17 15:32:31,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:32:31,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:32:31,811 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:32:31,812 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:32:31,812 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-17 15:32:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:32:31,829 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.6))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:32:31,832 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.7))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:32:31,834 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.8))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-17 15:32:31,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:32:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:32:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:32:31,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:32:31,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489894043] [2022-03-17 15:32:31,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489894043] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:32:31,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696250899] [2022-03-17 15:32:31,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:32:31,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:32:31,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:32:31,998 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-03-17 15:32:31,999 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-03-17 15:32:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:32:32,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 15:32:32,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:32:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:32:32,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:33:00,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:33:00,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696250899] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:33:00,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:33:00,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 13 [2022-03-17 15:33:00,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360939115] [2022-03-17 15:33:00,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:33:00,552 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-17 15:33:00,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:33:00,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-17 15:33:00,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=112, Unknown=11, NotChecked=0, Total=156 [2022-03-17 15:33:00,553 INFO L87 Difference]: Start difference. First operand 46 states and 74 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:33:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:33:00,867 INFO L93 Difference]: Finished difference Result 71 states and 112 transitions. [2022-03-17 15:33:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-17 15:33:00,868 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-17 15:33:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:33:00,868 INFO L225 Difference]: With dead ends: 71 [2022-03-17 15:33:00,868 INFO L226 Difference]: Without dead ends: 61 [2022-03-17 15:33:00,869 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=74, Invalid=257, Unknown=11, NotChecked=0, Total=342 [2022-03-17 15:33:00,869 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 47 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:33:00,869 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 66 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2022-03-17 15:33:00,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-17 15:33:00,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2022-03-17 15:33:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 47 states have internal predecessors, (79), 3 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-03-17 15:33:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 83 transitions. [2022-03-17 15:33:00,872 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 83 transitions. Word has length 20 [2022-03-17 15:33:00,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:33:00,882 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 83 transitions. [2022-03-17 15:33:00,882 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:33:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 83 transitions. [2022-03-17 15:33:00,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-17 15:33:00,883 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:33:00,883 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:33:00,900 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-03-17 15:33:01,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-17 15:33:01,091 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:33:01,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:33:01,093 INFO L85 PathProgramCache]: Analyzing trace with hash 2118261262, now seen corresponding path program 1 times [2022-03-17 15:33:01,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:33:01,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103848870] [2022-03-17 15:33:01,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:33:01,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:33:01,096 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:33:01,097 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:33:01,098 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:33:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:33:01,111 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:33:01,113 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:33:01,123 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:33:01,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:33:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:33:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:33:01,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:33:01,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103848870] [2022-03-17 15:33:01,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103848870] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:33:01,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036744704] [2022-03-17 15:33:01,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:33:01,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:33:01,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:33:01,385 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-03-17 15:33:01,386 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-03-17 15:33:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:33:01,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-17 15:33:01,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:33:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:33:01,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:33:32,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_42_31 Int) (aux_mod_v_main_~y~0_35_31 Int)) (or (< aux_mod_v_main_~y~0_35_31 0) (and (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse0) (forall ((aux_div_v_main_~y~0_35_31 Int) (aux_div_v_main_~z~0_40_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_35_31 4294967296))) (let ((.cse3 (+ c_main_~y~0 c_main_~z~0)) (.cse2 (+ (* 4294967296 aux_div_v_main_~z~0_40_31) aux_mod_v_main_~y~0_35_31 .cse1))) (or (not (< (+ aux_mod_v_main_~y~0_35_31 .cse1) c_main_~y~0)) (< .cse2 .cse3) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296) 1) c_main_~y~0))) (< .cse3 .cse2)))))) (or .cse0 (< (div (+ (- 1) (* (- 1) c_main_~z~0)) (- 4294967296)) (+ 2 (div (+ (- 1) c_main_~z~0) 4294967296))) (forall ((aux_div_v_main_~y~0_35_31 Int)) (not (= (+ aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296)) c_main_~y~0)))))) (not (= (mod (+ aux_mod_v_main_~x~0_42_31 (* 4294967295 c_main_~x~0)) 4294967296) 0))) (forall ((aux_div_v_main_~x~0_42_31 Int)) (or (let ((.cse4 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse4) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_42_31 (* aux_div_v_main_~x~0_42_31 4294967296))) (<= 1 v_it_5) (not (< 0 (mod (+ (* v_it_5 4294967295) (* 4294967295 aux_mod_v_main_~y~0_35_31) c_main_~y~0 c_main_~z~0) 4294967296))))) (forall ((aux_div_v_main_~y~0_35_31 Int) (aux_div_v_main_~z~0_40_31 Int)) (let ((.cse7 (* 4294967296 aux_div_v_main_~z~0_40_31)) (.cse5 (* aux_div_v_main_~y~0_35_31 4294967296)) (.cse6 (+ c_main_~y~0 c_main_~z~0))) (or (not (< (+ aux_mod_v_main_~y~0_35_31 .cse5) c_main_~y~0)) (<= .cse6 (+ .cse7 aux_mod_v_main_~y~0_35_31 .cse5)) (<= (+ .cse7 aux_mod_v_main_~y~0_35_31 4294967296 .cse5) .cse6) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296) 1) c_main_~y~0))))))) (or .cse4 (<= (div (* (- 1) c_main_~z~0) (- 4294967296)) (+ (div (+ (- 4294967296) c_main_~z~0) 4294967296) 1)) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_42_31 (* aux_div_v_main_~x~0_42_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (forall ((aux_div_v_main_~y~0_35_31 Int)) (not (= (+ aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296)) c_main_~y~0)))))) (<= (+ aux_mod_v_main_~x~0_42_31 (* aux_div_v_main_~x~0_42_31 4294967296)) c_main_~x~0)))) (<= 4294967296 aux_mod_v_main_~x~0_42_31) (<= aux_mod_v_main_~x~0_42_31 0) (< 0 aux_mod_v_main_~y~0_35_31))) is different from false [2022-03-17 15:33:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-17 15:33:56,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036744704] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:33:56,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:33:56,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 11] total 20 [2022-03-17 15:33:56,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297162585] [2022-03-17 15:33:56,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:33:56,798 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-17 15:33:56,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:33:56,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-17 15:33:56,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=262, Unknown=12, NotChecked=34, Total=380 [2022-03-17 15:33:56,799 INFO L87 Difference]: Start difference. First operand 52 states and 83 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:34:11,416 WARN L232 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:34:49,782 WARN L232 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 113 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:35:08,773 WARN L232 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 87 DAG size of output: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:35:58,027 WARN L232 SmtUtils]: Spent 22.22s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:36:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:36:20,187 INFO L93 Difference]: Finished difference Result 75 states and 115 transitions. [2022-03-17 15:36:20,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-17 15:36:20,187 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-17 15:36:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:36:20,188 INFO L225 Difference]: With dead ends: 75 [2022-03-17 15:36:20,188 INFO L226 Difference]: Without dead ends: 71 [2022-03-17 15:36:20,188 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 179.0s TimeCoverageRelationStatistics Valid=176, Invalid=705, Unknown=53, NotChecked=58, Total=992 [2022-03-17 15:36:20,189 INFO L912 BasicCegarLoop]: 14 mSDtfsCounter, 48 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 15:36:20,189 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 97 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 119 Invalid, 0 Unknown, 145 Unchecked, 0.2s Time] [2022-03-17 15:36:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-03-17 15:36:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2022-03-17 15:36:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 3 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-03-17 15:36:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-03-17 15:36:20,191 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 20 [2022-03-17 15:36:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:36:20,191 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-03-17 15:36:20,191 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:36:20,191 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-03-17 15:36:20,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-17 15:36:20,192 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:36:20,192 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:36:20,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-17 15:36:20,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-17 15:36:20,395 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:36:20,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:36:20,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1929500051, now seen corresponding path program 1 times [2022-03-17 15:36:20,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:36:20,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020116501] [2022-03-17 15:36:20,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:36:20,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:36:20,400 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:36:20,401 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:36:20,401 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_11 .cse0 (* (- 4294967296) (div (+ main_~y~0_11 .cse0) 4294967296)))) 0)) [2022-03-17 15:36:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:36:20,411 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.6))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:36:20,413 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.7))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:36:20,416 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.8))) (+ main_~y~0_11 .cse0 (* (- 4294967296) (div (+ main_~y~0_11 .cse0) 4294967296)))) 0)) [2022-03-17 15:36:20,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:36:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:36:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-17 15:36:20,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:36:20,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020116501] [2022-03-17 15:36:20,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020116501] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:36:20,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:36:20,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-17 15:36:20,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136911677] [2022-03-17 15:36:20,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:36:20,556 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 15:36:20,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:36:20,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 15:36:20,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-17 15:36:20,557 INFO L87 Difference]: Start difference. First operand 50 states and 80 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-03-17 15:36:20,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:36:20,708 INFO L93 Difference]: Finished difference Result 62 states and 96 transitions. [2022-03-17 15:36:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 15:36:20,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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 20 [2022-03-17 15:36:20,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:36:20,709 INFO L225 Difference]: With dead ends: 62 [2022-03-17 15:36:20,709 INFO L226 Difference]: Without dead ends: 57 [2022-03-17 15:36:20,709 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-17 15:36:20,710 INFO L912 BasicCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:36:20,710 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 44 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 10 Unchecked, 0.1s Time] [2022-03-17 15:36:20,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-03-17 15:36:20,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-03-17 15:36:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 46 states have internal predecessors, (78), 3 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-03-17 15:36:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 82 transitions. [2022-03-17 15:36:20,712 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 82 transitions. Word has length 20 [2022-03-17 15:36:20,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:36:20,712 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 82 transitions. [2022-03-17 15:36:20,712 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-03-17 15:36:20,712 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 82 transitions. [2022-03-17 15:36:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-17 15:36:20,716 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:36:20,716 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:36:20,717 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-17 15:36:20,717 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:36:20,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:36:20,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1592480168, now seen corresponding path program 1 times [2022-03-17 15:36:20,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:36:20,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973997661] [2022-03-17 15:36:20,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:36:20,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:36:20,721 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:36:20,722 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:36:20,722 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:36:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:36:20,735 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.6))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:36:20,737 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.7))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:36:20,739 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.8))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:36:20,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:36:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:36:20,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:36:20,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:36:20,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973997661] [2022-03-17 15:36:20,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973997661] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:36:20,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102648228] [2022-03-17 15:36:20,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:36:20,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:36:20,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:36:20,894 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:36:20,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-17 15:36:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:36:20,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-17 15:36:20,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:36:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:36:21,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:36:55,680 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_46_31 Int) (v_main_~x~0_47 Int)) (or (<= aux_mod_v_main_~x~0_46_31 0) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (not (= v_main_~x~0_47 c_main_~x~0))) (or (not .cse0) (not (< v_main_~x~0_47 c_main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_main_~x~0_47 v_it_4 1) c_main_~x~0) (<= 1 v_it_4)))))) (<= 4294967296 aux_mod_v_main_~x~0_46_31) (and (forall ((aux_div_v_main_~x~0_46_31 Int) (aux_mod_v_main_~z~0_45_31 Int)) (or (<= 4294967296 aux_mod_v_main_~z~0_45_31) (<= aux_mod_v_main_~z~0_45_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_main_~x~0_47 v_it_5 1) (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))) (<= 1 v_it_5))) (<= (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296)) v_main_~x~0_47) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse1 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse1) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))))) (or (forall ((aux_div_v_main_~x~0_46_31 Int)) (not (= v_main_~x~0_47 (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))))) (forall ((aux_mod_v_main_~z~0_45_31 Int)) (or (< 0 aux_mod_v_main_~z~0_45_31) (let ((.cse2 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse2 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse2) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))) (< aux_mod_v_main_~z~0_45_31 0))))))) is different from true [2022-03-17 15:37:03,442 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((aux_mod_v_main_~x~0_46_31 Int) (v_main_~x~0_47 Int)) (or (<= aux_mod_v_main_~x~0_46_31 0) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (not (= v_main_~x~0_47 c_main_~x~0))) (or (not .cse0) (not (< v_main_~x~0_47 c_main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_main_~x~0_47 v_it_4 1) c_main_~x~0) (<= 1 v_it_4)))))) (and (forall ((aux_div_v_main_~x~0_46_31 Int) (aux_mod_v_main_~z~0_45_31 Int)) (or (<= 4294967296 aux_mod_v_main_~z~0_45_31) (<= aux_mod_v_main_~z~0_45_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_main_~x~0_47 v_it_5 1) (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))) (<= 1 v_it_5))) (not (< 0 (mod c_main_~y~0 4294967296))) (<= (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296)) v_main_~x~0_47) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))))) (or (forall ((aux_div_v_main_~x~0_46_31 Int)) (not (= v_main_~x~0_47 (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))))) (forall ((aux_mod_v_main_~z~0_45_31 Int)) (or (< 0 aux_mod_v_main_~z~0_45_31) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse1 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse1) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))) (< aux_mod_v_main_~z~0_45_31 0))))) (<= 4294967296 aux_mod_v_main_~x~0_46_31))) (< 0 (mod c_main_~z~0 4294967296))) is different from true [2022-03-17 15:37:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-17 15:37:09,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102648228] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:37:09,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:37:09,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2022-03-17 15:37:09,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695578688] [2022-03-17 15:37:09,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:37:09,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-17 15:37:09,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:37:09,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-17 15:37:09,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=164, Unknown=6, NotChecked=54, Total=272 [2022-03-17 15:37:09,746 INFO L87 Difference]: Start difference. First operand 51 states and 82 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:37:26,143 WARN L232 SmtUtils]: Spent 10.08s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:37:59,015 WARN L232 SmtUtils]: Spent 16.10s on a formula simplification that was a NOOP. DAG size: 100 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:38:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:38:22,343 INFO L93 Difference]: Finished difference Result 70 states and 110 transitions. [2022-03-17 15:38:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-17 15:38:22,344 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-17 15:38:22,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:38:22,344 INFO L225 Difference]: With dead ends: 70 [2022-03-17 15:38:22,344 INFO L226 Difference]: Without dead ends: 67 [2022-03-17 15:38:22,345 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 90.1s TimeCoverageRelationStatistics Valid=135, Invalid=500, Unknown=23, NotChecked=98, Total=756 [2022-03-17 15:38:22,345 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 47 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:38:22,345 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 63 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 65 Invalid, 0 Unknown, 118 Unchecked, 0.1s Time] [2022-03-17 15:38:22,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-03-17 15:38:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2022-03-17 15:38:22,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 44 states have internal predecessors, (74), 3 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-03-17 15:38:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 78 transitions. [2022-03-17 15:38:22,347 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 78 transitions. Word has length 20 [2022-03-17 15:38:22,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:38:22,347 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 78 transitions. [2022-03-17 15:38:22,348 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:38:22,348 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 78 transitions. [2022-03-17 15:38:22,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-17 15:38:22,348 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:38:22,348 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:38:22,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-17 15:38:22,567 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-17 15:38:22,571 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:38:22,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:38:22,571 INFO L85 PathProgramCache]: Analyzing trace with hash -2096941357, now seen corresponding path program 2 times [2022-03-17 15:38:22,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:38:22,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748538207] [2022-03-17 15:38:22,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:38:22,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:38:22,576 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:38:22,577 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:38:22,578 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-17 15:38:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:38:22,607 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.6))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:38:22,609 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.7))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:38:22,610 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.8))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-17 15:38:22,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:38:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:38:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:38:22,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:38:22,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748538207] [2022-03-17 15:38:22,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748538207] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:38:22,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758966076] [2022-03-17 15:38:22,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:38:22,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:38:22,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:38:22,762 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:38:22,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-17 15:38:22,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:38:22,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:38:22,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 15:38:22,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:38:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:38:23,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:38:31,302 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_51_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_51_31) (<= aux_mod_v_main_~x~0_51_31 0) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse0) (and (or (< 0 (mod (+ aux_mod_v_main_~x~0_51_31 (* 4294967295 c_main_~x~0) c_main_~y~0) 4294967296)) (forall ((aux_div_v_main_~x~0_51_31 Int)) (or (not (< (+ aux_mod_v_main_~x~0_51_31 (* aux_div_v_main_~x~0_51_31 4294967296)) c_main_~x~0)) (exists ((v_it_6 Int)) (and (<= (+ aux_mod_v_main_~x~0_51_31 v_it_6 (* aux_div_v_main_~x~0_51_31 4294967296) 1) c_main_~x~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))) (forall ((aux_div_v_main_~x~0_51_31 Int) (aux_mod_v_main_~y~0_43_31 Int) (aux_div_v_main_~y~0_43_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_43_31 4294967296))) (or (<= aux_mod_v_main_~y~0_43_31 0) (<= (+ .cse1 aux_mod_v_main_~y~0_43_31 c_main_~x~0) (+ aux_mod_v_main_~x~0_51_31 c_main_~y~0 (* aux_div_v_main_~x~0_51_31 4294967296))) (<= c_main_~y~0 (+ .cse1 aux_mod_v_main_~y~0_43_31)) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 (* aux_div_v_main_~y~0_43_31 4294967296) aux_mod_v_main_~y~0_43_31 1) c_main_~y~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= 4294967296 aux_mod_v_main_~y~0_43_31) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_51_31 v_it_6 c_main_~y~0 (* aux_div_v_main_~x~0_51_31 4294967296) 1) (+ (* aux_div_v_main_~y~0_43_31 4294967296) aux_mod_v_main_~y~0_43_31 c_main_~x~0)) (not (< 0 (mod (+ aux_mod_v_main_~y~0_43_31 (* v_it_6 4294967295)) 4294967296)))))))))) (or .cse0 (forall ((aux_div_v_main_~x~0_51_31 Int)) (not (= (+ aux_mod_v_main_~x~0_51_31 (* aux_div_v_main_~x~0_51_31 4294967296)) c_main_~x~0)))))))) is different from true [2022-03-17 15:39:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-03-17 15:39:19,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758966076] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:39:19,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:39:19,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2022-03-17 15:39:19,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379375325] [2022-03-17 15:39:19,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:39:19,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-17 15:39:19,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:39:19,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-17 15:39:19,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=210, Unknown=8, NotChecked=30, Total=306 [2022-03-17 15:39:19,373 INFO L87 Difference]: Start difference. First operand 49 states and 78 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:39:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:39:23,485 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2022-03-17 15:39:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-17 15:39:23,485 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-17 15:39:23,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:39:23,486 INFO L225 Difference]: With dead ends: 69 [2022-03-17 15:39:23,486 INFO L226 Difference]: Without dead ends: 59 [2022-03-17 15:39:23,486 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=136, Invalid=509, Unknown=9, NotChecked=48, Total=702 [2022-03-17 15:39:23,486 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 49 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:39:23,487 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 72 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 86 Invalid, 0 Unknown, 76 Unchecked, 0.1s Time] [2022-03-17 15:39:23,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-17 15:39:23,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2022-03-17 15:39:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 48 states have internal predecessors, (80), 3 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-03-17 15:39:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 84 transitions. [2022-03-17 15:39:23,488 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 84 transitions. Word has length 20 [2022-03-17 15:39:23,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:39:23,489 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 84 transitions. [2022-03-17 15:39:23,489 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:39:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 84 transitions. [2022-03-17 15:39:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-17 15:39:23,489 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:39:23,489 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:39:23,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-17 15:39:23,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-17 15:39:23,703 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:39:23,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:39:23,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1165808695, now seen corresponding path program 1 times [2022-03-17 15:39:23,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:39:23,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868696676] [2022-03-17 15:39:23,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:39:23,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:39:23,707 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:39:23,708 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:39:23,709 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-17 15:39:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:39:23,721 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.8))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:39:23,724 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.9))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:39:23,726 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.10))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-17 15:39:23,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:39:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:39:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:39:23,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:39:23,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868696676] [2022-03-17 15:39:23,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868696676] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:39:23,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884012700] [2022-03-17 15:39:23,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:39:23,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:39:23,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:39:23,906 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:39:23,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-17 15:39:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:39:23,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 15:39:23,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:39:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:39:24,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:40:20,688 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_57_31 Int)) (or (and (forall ((aux_mod_v_main_~y~0_47_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse0) (forall ((aux_div_v_main_~y~0_47_31 Int)) (or (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31))) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse1) (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 c_main_~y~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< (+ c_main_~x~0 c_main_~y~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))))))) (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (not (= (+ c_main_~x~0 c_main_~y~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))))) .cse1))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)) (<= 1 v_it_4)))))) (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296)))))) (not (< 0 (mod c_main_~z~0 4294967296))) (forall ((aux_div_v_main_~y~0_47_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31) c_main_~y~0))) .cse0))) (< aux_mod_v_main_~y~0_47_31 0) (< 0 aux_mod_v_main_~y~0_47_31))) (forall ((aux_mod_v_main_~y~0_47_31 Int) (aux_div_v_main_~x~0_57_31 Int) (v_main_~x~0_58 Int)) (or (<= 4294967296 aux_mod_v_main_~y~0_47_31) (<= aux_mod_v_main_~y~0_47_31 0) (let ((.cse2 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not (= (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_47_31) 4294967296) 0)) .cse2 (let ((.cse3 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not (= v_main_~x~0_58 c_main_~x~0)) .cse3) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_58) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not .cse3) (not (< c_main_~x~0 v_main_~x~0_58)))))) (or (not .cse2) (forall ((aux_div_v_main_~y~0_47_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_47_31 4294967296))) (or (not (< c_main_~y~0 (+ .cse4 aux_mod_v_main_~y~0_47_31))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)) (<= 1 v_it_4))) (let ((.cse7 (< 0 (mod c_main_~z~0 4294967296))) (.cse5 (+ c_main_~x~0 c_main_~y~0)) (.cse6 (+ v_main_~x~0_58 .cse4 aux_mod_v_main_~y~0_47_31))) (and (or (not (= .cse5 .cse6)) .cse7) (or (not .cse7) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 c_main_~y~0 1) (+ v_main_~x~0_58 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)))) (not (< .cse5 .cse6))))))))))) (<= v_main_~x~0_58 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_57_31 v_it_6 (* aux_div_v_main_~x~0_57_31 4294967296) 1) v_main_~x~0_58) (not (< 0 (mod (+ aux_mod_v_main_~y~0_47_31 (* v_it_6 4294967295)) 4294967296)))))))) (<= aux_mod_v_main_~x~0_57_31 0) (<= 4294967296 aux_mod_v_main_~x~0_57_31))) is different from false [2022-03-17 15:40:22,696 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_57_31 Int)) (or (and (forall ((aux_mod_v_main_~y~0_47_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse0) (forall ((aux_div_v_main_~y~0_47_31 Int)) (or (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31))) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse1) (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 c_main_~y~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< (+ c_main_~x~0 c_main_~y~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))))))) (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (not (= (+ c_main_~x~0 c_main_~y~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))))) .cse1))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)) (<= 1 v_it_4)))))) (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296)))))) (not (< 0 (mod c_main_~z~0 4294967296))) (forall ((aux_div_v_main_~y~0_47_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31) c_main_~y~0))) .cse0))) (< aux_mod_v_main_~y~0_47_31 0) (< 0 aux_mod_v_main_~y~0_47_31))) (forall ((aux_mod_v_main_~y~0_47_31 Int) (aux_div_v_main_~x~0_57_31 Int) (v_main_~x~0_58 Int)) (or (<= 4294967296 aux_mod_v_main_~y~0_47_31) (<= aux_mod_v_main_~y~0_47_31 0) (let ((.cse2 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not (= (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_47_31) 4294967296) 0)) .cse2 (let ((.cse3 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not (= v_main_~x~0_58 c_main_~x~0)) .cse3) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_58) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not .cse3) (not (< c_main_~x~0 v_main_~x~0_58)))))) (or (not .cse2) (forall ((aux_div_v_main_~y~0_47_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_47_31 4294967296))) (or (not (< c_main_~y~0 (+ .cse4 aux_mod_v_main_~y~0_47_31))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)) (<= 1 v_it_4))) (let ((.cse7 (< 0 (mod c_main_~z~0 4294967296))) (.cse5 (+ c_main_~x~0 c_main_~y~0)) (.cse6 (+ v_main_~x~0_58 .cse4 aux_mod_v_main_~y~0_47_31))) (and (or (not (= .cse5 .cse6)) .cse7) (or (not .cse7) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 c_main_~y~0 1) (+ v_main_~x~0_58 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)))) (not (< .cse5 .cse6))))))))))) (<= v_main_~x~0_58 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_57_31 v_it_6 (* aux_div_v_main_~x~0_57_31 4294967296) 1) v_main_~x~0_58) (not (< 0 (mod (+ aux_mod_v_main_~y~0_47_31 (* v_it_6 4294967295)) 4294967296)))))))) (<= aux_mod_v_main_~x~0_57_31 0) (<= 4294967296 aux_mod_v_main_~x~0_57_31))) is different from true