/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-d966a43 [2022-01-31 12:53:22,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 12:53:22,829 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 12:53:22,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 12:53:22,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 12:53:22,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 12:53:22,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 12:53:22,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 12:53:22,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 12:53:22,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 12:53:22,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 12:53:22,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 12:53:22,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 12:53:22,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 12:53:22,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 12:53:22,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 12:53:22,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 12:53:22,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 12:53:22,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 12:53:22,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 12:53:22,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 12:53:22,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 12:53:22,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 12:53:22,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 12:53:22,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 12:53:22,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 12:53:22,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 12:53:22,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 12:53:22,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 12:53:22,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 12:53:22,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 12:53:22,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 12:53:22,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 12:53:22,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 12:53:22,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 12:53:22,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 12:53:22,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 12:53:22,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 12:53:22,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 12:53:22,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 12:53:22,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 12:53:22,914 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 12:53:22,920 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 12:53:22,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 12:53:22,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 12:53:22,921 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 12:53:22,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 12:53:22,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 12:53:22,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 12:53:22,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 12:53:22,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 12:53:22,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 12:53:22,922 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 12:53:22,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 12:53:22,922 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 12:53:22,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 12:53:22,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 12:53:22,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 12:53:22,923 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 12:53:22,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 12:53:22,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:53:22,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 12:53:22,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 12:53:22,924 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 12:53:22,924 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-01-31 12:53:23,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 12:53:23,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 12:53:23,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 12:53:23,119 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 12:53:23,120 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 12:53:23,121 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-01-31 12:53:23,167 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d90b20d5f/0c2da758c243416db9b01a034e5521fd/FLAG25392abf5 [2022-01-31 12:53:23,521 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 12:53:23,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-01-31 12:53:23,535 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d90b20d5f/0c2da758c243416db9b01a034e5521fd/FLAG25392abf5 [2022-01-31 12:53:23,964 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d90b20d5f/0c2da758c243416db9b01a034e5521fd [2022-01-31 12:53:23,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 12:53:23,967 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 12:53:23,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 12:53:23,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 12:53:23,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 12:53:23,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:53:23" (1/1) ... [2022-01-31 12:53:23,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@141f2de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:23, skipping insertion in model container [2022-01-31 12:53:23,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:53:23" (1/1) ... [2022-01-31 12:53:23,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 12:53:23,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 12:53:24,109 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-01-31 12:53:24,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:53:24,128 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 12:53:24,137 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-01-31 12:53:24,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:53:24,149 INFO L208 MainTranslator]: Completed translation [2022-01-31 12:53:24,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:24 WrapperNode [2022-01-31 12:53:24,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 12:53:24,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 12:53:24,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 12:53:24,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 12:53:24,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:24" (1/1) ... [2022-01-31 12:53:24,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:24" (1/1) ... [2022-01-31 12:53:24,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:24" (1/1) ... [2022-01-31 12:53:24,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:24" (1/1) ... [2022-01-31 12:53:24,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:24" (1/1) ... [2022-01-31 12:53:24,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:24" (1/1) ... [2022-01-31 12:53:24,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:24" (1/1) ... [2022-01-31 12:53:24,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 12:53:24,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 12:53:24,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 12:53:24,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 12:53:24,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:24" (1/1) ... [2022-01-31 12:53:24,186 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:53:24,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:24,210 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-01-31 12:53:24,214 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-01-31 12:53:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 12:53:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 12:53:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 12:53:24,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 12:53:24,238 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 12:53:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 12:53:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 12:53:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 12:53:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 12:53:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-01-31 12:53:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 12:53:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 12:53:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 12:53:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 12:53:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 12:53:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 12:53:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 12:53:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 12:53:24,282 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 12:53:24,283 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 12:53:24,384 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 12:53:24,388 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 12:53:24,388 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-31 12:53:24,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:53:24 BoogieIcfgContainer [2022-01-31 12:53:24,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 12:53:24,390 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 12:53:24,390 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 12:53:24,391 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 12:53:24,393 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:53:24" (1/1) ... [2022-01-31 12:53:24,516 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-01-31 12:53:24,516 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-01-31 12:53:24,648 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-01-31 12:53:24,649 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-01-31 12:53:24,705 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-01-31 12:53:24,706 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-01-31 12:53:24,789 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-01-31 12:53:24,789 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-01-31 12:53:24,864 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-01-31 12:53:24,864 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-01-31 12:53:24,937 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-01-31 12:53:24,938 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-01-31 12:53:24,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:53:24 BasicIcfg [2022-01-31 12:53:24,941 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 12:53:24,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 12:53:24,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 12:53:24,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 12:53:24,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 12:53:23" (1/4) ... [2022-01-31 12:53:24,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f8f8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:53:24, skipping insertion in model container [2022-01-31 12:53:24,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:24" (2/4) ... [2022-01-31 12:53:24,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f8f8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:53:24, skipping insertion in model container [2022-01-31 12:53:24,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:53:24" (3/4) ... [2022-01-31 12:53:24,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f8f8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 12:53:24, skipping insertion in model container [2022-01-31 12:53:24,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:53:24" (4/4) ... [2022-01-31 12:53:24,947 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de62.cJordan [2022-01-31 12:53:24,951 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 12:53:24,951 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 12:53:24,980 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 12:53:24,985 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 12:53:24,985 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 12:53:24,994 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-01-31 12:53:24,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 12:53:24,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:24,999 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:25,000 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:25,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:25,003 INFO L85 PathProgramCache]: Analyzing trace with hash 430051023, now seen corresponding path program 1 times [2022-01-31 12:53:25,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:25,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671649370] [2022-01-31 12:53:25,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:25,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:25,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:25,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:25,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671649370] [2022-01-31 12:53:25,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671649370] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:53:25,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:53:25,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 12:53:25,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746236137] [2022-01-31 12:53:25,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:53:25,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 12:53:25,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:25,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 12:53:25,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 12:53:25,155 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-01-31 12:53:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:25,182 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-01-31 12:53:25,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 12:53:25,184 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-01-31 12:53:25,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:25,189 INFO L225 Difference]: With dead ends: 25 [2022-01-31 12:53:25,189 INFO L226 Difference]: Without dead ends: 18 [2022-01-31 12:53:25,190 INFO L932 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-01-31 12:53:25,192 INFO L933 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-01-31 12:53:25,193 INFO L934 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-01-31 12:53:25,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-01-31 12:53:25,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-01-31 12:53:25,213 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-01-31 12:53:25,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-01-31 12:53:25,214 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-01-31 12:53:25,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:25,215 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-01-31 12:53:25,215 INFO L471 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-01-31 12:53:25,215 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-01-31 12:53:25,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 12:53:25,215 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:25,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:25,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 12:53:25,216 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:25,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:25,216 INFO L85 PathProgramCache]: Analyzing trace with hash -514488111, now seen corresponding path program 1 times [2022-01-31 12:53:25,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:25,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139376233] [2022-01-31 12:53:25,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:25,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:25,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:25,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:25,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139376233] [2022-01-31 12:53:25,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139376233] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:53:25,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:53:25,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 12:53:25,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546736582] [2022-01-31 12:53:25,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:53:25,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 12:53:25,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:25,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 12:53:25,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 12:53:25,285 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-01-31 12:53:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:25,338 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-01-31 12:53:25,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 12:53:25,339 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-01-31 12:53:25,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:25,339 INFO L225 Difference]: With dead ends: 28 [2022-01-31 12:53:25,339 INFO L226 Difference]: Without dead ends: 25 [2022-01-31 12:53:25,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 12:53:25,341 INFO L933 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-01-31 12:53:25,341 INFO L934 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-01-31 12:53:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-31 12:53:25,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2022-01-31 12:53:25,344 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-01-31 12:53:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-01-31 12:53:25,344 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 17 [2022-01-31 12:53:25,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:25,344 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-01-31 12:53:25,345 INFO L471 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-01-31 12:53:25,345 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-01-31 12:53:25,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:53:25,345 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:25,345 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:25,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 12:53:25,346 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:25,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:25,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1257458414, now seen corresponding path program 1 times [2022-01-31 12:53:25,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:25,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151024697] [2022-01-31 12:53:25,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:25,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:25,356 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-01-31 12:53:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:25,376 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-01-31 12:53:25,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:25,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:25,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151024697] [2022-01-31 12:53:25,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151024697] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:25,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517303737] [2022-01-31 12:53:25,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:25,427 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:25,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:25,429 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-01-31 12:53:25,454 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-01-31 12:53:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:25,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 12:53:25,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:25,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:53:28,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:28,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517303737] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:53:28,271 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:53:28,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-01-31 12:53:28,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190024967] [2022-01-31 12:53:28,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:53:28,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 12:53:28,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:28,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 12:53:28,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=68, Unknown=1, NotChecked=0, Total=90 [2022-01-31 12:53:28,273 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-01-31 12:53:28,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:28,349 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2022-01-31 12:53:28,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 12:53:28,350 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-01-31 12:53:28,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:28,351 INFO L225 Difference]: With dead ends: 31 [2022-01-31 12:53:28,352 INFO L226 Difference]: Without dead ends: 28 [2022-01-31 12:53:28,352 INFO L932 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-01-31 12:53:28,353 INFO L933 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.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:53:28,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 57 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 32 Unchecked, 0.0s Time] [2022-01-31 12:53:28,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-31 12:53:28,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-01-31 12:53:28,356 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-01-31 12:53:28,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-01-31 12:53:28,357 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 18 [2022-01-31 12:53:28,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:28,357 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-01-31 12:53:28,357 INFO L471 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-01-31 12:53:28,357 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-01-31 12:53:28,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:53:28,357 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:28,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:28,378 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-01-31 12:53:28,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:28,568 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:28,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:28,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2030445491, now seen corresponding path program 1 times [2022-01-31 12:53:28,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:28,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027774143] [2022-01-31 12:53:28,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:28,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:28,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-01-31 12:53:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:28,588 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-01-31 12:53:28,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:28,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:28,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027774143] [2022-01-31 12:53:28,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027774143] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:28,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799465340] [2022-01-31 12:53:28,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:28,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:28,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:28,635 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-01-31 12:53:28,636 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-01-31 12:53:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:28,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 12:53:28,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:28,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:28,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:53:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:29,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799465340] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:53:29,270 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:53:29,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-01-31 12:53:29,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797811186] [2022-01-31 12:53:29,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:53:29,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 12:53:29,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:29,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 12:53:29,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-31 12:53:29,272 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-01-31 12:53:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:29,346 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2022-01-31 12:53:29,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 12:53:29,346 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-01-31 12:53:29,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:29,348 INFO L225 Difference]: With dead ends: 38 [2022-01-31 12:53:29,348 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 12:53:29,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-01-31 12:53:29,350 INFO L933 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-01-31 12:53:29,351 INFO L934 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-01-31 12:53:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 12:53:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-01-31 12:53:29,357 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-01-31 12:53:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2022-01-31 12:53:29,359 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 18 [2022-01-31 12:53:29,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:29,361 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2022-01-31 12:53:29,365 INFO L471 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-01-31 12:53:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2022-01-31 12:53:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:53:29,366 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:29,366 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:29,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 12:53:29,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-31 12:53:29,587 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:29,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:29,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1868584369, now seen corresponding path program 1 times [2022-01-31 12:53:29,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:29,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513063307] [2022-01-31 12:53:29,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:29,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:29,597 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-01-31 12:53:29,603 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-01-31 12:53:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:29,660 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-01-31 12:53:29,664 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-01-31 12:53:29,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:53:29,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:29,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513063307] [2022-01-31 12:53:29,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513063307] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:29,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603643768] [2022-01-31 12:53:29,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:29,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:29,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:29,758 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-01-31 12:53:29,772 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-01-31 12:53:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:29,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-31 12:53:29,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:29,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:53:53,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:53,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603643768] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:53:53,955 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:53:53,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2022-01-31 12:53:53,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701597661] [2022-01-31 12:53:53,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:53:53,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 12:53:53,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:53,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 12:53:53,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=184, Unknown=8, NotChecked=0, Total=240 [2022-01-31 12:53:53,956 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-01-31 12:54:42,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:54:42,323 INFO L93 Difference]: Finished difference Result 59 states and 91 transitions. [2022-01-31 12:54:42,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 12:54:42,324 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-01-31 12:54:42,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:54:42,324 INFO L225 Difference]: With dead ends: 59 [2022-01-31 12:54:42,324 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 12:54:42,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 69.4s TimeCoverageRelationStatistics Valid=138, Invalid=538, Unknown=26, NotChecked=0, Total=702 [2022-01-31 12:54:42,325 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:54:42,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 72 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 86 Invalid, 0 Unknown, 93 Unchecked, 0.1s Time] [2022-01-31 12:54:42,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 12:54:42,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2022-01-31 12:54:42,328 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-01-31 12:54:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 58 transitions. [2022-01-31 12:54:42,329 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 58 transitions. Word has length 19 [2022-01-31 12:54:42,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:54:42,329 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 58 transitions. [2022-01-31 12:54:42,329 INFO L471 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-01-31 12:54:42,329 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 58 transitions. [2022-01-31 12:54:42,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:54:42,330 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:54:42,330 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:54:42,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-31 12:54:42,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:54:42,531 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:54:42,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:54:42,531 INFO L85 PathProgramCache]: Analyzing trace with hash 353225841, now seen corresponding path program 2 times [2022-01-31 12:54:42,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:54:42,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221540490] [2022-01-31 12:54:42,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:54:42,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:54:42,537 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-01-31 12:54:42,538 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-01-31 12:54:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:54:42,556 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-01-31 12:54:42,559 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-01-31 12:54:42,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:54:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:54:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:54:42,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:54:42,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221540490] [2022-01-31 12:54:42,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221540490] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:54:42,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319569521] [2022-01-31 12:54:42,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 12:54:42,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:54:42,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:54:42,641 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-01-31 12:54:42,644 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-01-31 12:54:42,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 12:54:42,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:54:42,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 12:54:42,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:54:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:54:42,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:54:51,271 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_24_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_24_31) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse0) (and (forall ((aux_div_v_main_~x~0_24_31 Int) (aux_div_v_main_~y~0_20_31 Int) (aux_mod_v_main_~y~0_20_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_20_31 4294967296))) (or (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_20_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_24_31 v_it_6 (* aux_div_v_main_~x~0_24_31 4294967296) c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_20_31 4294967296) aux_mod_v_main_~y~0_20_31 c_main_~x~0)))) (<= aux_mod_v_main_~y~0_20_31 0) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 (* aux_div_v_main_~y~0_20_31 4294967296) aux_mod_v_main_~y~0_20_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse1 aux_mod_v_main_~y~0_20_31 c_main_~x~0) (+ aux_mod_v_main_~x~0_24_31 (* aux_div_v_main_~x~0_24_31 4294967296) c_main_~y~0)) (<= c_main_~y~0 (+ .cse1 aux_mod_v_main_~y~0_20_31)) (<= 4294967296 aux_mod_v_main_~y~0_20_31)))) (or (forall ((aux_div_v_main_~x~0_24_31 Int)) (or (not (< (+ aux_mod_v_main_~x~0_24_31 (* aux_div_v_main_~x~0_24_31 4294967296)) c_main_~x~0)) (exists ((v_it_6 Int)) (and (<= (+ aux_mod_v_main_~x~0_24_31 v_it_6 (* aux_div_v_main_~x~0_24_31 4294967296) 1) c_main_~x~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))))) (< 0 (mod (+ aux_mod_v_main_~x~0_24_31 (* 4294967295 c_main_~x~0) c_main_~y~0) 4294967296))))) (or (forall ((aux_div_v_main_~x~0_24_31 Int)) (not (= (+ aux_mod_v_main_~x~0_24_31 (* aux_div_v_main_~x~0_24_31 4294967296)) c_main_~x~0))) .cse0))) (<= aux_mod_v_main_~x~0_24_31 0))) is different from false [2022-01-31 12:54:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-31 12:54:53,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319569521] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:54:53,616 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:54:53,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 13 [2022-01-31 12:54:53,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188889890] [2022-01-31 12:54:53,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:54:53,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 12:54:53,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:54:53,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 12:54:53,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=102, Unknown=3, NotChecked=20, Total=156 [2022-01-31 12:54:53,618 INFO L87 Difference]: Start difference. First operand 37 states and 58 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 10 states have internal predecessors, (32), 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-01-31 12:54:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:54:53,940 INFO L93 Difference]: Finished difference Result 56 states and 86 transitions. [2022-01-31 12:54:53,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 12:54:53,941 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 10 states have internal predecessors, (32), 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-01-31 12:54:53,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:54:53,941 INFO L225 Difference]: With dead ends: 56 [2022-01-31 12:54:53,941 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 12:54:53,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=70, Invalid=237, Unknown=3, NotChecked=32, Total=342 [2022-01-31 12:54:53,942 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:54:53,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 52 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 50 Invalid, 0 Unknown, 48 Unchecked, 0.0s Time] [2022-01-31 12:54:53,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 12:54:53,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2022-01-31 12:54:53,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 36 states have internal predecessors, (60), 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-01-31 12:54:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2022-01-31 12:54:53,945 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 19 [2022-01-31 12:54:53,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:54:53,946 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2022-01-31 12:54:53,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 10 states have internal predecessors, (32), 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-01-31 12:54:53,946 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2022-01-31 12:54:53,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:54:53,946 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:54:53,946 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:54:53,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-31 12:54:54,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:54:54,156 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:54:54,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:54:54,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1453978548, now seen corresponding path program 1 times [2022-01-31 12:54:54,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:54:54,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739953713] [2022-01-31 12:54:54,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:54:54,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:54:54,161 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-01-31 12:54:54,162 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-01-31 12:54:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:54:54,171 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-01-31 12:54:54,174 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-01-31 12:54:54,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:54:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:54:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:54:54,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:54:54,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739953713] [2022-01-31 12:54:54,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739953713] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:54:54,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495828437] [2022-01-31 12:54:54,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:54:54,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:54:54,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:54:54,253 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-01-31 12:54:54,254 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-01-31 12:54:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:54:54,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 12:54:54,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:54:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:54:54,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:55:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:55:11,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495828437] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:55:11,723 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:55:11,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2022-01-31 12:55:11,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248944005] [2022-01-31 12:55:11,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:55:11,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 12:55:11,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:55:11,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 12:55:11,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=139, Unknown=6, NotChecked=0, Total=182 [2022-01-31 12:55:11,725 INFO L87 Difference]: Start difference. First operand 41 states and 64 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-01-31 12:55:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:55:13,382 INFO L93 Difference]: Finished difference Result 54 states and 83 transitions. [2022-01-31 12:55:13,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 12:55:13,382 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-01-31 12:55:13,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:55:13,383 INFO L225 Difference]: With dead ends: 54 [2022-01-31 12:55:13,383 INFO L226 Difference]: Without dead ends: 51 [2022-01-31 12:55:13,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=73, Invalid=263, Unknown=6, NotChecked=0, Total=342 [2022-01-31 12:55:13,383 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:55:13,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 66 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 46 Invalid, 0 Unknown, 57 Unchecked, 0.1s Time] [2022-01-31 12:55:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-31 12:55:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2022-01-31 12:55:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 36 states have internal predecessors, (60), 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-01-31 12:55:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2022-01-31 12:55:13,387 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 19 [2022-01-31 12:55:13,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:55:13,387 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2022-01-31 12:55:13,387 INFO L471 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-01-31 12:55:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2022-01-31 12:55:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:55:13,388 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:55:13,388 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:55:13,409 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-01-31 12:55:13,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:55:13,591 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:55:13,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:55:13,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1642739759, now seen corresponding path program 1 times [2022-01-31 12:55:13,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:55:13,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137689018] [2022-01-31 12:55:13,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:13,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:55:13,596 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-01-31 12:55:13,597 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-01-31 12:55:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:13,610 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-01-31 12:55:13,613 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-01-31 12:55:13,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:55:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:55:13,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:55:13,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137689018] [2022-01-31 12:55:13,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137689018] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:55:13,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:55:13,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 12:55:13,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484031399] [2022-01-31 12:55:13,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:55:13,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 12:55:13,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:55:13,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 12:55:13,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-31 12:55:13,706 INFO L87 Difference]: Start difference. First operand 41 states and 64 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-01-31 12:55:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:55:13,866 INFO L93 Difference]: Finished difference Result 57 states and 88 transitions. [2022-01-31 12:55:13,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 12:55:13,866 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-01-31 12:55:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:55:13,869 INFO L225 Difference]: With dead ends: 57 [2022-01-31 12:55:13,869 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 12:55:13,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-31 12:55:13,870 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:55:13,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 47 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 69 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-01-31 12:55:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 12:55:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2022-01-31 12:55:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 38 states have internal predecessors, (63), 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-01-31 12:55:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2022-01-31 12:55:13,878 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 19 [2022-01-31 12:55:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:55:13,878 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2022-01-31 12:55:13,879 INFO L471 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-01-31 12:55:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2022-01-31 12:55:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:55:13,879 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:55:13,879 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:55:13,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 12:55:13,879 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:55:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:55:13,880 INFO L85 PathProgramCache]: Analyzing trace with hash -869752682, now seen corresponding path program 1 times [2022-01-31 12:55:13,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:55:13,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635108426] [2022-01-31 12:55:13,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:13,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:55:13,884 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-01-31 12:55:13,885 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-01-31 12:55:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:13,914 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-01-31 12:55:13,917 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-01-31 12:55:13,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:55:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:55:13,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:55:13,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635108426] [2022-01-31 12:55:13,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635108426] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:55:13,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460098122] [2022-01-31 12:55:13,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:13,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:55:13,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:55:13,980 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-01-31 12:55:13,981 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-01-31 12:55:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:14,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 12:55:14,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:55:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:55:14,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:55:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:55:32,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460098122] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:55:32,927 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:55:32,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8] total 12 [2022-01-31 12:55:32,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024960985] [2022-01-31 12:55:32,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:55:32,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 12:55:32,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:55:32,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 12:55:32,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=99, Unknown=5, NotChecked=0, Total=132 [2022-01-31 12:55:32,929 INFO L87 Difference]: Start difference. First operand 43 states and 67 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-01-31 12:55:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:55:33,096 INFO L93 Difference]: Finished difference Result 58 states and 91 transitions. [2022-01-31 12:55:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 12:55:33,096 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-01-31 12:55:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:55:33,097 INFO L225 Difference]: With dead ends: 58 [2022-01-31 12:55:33,097 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 12:55:33,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=55, Invalid=180, Unknown=5, NotChecked=0, Total=240 [2022-01-31 12:55:33,097 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:55:33,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 65 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 53 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2022-01-31 12:55:33,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 12:55:33,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2022-01-31 12:55:33,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.675) internal successors, (67), 40 states have internal predecessors, (67), 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-01-31 12:55:33,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 71 transitions. [2022-01-31 12:55:33,100 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 71 transitions. Word has length 19 [2022-01-31 12:55:33,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:55:33,100 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 71 transitions. [2022-01-31 12:55:33,101 INFO L471 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-01-31 12:55:33,101 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 71 transitions. [2022-01-31 12:55:33,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:55:33,101 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:55:33,101 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:55:33,121 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-01-31 12:55:33,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:55:33,304 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:55:33,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:55:33,304 INFO L85 PathProgramCache]: Analyzing trace with hash 84699953, now seen corresponding path program 1 times [2022-01-31 12:55:33,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:55:33,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669167234] [2022-01-31 12:55:33,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:33,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:55:33,307 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-01-31 12:55:33,309 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-01-31 12:55:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:33,318 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-01-31 12:55:33,321 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-01-31 12:55:33,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:55:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:55:33,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:55:33,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669167234] [2022-01-31 12:55:33,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669167234] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:55:33,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877191107] [2022-01-31 12:55:33,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:33,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:55:33,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:55:33,399 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-01-31 12:55:33,400 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-01-31 12:55:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:33,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 12:55:33,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:55:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:55:33,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:55:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:55:38,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877191107] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:55:38,428 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:55:38,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 14 [2022-01-31 12:55:38,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166417592] [2022-01-31 12:55:38,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:55:38,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 12:55:38,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:55:38,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 12:55:38,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=144, Unknown=1, NotChecked=0, Total=182 [2022-01-31 12:55:38,429 INFO L87 Difference]: Start difference. First operand 45 states and 71 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-01-31 12:55:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:55:38,589 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-01-31 12:55:38,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 12:55:38,589 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-01-31 12:55:38,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:55:38,590 INFO L225 Difference]: With dead ends: 64 [2022-01-31 12:55:38,590 INFO L226 Difference]: Without dead ends: 61 [2022-01-31 12:55:38,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=101, Invalid=360, Unknown=1, NotChecked=0, Total=462 [2022-01-31 12:55:38,590 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:55:38,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 71 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 88 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-01-31 12:55:38,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-31 12:55:38,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2022-01-31 12:55:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 39 states have internal predecessors, (65), 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-01-31 12:55:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 69 transitions. [2022-01-31 12:55:38,593 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 69 transitions. Word has length 19 [2022-01-31 12:55:38,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:55:38,593 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 69 transitions. [2022-01-31 12:55:38,593 INFO L471 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-01-31 12:55:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 69 transitions. [2022-01-31 12:55:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:55:38,594 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:55:38,594 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:55:38,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-31 12:55:38,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:55:38,807 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:55:38,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:55:38,808 INFO L85 PathProgramCache]: Analyzing trace with hash 857687030, now seen corresponding path program 1 times [2022-01-31 12:55:38,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:55:38,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213166092] [2022-01-31 12:55:38,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:38,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:55:38,813 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-01-31 12:55:38,817 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-01-31 12:55:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:38,833 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-01-31 12:55:38,859 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-01-31 12:55:38,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:55:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:55:38,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:55:38,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213166092] [2022-01-31 12:55:38,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213166092] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:55:38,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258702801] [2022-01-31 12:55:38,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:38,943 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:55:38,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:55:38,945 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-01-31 12:55:38,946 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-01-31 12:55:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:38,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 12:55:38,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:55:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:55:39,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:55:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:55:41,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258702801] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:55:41,922 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:55:41,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 14 [2022-01-31 12:55:41,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557123369] [2022-01-31 12:55:41,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:55:41,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 12:55:41,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:55:41,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 12:55:41,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=145, Unknown=1, NotChecked=0, Total=182 [2022-01-31 12:55:41,924 INFO L87 Difference]: Start difference. First operand 44 states and 69 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-01-31 12:55:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:55:42,054 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2022-01-31 12:55:42,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 12:55:42,054 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-01-31 12:55:42,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:55:42,056 INFO L225 Difference]: With dead ends: 62 [2022-01-31 12:55:42,056 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 12:55:42,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=93, Invalid=368, Unknown=1, NotChecked=0, Total=462 [2022-01-31 12:55:42,062 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 48 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:55:42,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 53 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 67 Invalid, 0 Unknown, 25 Unchecked, 0.0s Time] [2022-01-31 12:55:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 12:55:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2022-01-31 12:55:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 39 states have internal predecessors, (65), 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-01-31 12:55:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 69 transitions. [2022-01-31 12:55:42,083 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 69 transitions. Word has length 19 [2022-01-31 12:55:42,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:55:42,083 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 69 transitions. [2022-01-31 12:55:42,083 INFO L471 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-01-31 12:55:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 69 transitions. [2022-01-31 12:55:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 12:55:42,084 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:55:42,084 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:55:42,104 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-01-31 12:55:42,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-31 12:55:42,301 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:55:42,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:55:42,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1145856883, now seen corresponding path program 2 times [2022-01-31 12:55:42,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:55:42,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823896793] [2022-01-31 12:55:42,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:42,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:55:42,305 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-01-31 12:55:42,316 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-01-31 12:55:42,318 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-01-31 12:55:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:42,333 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-01-31 12:55:42,335 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-01-31 12:55:42,338 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-01-31 12:55:42,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:55:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:55:42,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:55:42,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823896793] [2022-01-31 12:55:42,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823896793] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:55:42,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797199972] [2022-01-31 12:55:42,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 12:55:42,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:55:42,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:55:42,448 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-01-31 12:55:42,466 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-01-31 12:55:42,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 12:55:42,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:55:42,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 12:55:42,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:55:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:55:42,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:55:48,658 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_39_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296))) (.cse1 (forall ((aux_div_v_main_~x~0_39_31 Int)) (not (= (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296)) c_main_~x~0))))) (and (or (not .cse0) (and (forall ((aux_div_v_main_~x~0_39_31 Int) (aux_div_v_main_~z~0_33_31 Int) (aux_mod_v_main_~z~0_33_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296))) (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~z~0_33_31 (* v_it_5 4294967295)) 4294967296))))) (<= (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296)) c_main_~x~0) (<= aux_mod_v_main_~z~0_33_31 0) (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 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_33_31 (* 4294967296 aux_div_v_main_~z~0_33_31))))) (<= 4294967296 aux_mod_v_main_~z~0_33_31) (<= (+ aux_mod_v_main_~z~0_33_31 (* 4294967296 aux_div_v_main_~z~0_33_31)) c_main_~z~0))) (or (forall ((aux_div_v_main_~z~0_33_31 Int) (aux_mod_v_main_~z~0_33_31 Int)) (or (< 0 aux_mod_v_main_~z~0_33_31) (< aux_mod_v_main_~z~0_33_31 0) (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 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_33_31 (* 4294967296 aux_div_v_main_~z~0_33_31))))) (<= (+ aux_mod_v_main_~z~0_33_31 (* 4294967296 aux_div_v_main_~z~0_33_31)) c_main_~z~0))) .cse1))) (or .cse0 (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or .cse2 .cse1) (or (forall ((aux_div_v_main_~x~0_39_31 Int)) (or (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296)))) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))))) (not .cse2))))))) (<= aux_mod_v_main_~x~0_39_31 0) (<= 4294967296 aux_mod_v_main_~x~0_39_31))) is different from false [2022-01-31 12:56:09,644 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_39_31 Int)) (or (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (forall ((aux_div_v_main_~y~0_30_31 Int) (aux_mod_v_main_~y~0_30_31 Int)) (or (and (forall ((aux_div_v_main_~x~0_39_31 Int) (aux_div_v_main_~z~0_33_31 Int) (aux_mod_v_main_~z~0_33_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296))) (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~z~0_33_31 (* v_it_5 4294967295)) 4294967296))))) (<= (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296)) c_main_~x~0) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_30_31 4294967296) aux_mod_v_main_~z~0_33_31 aux_mod_v_main_~y~0_30_31 (* 4294967296 aux_div_v_main_~z~0_33_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_30_31) 4294967296))) (<= 1 v_it_3))) (<= aux_mod_v_main_~z~0_33_31 0) (<= (+ (* aux_div_v_main_~y~0_30_31 4294967296) aux_mod_v_main_~z~0_33_31 aux_mod_v_main_~y~0_30_31 (* 4294967296 aux_div_v_main_~z~0_33_31)) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~z~0_33_31))) (or (forall ((aux_div_v_main_~z~0_33_31 Int) (aux_mod_v_main_~z~0_33_31 Int)) (or (< 0 aux_mod_v_main_~z~0_33_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_30_31 4294967296) aux_mod_v_main_~z~0_33_31 aux_mod_v_main_~y~0_30_31 (* 4294967296 aux_div_v_main_~z~0_33_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_30_31) 4294967296))) (<= 1 v_it_3))) (< aux_mod_v_main_~z~0_33_31 0) (<= (+ (* aux_div_v_main_~y~0_30_31 4294967296) aux_mod_v_main_~z~0_33_31 aux_mod_v_main_~y~0_30_31 (* 4294967296 aux_div_v_main_~z~0_33_31)) (+ c_main_~y~0 c_main_~z~0)))) (forall ((aux_div_v_main_~x~0_39_31 Int)) (not (= (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296)) c_main_~x~0))))) (<= aux_mod_v_main_~y~0_30_31 0) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ (* aux_div_v_main_~y~0_30_31 4294967296) v_it_3 aux_mod_v_main_~y~0_30_31 1) c_main_~y~0) (<= 1 v_it_3))) (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_30_31 4294967296) aux_mod_v_main_~y~0_30_31)) (<= 4294967296 aux_mod_v_main_~y~0_30_31))) (forall ((aux_mod_v_main_~y~0_30_31 Int) (aux_div_v_main_~y~0_30_31 Int)) (or (< aux_mod_v_main_~y~0_30_31 0) (< 0 aux_mod_v_main_~y~0_30_31) (let ((.cse0 (< 0 (mod (+ c_main_~y~0 c_main_~z~0 (* 4294967295 aux_mod_v_main_~y~0_30_31)) 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~x~0_39_31 Int)) (not (= (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296)) c_main_~x~0)))) (or (not .cse0) (forall ((aux_div_v_main_~x~0_39_31 Int)) (or (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296)))) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~y~0 c_main_~z~0 (* 4294967295 aux_mod_v_main_~y~0_30_31)) 4294967296))) (<= 1 v_it_5)))))))) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ (* aux_div_v_main_~y~0_30_31 4294967296) v_it_3 aux_mod_v_main_~y~0_30_31 1) c_main_~y~0) (<= 1 v_it_3))) (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_30_31 4294967296) aux_mod_v_main_~y~0_30_31))))) (not .cse1)) (or .cse1 (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or .cse2 (forall ((aux_div_v_main_~x~0_39_31 Int)) (not (= (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296)) c_main_~x~0)))) (or (forall ((aux_div_v_main_~x~0_39_31 Int)) (or (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296)))) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))))) (not .cse2))))))) (<= aux_mod_v_main_~x~0_39_31 0) (<= 4294967296 aux_mod_v_main_~x~0_39_31))) is different from false [2022-01-31 12:56:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-31 12:56:39,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797199972] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:56:39,846 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:56:39,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2022-01-31 12:56:39,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383830120] [2022-01-31 12:56:39,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:56:39,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 12:56:39,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:56:39,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 12:56:39,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=8, NotChecked=54, Total=272 [2022-01-31 12:56:39,847 INFO L87 Difference]: Start difference. First operand 44 states and 69 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 14 states have internal predecessors, (30), 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-01-31 12:56:54,219 WARN L228 SmtUtils]: Spent 10.16s on a formula simplification that was a NOOP. DAG size: 109 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:56:56,261 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (forall ((aux_mod_v_main_~x~0_39_31 Int)) (or (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (forall ((aux_div_v_main_~y~0_30_31 Int) (aux_mod_v_main_~y~0_30_31 Int)) (or (and (forall ((aux_div_v_main_~x~0_39_31 Int) (aux_div_v_main_~z~0_33_31 Int) (aux_mod_v_main_~z~0_33_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296))) (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~z~0_33_31 (* v_it_5 4294967295)) 4294967296))))) (<= (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296)) c_main_~x~0) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_30_31 4294967296) aux_mod_v_main_~z~0_33_31 aux_mod_v_main_~y~0_30_31 (* 4294967296 aux_div_v_main_~z~0_33_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_30_31) 4294967296))) (<= 1 v_it_3))) (<= aux_mod_v_main_~z~0_33_31 0) (<= (+ (* aux_div_v_main_~y~0_30_31 4294967296) aux_mod_v_main_~z~0_33_31 aux_mod_v_main_~y~0_30_31 (* 4294967296 aux_div_v_main_~z~0_33_31)) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~z~0_33_31))) (or (forall ((aux_div_v_main_~z~0_33_31 Int) (aux_mod_v_main_~z~0_33_31 Int)) (or (< 0 aux_mod_v_main_~z~0_33_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_30_31 4294967296) aux_mod_v_main_~z~0_33_31 aux_mod_v_main_~y~0_30_31 (* 4294967296 aux_div_v_main_~z~0_33_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_30_31) 4294967296))) (<= 1 v_it_3))) (< aux_mod_v_main_~z~0_33_31 0) (<= (+ (* aux_div_v_main_~y~0_30_31 4294967296) aux_mod_v_main_~z~0_33_31 aux_mod_v_main_~y~0_30_31 (* 4294967296 aux_div_v_main_~z~0_33_31)) (+ c_main_~y~0 c_main_~z~0)))) (forall ((aux_div_v_main_~x~0_39_31 Int)) (not (= (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296)) c_main_~x~0))))) (<= aux_mod_v_main_~y~0_30_31 0) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ (* aux_div_v_main_~y~0_30_31 4294967296) v_it_3 aux_mod_v_main_~y~0_30_31 1) c_main_~y~0) (<= 1 v_it_3))) (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_30_31 4294967296) aux_mod_v_main_~y~0_30_31)) (<= 4294967296 aux_mod_v_main_~y~0_30_31))) (forall ((aux_mod_v_main_~y~0_30_31 Int) (aux_div_v_main_~y~0_30_31 Int)) (or (< aux_mod_v_main_~y~0_30_31 0) (< 0 aux_mod_v_main_~y~0_30_31) (let ((.cse0 (< 0 (mod (+ c_main_~y~0 c_main_~z~0 (* 4294967295 aux_mod_v_main_~y~0_30_31)) 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~x~0_39_31 Int)) (not (= (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296)) c_main_~x~0)))) (or (not .cse0) (forall ((aux_div_v_main_~x~0_39_31 Int)) (or (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296)))) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~y~0 c_main_~z~0 (* 4294967295 aux_mod_v_main_~y~0_30_31)) 4294967296))) (<= 1 v_it_5)))))))) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ (* aux_div_v_main_~y~0_30_31 4294967296) v_it_3 aux_mod_v_main_~y~0_30_31 1) c_main_~y~0) (<= 1 v_it_3))) (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_30_31 4294967296) aux_mod_v_main_~y~0_30_31))))) (not .cse1)) (or .cse1 (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or .cse2 (forall ((aux_div_v_main_~x~0_39_31 Int)) (not (= (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296)) c_main_~x~0)))) (or (forall ((aux_div_v_main_~x~0_39_31 Int)) (or (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296)))) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_39_31 (* aux_div_v_main_~x~0_39_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))))) (not .cse2))))))) (<= aux_mod_v_main_~x~0_39_31 0) (<= 4294967296 aux_mod_v_main_~x~0_39_31))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-01-31 12:57:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:57:04,768 INFO L93 Difference]: Finished difference Result 70 states and 110 transitions. [2022-01-31 12:57:04,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 12:57:04,769 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 14 states have internal predecessors, (30), 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-01-31 12:57:04,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:57:04,769 INFO L225 Difference]: With dead ends: 70 [2022-01-31 12:57:04,769 INFO L226 Difference]: Without dead ends: 66 [2022-01-31 12:57:04,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 45.2s TimeCoverageRelationStatistics Valid=123, Invalid=426, Unknown=15, NotChecked=138, Total=702 [2022-01-31 12:57:04,770 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:57:04,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 62 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 69 Invalid, 0 Unknown, 91 Unchecked, 0.0s Time] [2022-01-31 12:57:04,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-31 12:57:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2022-01-31 12:57:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.675) internal successors, (67), 40 states have internal predecessors, (67), 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-01-31 12:57:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 71 transitions. [2022-01-31 12:57:04,772 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 71 transitions. Word has length 20 [2022-01-31 12:57:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:57:04,773 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 71 transitions. [2022-01-31 12:57:04,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 14 states have internal predecessors, (30), 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-01-31 12:57:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 71 transitions. [2022-01-31 12:57:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 12:57:04,773 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:57:04,773 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:57:04,790 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-01-31 12:57:04,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:57:04,983 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:57:04,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:57:04,984 INFO L85 PathProgramCache]: Analyzing trace with hash -369501645, now seen corresponding path program 1 times [2022-01-31 12:57:04,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:57:04,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50851153] [2022-01-31 12:57:04,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:57:04,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:57:04,988 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-01-31 12:57:04,989 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-01-31 12:57:04,989 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-01-31 12:57:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:57:05,000 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-01-31 12:57:05,003 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-01-31 12:57:05,005 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-01-31 12:57:05,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:57:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:57:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:57:05,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:57:05,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50851153] [2022-01-31 12:57:05,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50851153] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:57:05,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266852388] [2022-01-31 12:57:05,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:57:05,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:57:05,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:57:05,115 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-01-31 12:57:05,174 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-01-31 12:57:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:57:05,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 12:57:05,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:57:05,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:57:05,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:57:08,962 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_42_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_42_31) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~x~0_42_31 Int)) (not (= (+ aux_mod_v_main_~x~0_42_31 (* aux_div_v_main_~x~0_42_31 4294967296)) c_main_~x~0)))) (or (not .cse0) (and (forall ((aux_div_v_main_~x~0_42_31 Int) (aux_div_v_main_~y~0_34_31 Int) (aux_mod_v_main_~y~0_34_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_34_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= (+ aux_mod_v_main_~x~0_42_31 v_it_6 (* aux_div_v_main_~x~0_42_31 4294967296) c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_34_31 4294967296) aux_mod_v_main_~y~0_34_31 c_main_~x~0)) (not (< 0 (mod (+ aux_mod_v_main_~y~0_34_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6))) (<= 4294967296 aux_mod_v_main_~y~0_34_31) (<= aux_mod_v_main_~y~0_34_31 0) (<= (+ .cse1 aux_mod_v_main_~y~0_34_31 c_main_~x~0) (+ aux_mod_v_main_~x~0_42_31 (* aux_div_v_main_~x~0_42_31 4294967296) c_main_~y~0)) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ (* aux_div_v_main_~y~0_34_31 4294967296) v_it_6 aux_mod_v_main_~y~0_34_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= c_main_~y~0 (+ .cse1 aux_mod_v_main_~y~0_34_31))))) (or (< 0 (mod (+ aux_mod_v_main_~x~0_42_31 (* 4294967295 c_main_~x~0) c_main_~y~0) 4294967296)) (forall ((aux_div_v_main_~x~0_42_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_42_31 v_it_6 (* aux_div_v_main_~x~0_42_31 4294967296) 1) c_main_~x~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (not (< (+ aux_mod_v_main_~x~0_42_31 (* aux_div_v_main_~x~0_42_31 4294967296)) c_main_~x~0))))))))) (<= aux_mod_v_main_~x~0_42_31 0))) is different from false [2022-01-31 12:57:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-01-31 12:57:10,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266852388] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:57:10,918 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:57:10,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 13 [2022-01-31 12:57:10,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598114002] [2022-01-31 12:57:10,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:57:10,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 12:57:10,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:57:10,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 12:57:10,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2022-01-31 12:57:10,919 INFO L87 Difference]: Start difference. First operand 45 states and 71 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-01-31 12:57:23,637 WARN L228 SmtUtils]: Spent 12.63s on a formula simplification. DAG size of input: 78 DAG size of output: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:57:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:57:23,698 INFO L93 Difference]: Finished difference Result 68 states and 105 transitions. [2022-01-31 12:57:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 12:57:23,699 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-01-31 12:57:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:57:23,699 INFO L225 Difference]: With dead ends: 68 [2022-01-31 12:57:23,699 INFO L226 Difference]: Without dead ends: 58 [2022-01-31 12:57:23,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=80, Invalid=265, Unknown=1, NotChecked=34, Total=380 [2022-01-31 12:57:23,700 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:57:23,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 67 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2022-01-31 12:57:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-31 12:57:23,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2022-01-31 12:57:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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-01-31 12:57:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 81 transitions. [2022-01-31 12:57:23,702 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 81 transitions. Word has length 20 [2022-01-31 12:57:23,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:57:23,702 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 81 transitions. [2022-01-31 12:57:23,702 INFO L471 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-01-31 12:57:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 81 transitions. [2022-01-31 12:57:23,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 12:57:23,703 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:57:23,703 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:57:23,721 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-01-31 12:57:23,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-31 12:57:23,923 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:57:23,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:57:23,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2118261262, now seen corresponding path program 1 times [2022-01-31 12:57:23,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:57:23,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301112221] [2022-01-31 12:57:23,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:57:23,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:57:23,927 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-01-31 12:57:23,928 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-01-31 12:57:23,929 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-01-31 12:57:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:57:23,939 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-01-31 12:57:23,941 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-01-31 12:57:23,944 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-01-31 12:57:24,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:57:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:57:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:57:24,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:57:24,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301112221] [2022-01-31 12:57:24,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301112221] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:57:24,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914787329] [2022-01-31 12:57:24,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:57:24,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:57:24,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:57:24,076 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-01-31 12:57:24,077 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-01-31 12:57:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:57:24,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 12:57:24,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:57:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:57:24,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:57:46,267 WARN L860 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_46_31 Int) (aux_mod_v_main_~y~0_39_31 Int)) (or (< 0 aux_mod_v_main_~y~0_39_31) (<= aux_mod_v_main_~x~0_46_31 0) (let ((.cse0 (not (= (mod (+ aux_mod_v_main_~x~0_46_31 (* 4294967295 c_main_~x~0)) 4294967296) 0))) (.cse2 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or .cse0 .cse1) (or (not .cse1) (forall ((aux_div_v_main_~x~0_46_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_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_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))))))))) .cse2 (forall ((aux_div_v_main_~y~0_39_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_39_31 4294967296) aux_mod_v_main_~y~0_39_31) c_main_~y~0)))) (or (let ((.cse3 (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_39_31) c_main_~y~0 c_main_~z~0) 4294967296)))) (and (or (not .cse3) (forall ((aux_div_v_main_~x~0_46_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_39_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_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))) (<= 1 v_it_5))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))))))) (or .cse3 .cse0))) (not .cse2) (forall ((aux_div_v_main_~y~0_39_31 Int)) (or (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_39_31 4294967296) v_it_3 aux_mod_v_main_~y~0_39_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (not (< (+ (* aux_div_v_main_~y~0_39_31 4294967296) aux_mod_v_main_~y~0_39_31) c_main_~y~0))))))) (< aux_mod_v_main_~y~0_39_31 0) (<= 4294967296 aux_mod_v_main_~x~0_46_31))) is different from true [2022-01-31 12:58:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-31 12:58:03,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914787329] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:58:03,383 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:58:03,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 11] total 20 [2022-01-31 12:58:03,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144651780] [2022-01-31 12:58:03,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:58:03,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 12:58:03,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:58:03,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 12:58:03,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=262, Unknown=12, NotChecked=34, Total=380 [2022-01-31 12:58:03,384 INFO L87 Difference]: Start difference. First operand 51 states and 81 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-01-31 12:58:17,828 WARN L228 SmtUtils]: Spent 8.13s 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-01-31 12:58:38,385 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (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) (<= 4294967296 aux_mod_v_main_~x~0_46_31) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (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))))) .cse0) (or (not .cse0) (forall ((aux_div_v_main_~x~0_46_31 Int)) (or (not (< (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296)) v_main_~x~0_47)) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_46_31 v_it_6 (* aux_div_v_main_~x~0_46_31 4294967296) 1) v_main_~x~0_47) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))))) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not (= v_main_~x~0_47 c_main_~x~0)) .cse1) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_47) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not .cse1) (not (< c_main_~x~0 v_main_~x~0_47))))))) (or (< 0 (mod c_main_~y~0 4294967296)) (forall ((aux_mod_v_main_~x~0_46_31 Int)) (or (<= aux_mod_v_main_~x~0_46_31 0) (<= 4294967296 aux_mod_v_main_~x~0_46_31) (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or .cse2 (forall ((aux_div_v_main_~x~0_46_31 Int)) (not (= (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296)) c_main_~x~0)))) (or (not .cse2) (forall ((aux_div_v_main_~x~0_46_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_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_46_31 (* aux_div_v_main_~x~0_46_31 4294967296)))))))))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-01-31 12:59:01,547 WARN L228 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:59:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:59:27,887 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-01-31 12:59:27,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 12:59:27,888 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-01-31 12:59:27,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:59:27,889 INFO L225 Difference]: With dead ends: 66 [2022-01-31 12:59:27,889 INFO L226 Difference]: Without dead ends: 63 [2022-01-31 12:59:27,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 117.1s TimeCoverageRelationStatistics Valid=156, Invalid=680, Unknown=42, NotChecked=114, Total=992 [2022-01-31 12:59:27,890 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:59:27,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 72 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 58 Invalid, 0 Unknown, 107 Unchecked, 0.0s Time] [2022-01-31 12:59:27,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-31 12:59:27,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2022-01-31 12:59:27,892 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-01-31 12:59:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-01-31 12:59:27,892 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 20 [2022-01-31 12:59:27,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:59:27,892 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-01-31 12:59:27,892 INFO L471 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-01-31 12:59:27,893 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-01-31 12:59:27,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 12:59:27,893 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:59:27,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:59:27,933 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-01-31 12:59:28,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-31 12:59:28,108 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:59:28,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:59:28,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1929500051, now seen corresponding path program 1 times [2022-01-31 12:59:28,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:59:28,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742339909] [2022-01-31 12:59:28,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:59:28,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:59:28,112 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-01-31 12:59:28,118 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-01-31 12:59:28,119 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-01-31 12:59:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:59:28,129 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-01-31 12:59:28,153 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-01-31 12:59:28,157 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-01-31 12:59:28,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:59:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:59:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 12:59:28,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:59:28,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742339909] [2022-01-31 12:59:28,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742339909] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:59:28,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:59:28,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 12:59:28,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669292317] [2022-01-31 12:59:28,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:59:28,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 12:59:28,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:59:28,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 12:59:28,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-31 12:59:28,273 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-01-31 12:59:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:59:28,393 INFO L93 Difference]: Finished difference Result 62 states and 96 transitions. [2022-01-31 12:59:28,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 12:59:28,394 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-01-31 12:59:28,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:59:28,394 INFO L225 Difference]: With dead ends: 62 [2022-01-31 12:59:28,394 INFO L226 Difference]: Without dead ends: 57 [2022-01-31 12:59:28,395 INFO L932 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-01-31 12:59:28,395 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:59:28,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 51 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 65 Invalid, 0 Unknown, 11 Unchecked, 0.1s Time] [2022-01-31 12:59:28,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-01-31 12:59:28,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-01-31 12:59:28,397 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-01-31 12:59:28,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 82 transitions. [2022-01-31 12:59:28,397 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 82 transitions. Word has length 20 [2022-01-31 12:59:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:59:28,397 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 82 transitions. [2022-01-31 12:59:28,397 INFO L471 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-01-31 12:59:28,398 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 82 transitions. [2022-01-31 12:59:28,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 12:59:28,398 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:59:28,398 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:59:28,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 12:59:28,398 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:59:28,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:59:28,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1592480168, now seen corresponding path program 1 times [2022-01-31 12:59:28,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:59:28,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688016506] [2022-01-31 12:59:28,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:59:28,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:59:28,402 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-01-31 12:59:28,402 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-01-31 12:59:28,403 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-01-31 12:59:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:59:28,413 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-01-31 12:59:28,415 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-01-31 12:59:28,416 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-01-31 12:59:28,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:59:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:59:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:59:28,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:59:28,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688016506] [2022-01-31 12:59:28,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688016506] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:59:28,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732448401] [2022-01-31 12:59:28,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:59:28,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:59:28,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:59:28,524 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-01-31 12:59:28,534 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-01-31 12:59:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:59:28,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 12:59:28,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:59:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:59:28,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:59:56,374 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0_51 Int) (aux_mod_v_main_~x~0_50_31 Int)) (or (<= aux_mod_v_main_~x~0_50_31 0) (<= 4294967296 aux_mod_v_main_~x~0_50_31) (and (forall ((aux_div_v_main_~x~0_50_31 Int) (aux_mod_v_main_~z~0_46_31 Int)) (or (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~z~0_46_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_main_~x~0_51 v_it_5 1) (+ aux_mod_v_main_~x~0_50_31 (* aux_div_v_main_~x~0_50_31 4294967296))))) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (forall ((aux_div_v_main_~z~0_46_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_46_31 (* 4294967296 aux_div_v_main_~z~0_46_31)))) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_46_31 (* 4294967296 aux_div_v_main_~z~0_46_31))) (<= 1 v_it_3))))) (not .cse0)) (or .cse0 (forall ((aux_div_v_main_~z~0_46_31 Int)) (not (= (+ aux_mod_v_main_~z~0_46_31 (* 4294967296 aux_div_v_main_~z~0_46_31)) c_main_~z~0)))))) (<= aux_mod_v_main_~z~0_46_31 0) (<= 4294967296 aux_mod_v_main_~z~0_46_31) (<= (+ aux_mod_v_main_~x~0_50_31 (* aux_div_v_main_~x~0_50_31 4294967296)) v_main_~x~0_51))) (or (forall ((aux_mod_v_main_~z~0_46_31 Int)) (or (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (forall ((aux_div_v_main_~z~0_46_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_46_31 (* 4294967296 aux_div_v_main_~z~0_46_31)))) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_46_31 (* 4294967296 aux_div_v_main_~z~0_46_31))) (<= 1 v_it_3))))) (not .cse1)) (or .cse1 (forall ((aux_div_v_main_~z~0_46_31 Int)) (not (= (+ aux_mod_v_main_~z~0_46_31 (* 4294967296 aux_div_v_main_~z~0_46_31)) c_main_~z~0)))))) (< 0 aux_mod_v_main_~z~0_46_31) (< aux_mod_v_main_~z~0_46_31 0))) (forall ((aux_div_v_main_~x~0_50_31 Int)) (not (= v_main_~x~0_51 (+ aux_mod_v_main_~x~0_50_31 (* aux_div_v_main_~x~0_50_31 4294967296))))))) (let ((.cse2 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse2) (exists ((v_it_4 Int)) (and (<= (+ v_main_~x~0_51 v_it_4 1) c_main_~x~0) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< v_main_~x~0_51 c_main_~x~0))) (or (not (= v_main_~x~0_51 c_main_~x~0)) .cse2))))) is different from false [2022-01-31 13:00:02,488 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_main_~x~0_51 Int) (aux_mod_v_main_~x~0_50_31 Int)) (or (<= aux_mod_v_main_~x~0_50_31 0) (<= 4294967296 aux_mod_v_main_~x~0_50_31) (and (forall ((aux_div_v_main_~x~0_50_31 Int) (aux_mod_v_main_~z~0_46_31 Int)) (or (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~z~0_46_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_main_~x~0_51 v_it_5 1) (+ aux_mod_v_main_~x~0_50_31 (* aux_div_v_main_~x~0_50_31 4294967296))))) (forall ((aux_div_v_main_~z~0_46_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_46_31 (* 4294967296 aux_div_v_main_~z~0_46_31)))) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_46_31 (* 4294967296 aux_div_v_main_~z~0_46_31))) (<= 1 v_it_3))))) (<= aux_mod_v_main_~z~0_46_31 0) (not (< 0 (mod c_main_~y~0 4294967296))) (<= 4294967296 aux_mod_v_main_~z~0_46_31) (<= (+ aux_mod_v_main_~x~0_50_31 (* aux_div_v_main_~x~0_50_31 4294967296)) v_main_~x~0_51))) (or (forall ((aux_mod_v_main_~z~0_46_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (forall ((aux_div_v_main_~z~0_46_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_46_31 (* 4294967296 aux_div_v_main_~z~0_46_31)))) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_46_31 (* 4294967296 aux_div_v_main_~z~0_46_31))) (<= 1 v_it_3))))) (not .cse0)) (or .cse0 (forall ((aux_div_v_main_~z~0_46_31 Int)) (not (= (+ aux_mod_v_main_~z~0_46_31 (* 4294967296 aux_div_v_main_~z~0_46_31)) c_main_~z~0)))))) (< 0 aux_mod_v_main_~z~0_46_31) (< aux_mod_v_main_~z~0_46_31 0))) (forall ((aux_div_v_main_~x~0_50_31 Int)) (not (= v_main_~x~0_51 (+ aux_mod_v_main_~x~0_50_31 (* aux_div_v_main_~x~0_50_31 4294967296))))))) (let ((.cse1 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse1) (exists ((v_it_4 Int)) (and (<= (+ v_main_~x~0_51 v_it_4 1) c_main_~x~0) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< v_main_~x~0_51 c_main_~x~0))) (or (not (= v_main_~x~0_51 c_main_~x~0)) .cse1))))) (< 0 (mod c_main_~z~0 4294967296))) is different from true [2022-01-31 13:00:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-31 13:00:06,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732448401] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 13:00:06,855 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 13:00:06,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2022-01-31 13:00:06,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061964782] [2022-01-31 13:00:06,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 13:00:06,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 13:00:06,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:00:06,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 13:00:06,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=164, Unknown=6, NotChecked=54, Total=272 [2022-01-31 13:00:06,856 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-01-31 13:00:25,730 WARN L228 SmtUtils]: Spent 10.25s 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-01-31 13:00:27,738 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~x~0_51 Int) (aux_mod_v_main_~x~0_50_31 Int)) (or (<= aux_mod_v_main_~x~0_50_31 0) (<= 4294967296 aux_mod_v_main_~x~0_50_31) (and (forall ((aux_div_v_main_~x~0_50_31 Int) (aux_mod_v_main_~z~0_46_31 Int)) (or (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~z~0_46_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_main_~x~0_51 v_it_5 1) (+ aux_mod_v_main_~x~0_50_31 (* aux_div_v_main_~x~0_50_31 4294967296))))) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (forall ((aux_div_v_main_~z~0_46_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_46_31 (* 4294967296 aux_div_v_main_~z~0_46_31)))) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_46_31 (* 4294967296 aux_div_v_main_~z~0_46_31))) (<= 1 v_it_3))))) (not .cse0)) (or .cse0 (forall ((aux_div_v_main_~z~0_46_31 Int)) (not (= (+ aux_mod_v_main_~z~0_46_31 (* 4294967296 aux_div_v_main_~z~0_46_31)) c_main_~z~0)))))) (<= aux_mod_v_main_~z~0_46_31 0) (<= 4294967296 aux_mod_v_main_~z~0_46_31) (<= (+ aux_mod_v_main_~x~0_50_31 (* aux_div_v_main_~x~0_50_31 4294967296)) v_main_~x~0_51))) (or (forall ((aux_mod_v_main_~z~0_46_31 Int)) (or (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (forall ((aux_div_v_main_~z~0_46_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_46_31 (* 4294967296 aux_div_v_main_~z~0_46_31)))) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_46_31 (* 4294967296 aux_div_v_main_~z~0_46_31))) (<= 1 v_it_3))))) (not .cse1)) (or .cse1 (forall ((aux_div_v_main_~z~0_46_31 Int)) (not (= (+ aux_mod_v_main_~z~0_46_31 (* 4294967296 aux_div_v_main_~z~0_46_31)) c_main_~z~0)))))) (< 0 aux_mod_v_main_~z~0_46_31) (< aux_mod_v_main_~z~0_46_31 0))) (forall ((aux_div_v_main_~x~0_50_31 Int)) (not (= v_main_~x~0_51 (+ aux_mod_v_main_~x~0_50_31 (* aux_div_v_main_~x~0_50_31 4294967296))))))) (let ((.cse2 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse2) (exists ((v_it_4 Int)) (and (<= (+ v_main_~x~0_51 v_it_4 1) c_main_~x~0) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< v_main_~x~0_51 c_main_~x~0))) (or (not (= v_main_~x~0_51 c_main_~x~0)) .cse2))))) (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-01-31 13:00:56,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:00:56,915 INFO L93 Difference]: Finished difference Result 68 states and 107 transitions. [2022-01-31 13:00:56,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 13:00:56,916 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-01-31 13:00:56,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:00:56,916 INFO L225 Difference]: With dead ends: 68 [2022-01-31 13:00:56,916 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 13:00:56,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 68.7s TimeCoverageRelationStatistics Valid=136, Invalid=503, Unknown=23, NotChecked=150, Total=812 [2022-01-31 13:00:56,917 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 13:00:56,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 64 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 53 Invalid, 0 Unknown, 82 Unchecked, 0.0s Time] [2022-01-31 13:00:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 13:00:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2022-01-31 13:00:56,919 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-01-31 13:00:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 78 transitions. [2022-01-31 13:00:56,919 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 78 transitions. Word has length 20 [2022-01-31 13:00:56,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:00:56,919 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 78 transitions. [2022-01-31 13:00:56,919 INFO L471 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-01-31 13:00:56,919 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 78 transitions. [2022-01-31 13:00:56,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 13:00:56,920 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:00:56,920 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:00:56,942 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-01-31 13:00:57,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-31 13:00:57,125 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:00:57,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:00:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2096941357, now seen corresponding path program 2 times [2022-01-31 13:00:57,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:00:57,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410019668] [2022-01-31 13:00:57,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:00:57,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:00:57,129 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-01-31 13:00:57,130 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-01-31 13:00:57,131 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-01-31 13:00:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:00:57,140 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-01-31 13:00:57,142 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-01-31 13:00:57,143 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-01-31 13:00:57,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 13:00:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:00:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 13:00:57,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:00:57,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410019668] [2022-01-31 13:00:57,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410019668] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 13:00:57,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32236058] [2022-01-31 13:00:57,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 13:00:57,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:00:57,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:00:57,260 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-01-31 13:00:57,261 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-01-31 13:00:57,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 13:00:57,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 13:00:57,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 13:00:57,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:00:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 13:00:57,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 13:01:48,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_55_31 Int) (v_main_~x~0_57 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_55_31) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not (= v_main_~x~0_57 c_main_~x~0)) .cse0) (or (not (< c_main_~x~0 v_main_~x~0_57)) (not .cse0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_57) (<= 1 v_it_5)))))) (<= aux_mod_v_main_~x~0_55_31 0) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse1) (and (forall ((aux_mod_v_main_~y~0_47_31 Int) (aux_div_v_main_~y~0_47_31 Int) (aux_div_v_main_~x~0_55_31 Int)) (let ((.cse2 (* aux_div_v_main_~y~0_47_31 4294967296))) (or (<= c_main_~y~0 (+ .cse2 aux_mod_v_main_~y~0_47_31)) (<= 4294967296 aux_mod_v_main_~y~0_47_31) (<= aux_mod_v_main_~y~0_47_31 0) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 1) c_main_~y~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ v_main_~x~0_57 .cse2 aux_mod_v_main_~y~0_47_31) (+ aux_mod_v_main_~x~0_55_31 c_main_~y~0 (* aux_div_v_main_~x~0_55_31 4294967296))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_55_31 v_it_6 c_main_~y~0 (* aux_div_v_main_~x~0_55_31 4294967296) 1) (+ v_main_~x~0_57 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)) (not (< 0 (mod (+ aux_mod_v_main_~y~0_47_31 (* v_it_6 4294967295)) 4294967296)))))))) (or (forall ((aux_div_v_main_~x~0_55_31 Int)) (or (not (< (+ aux_mod_v_main_~x~0_55_31 (* aux_div_v_main_~x~0_55_31 4294967296)) v_main_~x~0_57)) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_55_31 v_it_6 (* aux_div_v_main_~x~0_55_31 4294967296) 1) v_main_~x~0_57) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))))) (< 0 (mod (+ aux_mod_v_main_~x~0_55_31 (* v_main_~x~0_57 4294967295) c_main_~y~0) 4294967296))))) (or .cse1 (forall ((aux_div_v_main_~x~0_55_31 Int)) (not (= v_main_~x~0_57 (+ aux_mod_v_main_~x~0_55_31 (* aux_div_v_main_~x~0_55_31 4294967296)))))))))) is different from false [2022-01-31 13:01:50,273 WARN L860 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_55_31 Int) (v_main_~x~0_57 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_55_31) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not (= v_main_~x~0_57 c_main_~x~0)) .cse0) (or (not (< c_main_~x~0 v_main_~x~0_57)) (not .cse0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_57) (<= 1 v_it_5)))))) (<= aux_mod_v_main_~x~0_55_31 0) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse1) (and (forall ((aux_mod_v_main_~y~0_47_31 Int) (aux_div_v_main_~y~0_47_31 Int) (aux_div_v_main_~x~0_55_31 Int)) (let ((.cse2 (* aux_div_v_main_~y~0_47_31 4294967296))) (or (<= c_main_~y~0 (+ .cse2 aux_mod_v_main_~y~0_47_31)) (<= 4294967296 aux_mod_v_main_~y~0_47_31) (<= aux_mod_v_main_~y~0_47_31 0) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 1) c_main_~y~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ v_main_~x~0_57 .cse2 aux_mod_v_main_~y~0_47_31) (+ aux_mod_v_main_~x~0_55_31 c_main_~y~0 (* aux_div_v_main_~x~0_55_31 4294967296))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_55_31 v_it_6 c_main_~y~0 (* aux_div_v_main_~x~0_55_31 4294967296) 1) (+ v_main_~x~0_57 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)) (not (< 0 (mod (+ aux_mod_v_main_~y~0_47_31 (* v_it_6 4294967295)) 4294967296)))))))) (or (forall ((aux_div_v_main_~x~0_55_31 Int)) (or (not (< (+ aux_mod_v_main_~x~0_55_31 (* aux_div_v_main_~x~0_55_31 4294967296)) v_main_~x~0_57)) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_55_31 v_it_6 (* aux_div_v_main_~x~0_55_31 4294967296) 1) v_main_~x~0_57) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))))) (< 0 (mod (+ aux_mod_v_main_~x~0_55_31 (* v_main_~x~0_57 4294967295) c_main_~y~0) 4294967296))))) (or .cse1 (forall ((aux_div_v_main_~x~0_55_31 Int)) (not (= v_main_~x~0_57 (+ aux_mod_v_main_~x~0_55_31 (* aux_div_v_main_~x~0_55_31 4294967296)))))))))) is different from true [2022-01-31 13:02:16,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-31 13:02:16,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32236058] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 13:02:16,404 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 13:02:16,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2022-01-31 13:02:16,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523123573] [2022-01-31 13:02:16,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 13:02:16,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 13:02:16,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:02:16,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 13:02:16,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=202, Unknown=14, NotChecked=30, Total=306 [2022-01-31 13:02:16,406 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-01-31 13:02:31,239 WARN L228 SmtUtils]: Spent 10.39s on a formula simplification. DAG size of input: 101 DAG size of output: 98 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 13:02:31,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:02:31,554 INFO L93 Difference]: Finished difference Result 71 states and 108 transitions. [2022-01-31 13:02:31,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 13:02:31,554 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-01-31 13:02:31,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:02:31,555 INFO L225 Difference]: With dead ends: 71 [2022-01-31 13:02:31,555 INFO L226 Difference]: Without dead ends: 61 [2022-01-31 13:02:31,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 49.2s TimeCoverageRelationStatistics Valid=156, Invalid=534, Unknown=16, NotChecked=50, Total=756 [2022-01-31 13:02:31,555 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 13:02:31,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 81 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 103 Invalid, 0 Unknown, 78 Unchecked, 0.2s Time] [2022-01-31 13:02:31,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-31 13:02:31,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-01-31 13:02:31,557 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-01-31 13:02:31,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 84 transitions. [2022-01-31 13:02:31,558 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 84 transitions. Word has length 20 [2022-01-31 13:02:31,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:02:31,558 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 84 transitions. [2022-01-31 13:02:31,558 INFO L471 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-01-31 13:02:31,558 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 84 transitions. [2022-01-31 13:02:31,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 13:02:31,558 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:02:31,558 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:02:31,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-31 13:02:31,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-31 13:02:31,759 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:02:31,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:02:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1165808695, now seen corresponding path program 1 times [2022-01-31 13:02:31,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:02:31,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353873141] [2022-01-31 13:02:31,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:02:31,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:02:31,763 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-01-31 13:02:31,764 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-01-31 13:02:31,764 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-01-31 13:02:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:02:31,781 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-01-31 13:02:31,788 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-01-31 13:02:31,795 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-01-31 13:02:32,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 13:02:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:02:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 13:02:32,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:02:32,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353873141] [2022-01-31 13:02:32,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353873141] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 13:02:32,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342836798] [2022-01-31 13:02:32,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:02:32,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:02:32,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:02:32,056 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 13:02:32,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-31 13:02:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:02:32,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 13:02:32,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:02:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 13:02:32,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 13:03:25,760 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_61_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_61_31) (let ((.cse2 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (forall ((v_main_~x~0_62 Int)) (or (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse0) (not (< c_main_~x~0 v_main_~x~0_62)) (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) v_main_~x~0_62)))) (or (not (= v_main_~x~0_62 c_main_~x~0)) .cse0))) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse1) (forall ((aux_div_v_main_~x~0_61_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_61_31 v_it_6 (* aux_div_v_main_~x~0_61_31 4294967296) 1) v_main_~x~0_62) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (not (< (+ aux_mod_v_main_~x~0_61_31 (* aux_div_v_main_~x~0_61_31 4294967296)) v_main_~x~0_62))))) (or .cse1 (forall ((aux_div_v_main_~x~0_61_31 Int)) (not (= v_main_~x~0_62 (+ aux_mod_v_main_~x~0_61_31 (* aux_div_v_main_~x~0_61_31 4294967296)))))))))) .cse2) (or (not .cse2) (let ((.cse3 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse3) (and (forall ((v_main_~x~0_62 Int) (aux_div_v_main_~x~0_61_31 Int) (aux_mod_v_main_~y~0_51_31 Int) (aux_div_v_main_~y~0_51_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_51_31 4294967296))) (or (<= aux_mod_v_main_~y~0_51_31 0) (<= 4294967296 aux_mod_v_main_~y~0_51_31) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ v_it_4 c_main_~y~0 1) (+ aux_mod_v_main_~y~0_51_31 (* aux_div_v_main_~y~0_51_31 4294967296))))) (<= v_main_~x~0_62 (+ aux_mod_v_main_~x~0_61_31 (* aux_div_v_main_~x~0_61_31 4294967296))) (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_51_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_61_31 v_it_6 (* aux_div_v_main_~x~0_61_31 4294967296) 1) v_main_~x~0_62))) (<= (+ v_main_~x~0_62 aux_mod_v_main_~y~0_51_31 .cse4) (+ c_main_~x~0 c_main_~y~0)) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 c_main_~y~0 1) (+ v_main_~x~0_62 aux_mod_v_main_~y~0_51_31 (* aux_div_v_main_~y~0_51_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (<= (+ aux_mod_v_main_~y~0_51_31 .cse4) c_main_~y~0)))) (forall ((aux_div_v_main_~x~0_61_31 Int) (aux_mod_v_main_~y~0_51_31 Int) (aux_div_v_main_~y~0_51_31 Int)) (let ((.cse5 (* aux_div_v_main_~y~0_51_31 4294967296))) (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_61_31 aux_mod_v_main_~y~0_51_31 (* aux_div_v_main_~y~0_51_31 4294967296) (* aux_div_v_main_~x~0_61_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (< aux_mod_v_main_~y~0_51_31 0) (< 0 aux_mod_v_main_~y~0_51_31) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ v_it_4 c_main_~y~0 1) (+ aux_mod_v_main_~y~0_51_31 (* aux_div_v_main_~y~0_51_31 4294967296))))) (<= (+ aux_mod_v_main_~x~0_61_31 aux_mod_v_main_~y~0_51_31 .cse5 (* aux_div_v_main_~x~0_61_31 4294967296)) (+ c_main_~x~0 c_main_~y~0)) (<= (+ aux_mod_v_main_~y~0_51_31 .cse5) c_main_~y~0)))))) (or (forall ((v_main_~x~0_62 Int)) (or (exists ((v_it_4 Int)) (and (<= (+ v_main_~x~0_62 v_it_4 1) c_main_~x~0) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< v_main_~x~0_62 c_main_~x~0)) (let ((.cse6 (< 0 (mod (+ (* v_main_~x~0_62 4294967295) c_main_~x~0 c_main_~y~0) 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_61_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_61_31 v_it_6 (* aux_div_v_main_~x~0_61_31 4294967296) 1) v_main_~x~0_62) (not (< 0 (mod (+ (* v_main_~x~0_62 4294967295) (* v_it_6 4294967295) c_main_~x~0 c_main_~y~0) 4294967296))))) (not (< (+ aux_mod_v_main_~x~0_61_31 (* aux_div_v_main_~x~0_61_31 4294967296)) v_main_~x~0_62)))) (not .cse6)) (or (forall ((aux_div_v_main_~x~0_61_31 Int)) (not (= v_main_~x~0_62 (+ aux_mod_v_main_~x~0_61_31 (* aux_div_v_main_~x~0_61_31 4294967296))))) .cse6))))) .cse3)))))) (<= aux_mod_v_main_~x~0_61_31 0))) is different from false [2022-01-31 13:04:09,377 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_61_31 Int) (aux_mod_main_~y~0_26 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_61_31) (< aux_mod_main_~y~0_26 0) (<= aux_mod_v_main_~x~0_61_31 0) (< 0 aux_mod_main_~y~0_26) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (let ((.cse6 (not .cse1)) (.cse7 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (and (or (forall ((v_main_~x~0_62 Int)) (or (let ((.cse0 (< 0 (mod (+ aux_mod_main_~y~0_26 (* v_main_~x~0_62 4294967295) c_main_~x~0) 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_61_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_61_31 v_it_6 (* aux_div_v_main_~x~0_61_31 4294967296) 1) v_main_~x~0_62) (not (< 0 (mod (+ aux_mod_main_~y~0_26 (* v_main_~x~0_62 4294967295) (* v_it_6 4294967295) c_main_~x~0) 4294967296))))) (not (< (+ aux_mod_v_main_~x~0_61_31 (* aux_div_v_main_~x~0_61_31 4294967296)) v_main_~x~0_62)))) (not .cse0)) (or .cse0 (forall ((aux_div_v_main_~x~0_61_31 Int)) (not (= v_main_~x~0_62 (+ aux_mod_v_main_~x~0_61_31 (* aux_div_v_main_~x~0_61_31 4294967296)))))))) (exists ((v_it_4 Int)) (and (<= (+ v_main_~x~0_62 v_it_4 1) c_main_~x~0) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< v_main_~x~0_62 c_main_~x~0)))) .cse1) (or (and (forall ((aux_div_main_~y~0_26 Int) (v_main_~x~0_62 Int) (aux_div_v_main_~x~0_61_31 Int) (aux_mod_v_main_~y~0_51_31 Int) (aux_div_v_main_~y~0_51_31 Int)) (let ((.cse2 (* aux_div_v_main_~y~0_51_31 4294967296)) (.cse3 (* 4294967296 aux_div_main_~y~0_26))) (or (<= aux_mod_v_main_~y~0_51_31 0) (<= 4294967296 aux_mod_v_main_~y~0_51_31) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ aux_mod_main_~y~0_26 v_it_5 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0 1) (+ v_main_~x~0_62 aux_mod_v_main_~y~0_51_31 (* aux_div_v_main_~y~0_51_31 4294967296))) (<= 1 v_it_5))) (<= v_main_~x~0_62 (+ aux_mod_v_main_~x~0_61_31 (* aux_div_v_main_~x~0_61_31 4294967296))) (<= (+ v_main_~x~0_62 aux_mod_v_main_~y~0_51_31 .cse2) (+ aux_mod_main_~y~0_26 .cse3 c_main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) (+ aux_mod_v_main_~y~0_51_31 (* aux_div_v_main_~y~0_51_31 4294967296))) (<= 1 v_it_4))) (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_51_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_61_31 v_it_6 (* aux_div_v_main_~x~0_61_31 4294967296) 1) v_main_~x~0_62))) (<= (+ aux_mod_v_main_~y~0_51_31 .cse2) (+ aux_mod_main_~y~0_26 .cse3))))) (forall ((aux_div_main_~y~0_26 Int) (aux_div_v_main_~x~0_61_31 Int) (aux_mod_v_main_~y~0_51_31 Int) (aux_div_v_main_~y~0_51_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_51_31 4294967296)) (.cse5 (* 4294967296 aux_div_main_~y~0_26))) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ aux_mod_main_~y~0_26 v_it_5 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0 1) (+ aux_mod_v_main_~x~0_61_31 aux_mod_v_main_~y~0_51_31 (* aux_div_v_main_~y~0_51_31 4294967296) (* aux_div_v_main_~x~0_61_31 4294967296))) (<= 1 v_it_5))) (< aux_mod_v_main_~y~0_51_31 0) (< 0 aux_mod_v_main_~y~0_51_31) (<= (+ aux_mod_v_main_~x~0_61_31 aux_mod_v_main_~y~0_51_31 .cse4 (* aux_div_v_main_~x~0_61_31 4294967296)) (+ aux_mod_main_~y~0_26 .cse5 c_main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) (+ aux_mod_v_main_~y~0_51_31 (* aux_div_v_main_~y~0_51_31 4294967296))) (<= 1 v_it_4))) (<= (+ aux_mod_v_main_~y~0_51_31 .cse4) (+ aux_mod_main_~y~0_26 .cse5)))))) .cse6)) (not .cse7)) (or (forall ((aux_div_v_main_~x~0_61_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_61_31 (* aux_div_v_main_~x~0_61_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_61_31 (* aux_div_v_main_~x~0_61_31 4294967296)))))) .cse6 .cse7)))))) is different from false [2022-01-31 13:04:14,332 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((aux_mod_v_main_~x~0_61_31 Int) (v_main_~x~0_62 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_61_31) (exists ((v_it_4 Int)) (and (<= (+ v_main_~x~0_62 v_it_4 1) c_main_~x~0) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))) (<= aux_mod_v_main_~x~0_61_31 0) (and (let ((.cse0 (* v_main_~x~0_62 4294967295))) (or (not (= (mod (+ aux_mod_v_main_~x~0_61_31 .cse0) 4294967296) 0)) (< (div (+ (* (- 1) c_main_~x~0) (- 1) (* v_main_~x~0_62 (- 4294967295))) (- 4294967296)) (+ 2 (div (+ (- 1) .cse0 c_main_~x~0) 4294967296))))) (forall ((aux_mod_aux_mod_main_~y~0_26_81 Int) (aux_div_v_main_~x~0_61_31 Int) (aux_div_aux_mod_main_~y~0_26_81 Int)) (let ((.cse2 (+ (* v_main_~x~0_62 4294967295) c_main_~x~0)) (.cse1 (+ (* aux_div_aux_mod_main_~y~0_26_81 4294967296) aux_mod_aux_mod_main_~y~0_26_81))) (or (< .cse1 .cse2) (<= v_main_~x~0_62 (+ aux_mod_v_main_~x~0_61_31 (* aux_div_v_main_~x~0_61_31 4294967296))) (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_aux_mod_main_~y~0_26_81 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_61_31 v_it_6 (* aux_div_v_main_~x~0_61_31 4294967296) 1) v_main_~x~0_62))) (<= 4294967296 aux_mod_aux_mod_main_~y~0_26_81) (< .cse2 .cse1) (<= aux_mod_aux_mod_main_~y~0_26_81 0))))) (not (< v_main_~x~0_62 c_main_~x~0)))) (<= (mod c_main_~x~0 4294967296) 0)) is different from true [2022-01-31 13:04:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-31 13:04:16,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342836798] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 13:04:16,361 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 13:04:16,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 19 [2022-01-31 13:04:16,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255662729] [2022-01-31 13:04:16,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 13:04:16,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 13:04:16,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:04:16,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 13:04:16,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=179, Unknown=16, NotChecked=90, Total=342 [2022-01-31 13:04:16,362 INFO L87 Difference]: Start difference. First operand 53 states and 84 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 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-01-31 13:04:32,819 WARN L228 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 136 DAG size of output: 136 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 13:04:39,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:04:39,118 INFO L93 Difference]: Finished difference Result 74 states and 113 transitions. [2022-01-31 13:04:39,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 13:04:39,118 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 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-01-31 13:04:39,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:04:39,119 INFO L225 Difference]: With dead ends: 74 [2022-01-31 13:04:39,119 INFO L226 Difference]: Without dead ends: 68 [2022-01-31 13:04:39,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 62.2s TimeCoverageRelationStatistics Valid=132, Invalid=462, Unknown=18, NotChecked=144, Total=756 [2022-01-31 13:04:39,119 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 13:04:39,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 73 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 96 Invalid, 0 Unknown, 95 Unchecked, 0.1s Time] [2022-01-31 13:04:39,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-31 13:04:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2022-01-31 13:04:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.68) internal successors, (84), 50 states have internal predecessors, (84), 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-01-31 13:04:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 88 transitions. [2022-01-31 13:04:39,121 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 88 transitions. Word has length 20 [2022-01-31 13:04:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:04:39,121 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 88 transitions. [2022-01-31 13:04:39,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 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-01-31 13:04:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 88 transitions. [2022-01-31 13:04:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 13:04:39,122 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:04:39,122 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:04:39,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-31 13:04:39,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:04:39,323 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:04:39,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:04:39,332 INFO L85 PathProgramCache]: Analyzing trace with hash -392821618, now seen corresponding path program 2 times [2022-01-31 13:04:39,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:04:39,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332860493] [2022-01-31 13:04:39,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:04:39,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:04:39,336 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-01-31 13:04:39,336 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-01-31 13:04:39,337 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_12 .cse0 (* (- 4294967296) (div (+ main_~z~0_12 .cse0) 4294967296)))) 0)) [2022-01-31 13:04:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:04:39,343 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.6))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 13:04:39,344 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.7))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 13:04:39,345 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.8))) (+ main_~z~0_12 .cse0 (* (- 4294967296) (div (+ main_~z~0_12 .cse0) 4294967296)))) 0)) [2022-01-31 13:04:39,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 13:04:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:04:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 13:04:39,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:04:39,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332860493] [2022-01-31 13:04:39,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332860493] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 13:04:39,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014678285] [2022-01-31 13:04:39,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 13:04:39,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:04:39,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:04:39,490 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 13:04:39,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-31 13:04:39,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 13:04:39,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 13:04:39,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 13:04:39,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:04:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 13:04:39,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 13:05:30,177 WARN L860 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_67_31 Int)) (or (<= aux_mod_v_main_~x~0_67_31 0) (<= 4294967296 aux_mod_v_main_~x~0_67_31) (let ((.cse4 (< 0 (mod c_main_~z~0 4294967296)))) (let ((.cse1 (not .cse4)) (.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse0) (and (or .cse1 (and (forall ((aux_div_v_main_~x~0_69_75 Int) (aux_mod_v_main_~x~0_69_75 Int) (aux_div_v_main_~x~0_67_31 Int) (v_main_~x~0_68 Int)) (let ((.cse2 (+ aux_mod_v_main_~x~0_69_75 (* aux_div_v_main_~x~0_69_75 4294967296)))) (or (<= (+ (* v_main_~x~0_68 4294967296) c_main_~z~0) .cse2) (<= aux_mod_v_main_~x~0_69_75 0) (<= 4294967296 aux_mod_v_main_~x~0_69_75) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ aux_mod_v_main_~x~0_69_75 v_it_5 (* aux_div_v_main_~x~0_69_75 4294967296) 1) (+ (* v_main_~x~0_68 4294967296) c_main_~z~0)) (<= 1 v_it_5))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ aux_mod_v_main_~x~0_69_75 v_it_4 (* aux_div_v_main_~x~0_69_75 4294967296) 1) (+ (* v_main_~x~0_68 4294967295) c_main_~x~0 c_main_~z~0)) (<= 1 v_it_4))) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~x~0_69_75 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ v_main_~x~0_68 v_it_5 1) (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_v_main_~x~0_67_31)))) (<= (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_v_main_~x~0_67_31) v_main_~x~0_68) (<= (+ (* v_main_~x~0_68 4294967295) c_main_~x~0 c_main_~z~0) .cse2)))) (forall ((aux_div_v_main_~x~0_69_86 Int) (aux_mod_v_main_~x~0_69_86 Int) (aux_div_v_main_~x~0_67_31 Int)) (let ((.cse3 (+ aux_mod_v_main_~x~0_69_86 (* aux_div_v_main_~x~0_69_86 4294967296)))) (or (<= (+ (* aux_div_v_main_~x~0_67_31 4294967296) (* aux_mod_v_main_~x~0_67_31 4294967296) c_main_~z~0) .cse3) (< 0 aux_mod_v_main_~x~0_69_86) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ aux_mod_v_main_~x~0_69_86 (* aux_div_v_main_~x~0_69_86 4294967296) v_it_4 1) (+ (* aux_mod_v_main_~x~0_67_31 4294967295) c_main_~x~0 c_main_~z~0)) (<= 1 v_it_4))) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ aux_mod_v_main_~x~0_69_86 (* aux_div_v_main_~x~0_69_86 4294967296) v_it_5 1) (+ (* aux_div_v_main_~x~0_67_31 4294967296) (* aux_mod_v_main_~x~0_67_31 4294967296) c_main_~z~0)) (<= 1 v_it_5))) (<= (+ (* aux_mod_v_main_~x~0_67_31 4294967295) c_main_~x~0 c_main_~z~0) .cse3) (< aux_mod_v_main_~x~0_69_86 0)))))) (or .cse4 (forall ((aux_div_v_main_~x~0_67_31 Int)) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_v_main_~x~0_67_31 v_it_4 1) c_main_~x~0))) (not (< (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_v_main_~x~0_67_31) c_main_~x~0))))))) (or .cse1 .cse0 (forall ((v_main_~x~0_68 Int)) (or (not (< c_main_~x~0 v_main_~x~0_68)) (let ((.cse5 (< 0 (mod (+ (* v_main_~x~0_68 4294967295) c_main_~x~0 c_main_~z~0) 4294967296)))) (and (or (not .cse5) (forall ((aux_div_v_main_~x~0_67_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_main_~x~0_68 4294967295) (* v_it_5 4294967295) c_main_~x~0 c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_main_~x~0_68 v_it_5 1) (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_v_main_~x~0_67_31)))) (not (< v_main_~x~0_68 (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_v_main_~x~0_67_31)))))) (or (forall ((aux_div_v_main_~x~0_67_31 Int)) (not (= v_main_~x~0_68 (+ (* aux_div_v_main_~x~0_67_31 4294967296) aux_mod_v_main_~x~0_67_31)))) .cse5))) (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) v_main_~x~0_68))))))))))) is different from true [2022-01-31 13:05:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-31 13:05:42,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014678285] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 13:05:42,571 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 13:05:42,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 9] total 16 [2022-01-31 13:05:42,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144632238] [2022-01-31 13:05:42,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 13:05:42,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 13:05:42,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:05:42,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 13:05:42,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=151, Unknown=19, NotChecked=26, Total=240 [2022-01-31 13:05:42,572 INFO L87 Difference]: Start difference. First operand 55 states and 88 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 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-01-31 13:06:02,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:06:02,199 INFO L93 Difference]: Finished difference Result 75 states and 115 transitions. [2022-01-31 13:06:02,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 13:06:02,200 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 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-01-31 13:06:02,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:06:02,200 INFO L225 Difference]: With dead ends: 75 [2022-01-31 13:06:02,200 INFO L226 Difference]: Without dead ends: 71 [2022-01-31 13:06:02,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 63.4s TimeCoverageRelationStatistics Valid=111, Invalid=372, Unknown=27, NotChecked=42, Total=552 [2022-01-31 13:06:02,201 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 55 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 13:06:02,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 69 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 92 Unchecked, 0.1s Time] [2022-01-31 13:06:02,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-31 13:06:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2022-01-31 13:06:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 states have internal predecessors, (89), 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-01-31 13:06:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 93 transitions. [2022-01-31 13:06:02,203 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 93 transitions. Word has length 20 [2022-01-31 13:06:02,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:06:02,203 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 93 transitions. [2022-01-31 13:06:02,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 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-01-31 13:06:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-01-31 13:06:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 13:06:02,203 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:06:02,203 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:06:02,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-31 13:06:02,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:06:02,412 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:06:02,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:06:02,412 INFO L85 PathProgramCache]: Analyzing trace with hash -127189554, now seen corresponding path program 1 times [2022-01-31 13:06:02,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:06:02,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001191044] [2022-01-31 13:06:02,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:06:02,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:06:02,415 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-01-31 13:06:02,416 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 13:06:02,416 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-01-31 13:06:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:06:02,424 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.4))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 13:06:02,425 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.5))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 13:06:02,427 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.6))) (+ main_~z~0_10 .cse0 (* (- 4294967296) (div (+ main_~z~0_10 .cse0) 4294967296)))) 0)) [2022-01-31 13:06:02,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 13:06:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:06:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 13:06:02,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:06:02,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001191044] [2022-01-31 13:06:02,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001191044] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 13:06:02,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737998419] [2022-01-31 13:06:02,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:06:02,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:06:02,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:06:02,606 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 13:06:02,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process