/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-de41.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 12:47:51,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 12:47:51,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 12:47:51,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 12:47:51,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 12:47:51,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 12:47:51,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 12:47:51,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 12:47:51,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 12:47:51,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 12:47:51,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 12:47:51,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 12:47:51,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 12:47:51,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 12:47:51,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 12:47:51,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 12:47:51,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 12:47:51,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 12:47:51,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 12:47:51,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 12:47:51,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 12:47:51,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 12:47:51,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 12:47:51,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 12:47:51,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 12:47:51,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 12:47:51,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 12:47:51,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 12:47:51,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 12:47:51,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 12:47:51,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 12:47:51,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 12:47:51,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 12:47:51,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 12:47:51,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 12:47:51,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 12:47:51,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 12:47:51,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 12:47:51,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 12:47:51,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 12:47:51,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 12:47:51,724 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 12:47:51,729 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 12:47:51,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 12:47:51,730 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 12:47:51,730 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 12:47:51,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 12:47:51,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 12:47:51,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 12:47:51,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 12:47:51,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 12:47:51,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 12:47:51,731 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 12:47:51,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 12:47:51,731 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 12:47:51,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 12:47:51,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 12:47:51,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 12:47:51,731 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 12:47:51,731 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 12:47:51,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:47:51,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 12:47:51,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 12:47:51,732 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 12:47:51,732 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:47:51,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 12:47:51,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 12:47:51,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 12:47:51,926 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 12:47:51,926 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 12:47:51,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de41.c [2022-01-31 12:47:51,977 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7a7fcfd/62468a7e029c444ea64ae203d00684cd/FLAG83da91619 [2022-01-31 12:47:52,257 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 12:47:52,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de41.c [2022-01-31 12:47:52,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7a7fcfd/62468a7e029c444ea64ae203d00684cd/FLAG83da91619 [2022-01-31 12:47:52,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7a7fcfd/62468a7e029c444ea64ae203d00684cd [2022-01-31 12:47:52,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 12:47:52,703 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 12:47:52,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 12:47:52,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 12:47:52,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 12:47:52,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:47:52" (1/1) ... [2022-01-31 12:47:52,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1670d618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:52, skipping insertion in model container [2022-01-31 12:47:52,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:47:52" (1/1) ... [2022-01-31 12:47:52,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 12:47:52,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 12:47:52,809 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-de41.c[368,381] [2022-01-31 12:47:52,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:47:52,821 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 12:47:52,849 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-de41.c[368,381] [2022-01-31 12:47:52,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:47:52,859 INFO L208 MainTranslator]: Completed translation [2022-01-31 12:47:52,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:52 WrapperNode [2022-01-31 12:47:52,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 12:47:52,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 12:47:52,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 12:47:52,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 12:47:52,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:52" (1/1) ... [2022-01-31 12:47:52,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:52" (1/1) ... [2022-01-31 12:47:52,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:52" (1/1) ... [2022-01-31 12:47:52,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:52" (1/1) ... [2022-01-31 12:47:52,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:52" (1/1) ... [2022-01-31 12:47:52,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:52" (1/1) ... [2022-01-31 12:47:52,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:52" (1/1) ... [2022-01-31 12:47:52,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 12:47:52,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 12:47:52,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 12:47:52,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 12:47:52,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:52" (1/1) ... [2022-01-31 12:47:52,896 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:47:52,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:47:52,914 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:47:52,917 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:47:52,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 12:47:52,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 12:47:52,962 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 12:47:52,962 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 12:47:52,962 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 12:47:52,962 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 12:47:52,962 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 12:47:52,962 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 12:47:52,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 12:47:52,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-01-31 12:47:52,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 12:47:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 12:47:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 12:47:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 12:47:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 12:47:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 12:47:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 12:47:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 12:47:53,005 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 12:47:53,006 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 12:47:53,084 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 12:47:53,088 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 12:47:53,088 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-31 12:47:53,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:47:53 BoogieIcfgContainer [2022-01-31 12:47:53,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 12:47:53,090 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 12:47:53,090 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 12:47:53,091 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 12:47:53,092 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:47:53" (1/1) ... [2022-01-31 12:47:53,264 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:47:53,264 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5, 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_4 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~x~0_4 v_main_~x~0_3) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~y~0_6 v_main_~y~0_5)) (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_4 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~y~0_6 v_it_1 1) v_main_~y~0_5)))) (< v_main_~y~0_6 v_main_~y~0_5) (< 0 .cse0) (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_6 (* (- 1) v_main_~y~0_5)))))) InVars {main_~y~0=v_main_~y~0_6, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, 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:47:53,374 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:47:53,374 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_7 (+ v_main_~z~0_6 1)) (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_7 4294967296))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7} OutVars{main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_6, 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_7 4294967296))) (or (and (= v_main_~x~0_9 v_main_~x~0_8) (= v_main_~z~0_7 v_main_~z~0_6) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= |v_main_#t~post8_3| |v_main_#t~post8_1|) (<= .cse0 0)) (and (< v_main_~x~0_9 v_main_~x~0_8) (= v_main_~z~0_6 (+ (* (- 1) v_main_~x~0_8) v_main_~x~0_9 v_main_~z~0_7)) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_main_~x~0_9 v_it_2 1) v_main_~x~0_8)) (< 0 (mod (+ v_main_~z~0_7 (* v_it_2 4294967295)) 4294967296)))) (< 0 .cse0)))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_7, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_6, 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:47:53,429 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:47:53,430 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_4 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~z~0=v_main_~z~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post10=|v_main_#t~post10_1|, main_~z~0=v_main_~z~0_2, main_~y~0=v_main_~y~0_3, 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_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, 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_3, 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:47:53,476 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:47:53,476 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 1) v_main_~y~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_7, 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_7 4294967296))) (or (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~x~0_6 v_it_4 1) v_main_~x~0_7)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_7) 4294967296)) (not (<= 1 v_it_4)))) (< 0 .cse0) (< v_main_~x~0_6 v_main_~x~0_7) (= (+ (* (- 1) v_main_~x~0_6) v_main_~x~0_7 v_main_~y~0_8) v_main_~y~0_7)) (and (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (<= .cse0 0) (= v_main_~y~0_8 v_main_~y~0_7) (= v_main_~x~0_7 v_main_~x~0_6)))) InVars {main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_7, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|} OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_6, 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:47:53,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:47:53 BasicIcfg [2022-01-31 12:47:53,479 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 12:47:53,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 12:47:53,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 12:47:53,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 12:47:53,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 12:47:52" (1/4) ... [2022-01-31 12:47:53,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13777c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:47:53, skipping insertion in model container [2022-01-31 12:47:53,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:52" (2/4) ... [2022-01-31 12:47:53,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13777c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:47:53, skipping insertion in model container [2022-01-31 12:47:53,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:47:53" (3/4) ... [2022-01-31 12:47:53,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13777c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 12:47:53, skipping insertion in model container [2022-01-31 12:47:53,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:47:53" (4/4) ... [2022-01-31 12:47:53,487 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de41.cJordan [2022-01-31 12:47:53,490 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 12:47:53,491 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 12:47:53,516 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 12:47:53,521 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:47:53,521 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 12:47:53,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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:47:53,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 12:47:53,533 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:47:53,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:47:53,533 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:47:53,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:47:53,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2015447748, now seen corresponding path program 1 times [2022-01-31 12:47:53,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:47:53,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195640441] [2022-01-31 12:47:53,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:47:53,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:47:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:47:53,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:47:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:47:53,622 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:47:53,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:47:53,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195640441] [2022-01-31 12:47:53,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195640441] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:47:53,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:47:53,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 12:47:53,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59698393] [2022-01-31 12:47:53,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:47:53,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 12:47:53,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:47:53,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 12:47:53,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 12:47:53,645 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:47:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:47:53,663 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-01-31 12:47:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 12:47:53,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 15 [2022-01-31 12:47:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:47:53,669 INFO L225 Difference]: With dead ends: 23 [2022-01-31 12:47:53,669 INFO L226 Difference]: Without dead ends: 16 [2022-01-31 12:47:53,670 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:47:53,672 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 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:47:53,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 12:47:53,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-01-31 12:47:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-01-31 12:47:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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:47:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-01-31 12:47:53,692 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15 [2022-01-31 12:47:53,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:47:53,692 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-01-31 12:47:53,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:47:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-01-31 12:47:53,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 12:47:53,693 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:47:53,693 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:47:53,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 12:47:53,693 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:47:53,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:47:53,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1389121438, now seen corresponding path program 1 times [2022-01-31 12:47:53,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:47:53,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117571009] [2022-01-31 12:47:53,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:47:53,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:47:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:47:53,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:47:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:47:53,958 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:47:53,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:47:53,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117571009] [2022-01-31 12:47:53,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117571009] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:47:53,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:47:53,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 12:47:53,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335826946] [2022-01-31 12:47:53,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:47:53,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 12:47:53,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:47:53,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 12:47:53,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-31 12:47:53,963 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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:47:54,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:47:54,049 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-01-31 12:47:54,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 12:47:54,050 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 15 [2022-01-31 12:47:54,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:47:54,050 INFO L225 Difference]: With dead ends: 27 [2022-01-31 12:47:54,050 INFO L226 Difference]: Without dead ends: 24 [2022-01-31 12:47:54,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 12:47:54,052 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:47:54,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 42 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-01-31 12:47:54,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-31 12:47:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-01-31 12:47:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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:47:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-01-31 12:47:54,062 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 15 [2022-01-31 12:47:54,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:47:54,065 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-01-31 12:47:54,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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:47:54,066 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-01-31 12:47:54,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 12:47:54,066 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:47:54,066 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:47:54,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 12:47:54,067 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:47:54,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:47:54,067 INFO L85 PathProgramCache]: Analyzing trace with hash 139812261, now seen corresponding path program 1 times [2022-01-31 12:47:54,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:47:54,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274859078] [2022-01-31 12:47:54,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:47:54,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:47:54,080 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:47:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:47:54,122 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:47:54,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:47:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:47:54,207 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:47:54,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:47:54,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274859078] [2022-01-31 12:47:54,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274859078] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:47:54,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719572432] [2022-01-31 12:47:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:47:54,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:47:54,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:47:54,224 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:47:54,231 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:47:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:47:54,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 12:47:54,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:47:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:47:54,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 12:47:54,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719572432] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:47:54,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:47:54,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-01-31 12:47:54,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91948961] [2022-01-31 12:47:54,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:47:54,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 12:47:54,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:47:54,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 12:47:54,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-01-31 12:47:54,477 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 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:47:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:47:54,503 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-01-31 12:47:54,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 12:47:54,503 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 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 16 [2022-01-31 12:47:54,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:47:54,504 INFO L225 Difference]: With dead ends: 26 [2022-01-31 12:47:54,505 INFO L226 Difference]: Without dead ends: 19 [2022-01-31 12:47:54,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-01-31 12:47:54,507 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:47:54,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 72 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-01-31 12:47:54,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-31 12:47:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-01-31 12:47:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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:47:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-01-31 12:47:54,511 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 16 [2022-01-31 12:47:54,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:47:54,511 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-01-31 12:47:54,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 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:47:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-01-31 12:47:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 12:47:54,513 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:47:54,513 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:47:54,534 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:47:54,734 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:47:54,734 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:47:54,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:47:54,735 INFO L85 PathProgramCache]: Analyzing trace with hash -894405051, now seen corresponding path program 1 times [2022-01-31 12:47:54,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:47:54,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200415214] [2022-01-31 12:47:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:47:54,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:47:54,740 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:47:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:47:54,766 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 12:47:54,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:47:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:47:54,859 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:47:54,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:47:54,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200415214] [2022-01-31 12:47:54,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200415214] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:47:54,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978824002] [2022-01-31 12:47:54,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:47:54,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:47:54,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:47:54,884 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:47:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:47:54,915 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:47:54,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 12:47:54,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:47:55,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:47:55,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 12:47:55,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978824002] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:47:55,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:47:55,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-01-31 12:47:55,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853596490] [2022-01-31 12:47:55,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:47:55,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 12:47:55,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:47:55,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 12:47:55,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-01-31 12:47:55,094 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 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:47:55,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:47:55,120 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-01-31 12:47:55,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 12:47:55,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 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 16 [2022-01-31 12:47:55,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:47:55,121 INFO L225 Difference]: With dead ends: 25 [2022-01-31 12:47:55,121 INFO L226 Difference]: Without dead ends: 22 [2022-01-31 12:47:55,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-01-31 12:47:55,123 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:47:55,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 67 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-01-31 12:47:55,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-31 12:47:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-01-31 12:47:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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:47:55,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-01-31 12:47:55,128 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 16 [2022-01-31 12:47:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:47:55,128 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-01-31 12:47:55,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 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:47:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-01-31 12:47:55,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 12:47:55,131 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:47:55,131 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:47:55,168 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:47:55,348 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:47:55,348 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:47:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:47:55,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1590526661, now seen corresponding path program 1 times [2022-01-31 12:47:55,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:47:55,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679853258] [2022-01-31 12:47:55,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:47:55,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:47:55,362 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:47:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:47:55,385 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:47:55,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:47:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:47:55,476 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:47:55,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:47:55,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679853258] [2022-01-31 12:47:55,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679853258] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:47:55,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594039531] [2022-01-31 12:47:55,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:47:55,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:47:55,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:47:55,492 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:47:55,543 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:47:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:47:55,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 12:47:55,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:48:01,515 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:48:01,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:48:08,781 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:48:08,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594039531] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:48:08,782 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:48:08,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-01-31 12:48:08,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878877662] [2022-01-31 12:48:08,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:48:08,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 12:48:08,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:48:08,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 12:48:08,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=210, Unknown=2, NotChecked=0, Total=272 [2022-01-31 12:48:08,783 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 14 states have internal predecessors, (25), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:48:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:48:09,047 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-01-31 12:48:09,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 12:48:09,048 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 14 states have internal predecessors, (25), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-01-31 12:48:09,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:48:09,049 INFO L225 Difference]: With dead ends: 37 [2022-01-31 12:48:09,049 INFO L226 Difference]: Without dead ends: 33 [2022-01-31 12:48:09,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=139, Invalid=459, Unknown=2, NotChecked=0, Total=600 [2022-01-31 12:48:09,050 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:48:09,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 52 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 44 Unchecked, 0.1s Time] [2022-01-31 12:48:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-31 12:48:09,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-01-31 12:48:09,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 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:48:09,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2022-01-31 12:48:09,053 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 16 [2022-01-31 12:48:09,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:48:09,053 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-01-31 12:48:09,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 14 states have internal predecessors, (25), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:48:09,053 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-01-31 12:48:09,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 12:48:09,053 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:48:09,053 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:48:09,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 12:48:09,263 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:48:09,263 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:48:09,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:48:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1930032162, now seen corresponding path program 1 times [2022-01-31 12:48:09,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:48:09,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756790204] [2022-01-31 12:48:09,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:48:09,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:48:09,271 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:48:09,273 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-01-31 12:48:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:48:09,309 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:48:09,315 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.4))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-01-31 12:48:09,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:48:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:48:09,537 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:48:09,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:48:09,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756790204] [2022-01-31 12:48:09,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756790204] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:48:09,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796008896] [2022-01-31 12:48:09,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:48:09,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:48:09,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:48:09,538 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:48:09,552 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:48:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:48:09,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 12:48:09,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:48:09,760 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:48:09,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:48:47,647 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:48:47,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796008896] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:48:47,648 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:48:47,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 19 [2022-01-31 12:48:47,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142102802] [2022-01-31 12:48:47,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:48:47,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 12:48:47,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:48:47,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 12:48:47,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=246, Unknown=16, NotChecked=0, Total=342 [2022-01-31 12:48:47,649 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:48:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:48:58,514 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-01-31 12:48:58,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 12:48:58,515 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 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:48:58,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:48:58,515 INFO L225 Difference]: With dead ends: 36 [2022-01-31 12:48:58,515 INFO L226 Difference]: Without dead ends: 33 [2022-01-31 12:48:58,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 45.4s TimeCoverageRelationStatistics Valid=140, Invalid=439, Unknown=21, NotChecked=0, Total=600 [2022-01-31 12:48:58,516 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:48:58,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 53 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 73 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-01-31 12:48:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-31 12:48:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-01-31 12:48:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 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:48:58,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2022-01-31 12:48:58,518 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 17 [2022-01-31 12:48:58,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:48:58,518 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2022-01-31 12:48:58,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:48:58,519 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2022-01-31 12:48:58,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 12:48:58,519 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:48:58,519 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:48:58,536 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:48:58,725 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:48:58,725 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:48:58,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:48:58,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2088406878, now seen corresponding path program 1 times [2022-01-31 12:48:58,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:48:58,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234652473] [2022-01-31 12:48:58,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:48:58,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:48:58,730 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:48:58,731 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_6 (* (- 4294967296) (div (+ .cse0 main_~x~0_6) 4294967296)))) 0)) [2022-01-31 12:48:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:48:58,740 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:48:58,745 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_6 (* (- 4294967296) (div (+ .cse0 main_~x~0_6) 4294967296)))) 0)) [2022-01-31 12:48:58,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:48:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:48:58,971 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:48:58,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:48:58,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234652473] [2022-01-31 12:48:58,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234652473] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:48:58,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961930982] [2022-01-31 12:48:58,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:48:58,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:48:58,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:48:58,972 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:48:58,973 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:48:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:48:59,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-31 12:48:59,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:48:59,950 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:48:59,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:49:09,610 WARN L228 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:49:12,417 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:49:12,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961930982] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:49:12,417 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:49:12,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-01-31 12:49:12,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854013083] [2022-01-31 12:49:12,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:49:12,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 12:49:12,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:49:12,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 12:49:12,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=263, Unknown=1, NotChecked=0, Total=342 [2022-01-31 12:49:12,418 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 16 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:49:12,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:49:12,817 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-01-31 12:49:12,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 12:49:12,817 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 16 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 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:49:12,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:49:12,818 INFO L225 Difference]: With dead ends: 41 [2022-01-31 12:49:12,818 INFO L226 Difference]: Without dead ends: 37 [2022-01-31 12:49:12,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=163, Invalid=592, Unknown=1, NotChecked=0, Total=756 [2022-01-31 12:49:12,818 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:49:12,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 72 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 76 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2022-01-31 12:49:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-31 12:49:12,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2022-01-31 12:49:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 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:49:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2022-01-31 12:49:12,821 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 17 [2022-01-31 12:49:12,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:49:12,821 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2022-01-31 12:49:12,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 16 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:49:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2022-01-31 12:49:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 12:49:12,822 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:49:12,822 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:49:12,838 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:49:13,031 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:49:13,031 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:49:13,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:49:13,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1433573341, now seen corresponding path program 1 times [2022-01-31 12:49:13,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:49:13,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312763045] [2022-01-31 12:49:13,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:49:13,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:49:13,035 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:49:13,036 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_6 .cse0 (* (- 4294967296) (div (+ main_~y~0_6 .cse0) 4294967296)))) 0)) [2022-01-31 12:49:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:49:13,046 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:49:13,057 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.3))) (+ main_~y~0_6 .cse0 (* (- 4294967296) (div (+ main_~y~0_6 .cse0) 4294967296)))) 0)) [2022-01-31 12:49:13,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:49:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:49:13,255 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:49:13,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:49:13,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312763045] [2022-01-31 12:49:13,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312763045] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:49:13,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661238676] [2022-01-31 12:49:13,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:49:13,256 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:49:13,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:49:13,258 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:49:13,259 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:49:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:49:13,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 12:49:13,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:49:13,869 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:49:13,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:49:16,407 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:49:16,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661238676] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:49:16,408 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:49:16,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 19 [2022-01-31 12:49:16,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757053859] [2022-01-31 12:49:16,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:49:16,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 12:49:16,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:49:16,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 12:49:16,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=275, Unknown=1, NotChecked=0, Total=342 [2022-01-31 12:49:16,409 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:49:19,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:49:19,027 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-01-31 12:49:19,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 12:49:19,028 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 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:49:19,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:49:19,028 INFO L225 Difference]: With dead ends: 39 [2022-01-31 12:49:19,028 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 12:49:19,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=171, Invalid=583, Unknown=2, NotChecked=0, Total=756 [2022-01-31 12:49:19,029 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:49:19,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 84 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 95 Invalid, 0 Unknown, 56 Unchecked, 0.1s Time] [2022-01-31 12:49:19,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 12:49:19,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-01-31 12:49:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 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:49:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2022-01-31 12:49:19,032 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 17 [2022-01-31 12:49:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:49:19,032 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2022-01-31 12:49:19,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:49:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2022-01-31 12:49:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 12:49:19,032 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:49:19,032 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:49:19,049 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:49:19,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:49:19,244 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:49:19,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:49:19,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1054189566, now seen corresponding path program 1 times [2022-01-31 12:49:19,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:49:19,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054041404] [2022-01-31 12:49:19,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:49:19,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:49:19,248 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:49:19,249 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-01-31 12:49:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:49:19,282 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:49:19,290 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.4))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-01-31 12:49:19,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:49:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:49:19,496 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:49:19,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:49:19,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054041404] [2022-01-31 12:49:19,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054041404] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:49:19,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285404259] [2022-01-31 12:49:19,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:49:19,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:49:19,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:49:19,498 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:49:19,517 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:49:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:49:19,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 12:49:19,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:49:19,832 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:49:19,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:49:22,723 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:49:22,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285404259] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:49:22,723 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:49:22,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-01-31 12:49:22,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608380801] [2022-01-31 12:49:22,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:49:22,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 12:49:22,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:49:22,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 12:49:22,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=194, Unknown=1, NotChecked=0, Total=240 [2022-01-31 12:49:22,724 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:49:28,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:49:28,903 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-01-31 12:49:28,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 12:49:28,903 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 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:49:28,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:49:28,904 INFO L225 Difference]: With dead ends: 40 [2022-01-31 12:49:28,904 INFO L226 Difference]: Without dead ends: 37 [2022-01-31 12:49:28,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=119, Invalid=430, Unknown=3, NotChecked=0, Total=552 [2022-01-31 12:49:28,905 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:49:28,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 63 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-01-31 12:49:28,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-31 12:49:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-01-31 12:49:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 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:49:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-01-31 12:49:28,907 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2022-01-31 12:49:28,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:49:28,907 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2022-01-31 12:49:28,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:49:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2022-01-31 12:49:28,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:49:28,907 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:49:28,908 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:49:28,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 12:49:29,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:49:29,108 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:49:29,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:49:29,109 INFO L85 PathProgramCache]: Analyzing trace with hash 325265765, now seen corresponding path program 2 times [2022-01-31 12:49:29,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:49:29,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724939678] [2022-01-31 12:49:29,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:49:29,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:49:29,112 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:49:29,113 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-01-31 12:49:29,113 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.2))) (+ .cse0 main_~x~0_11 (* (- 4294967296) (div (+ .cse0 main_~x~0_11) 4294967296)))) 0)) [2022-01-31 12:49:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:49:29,128 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.5))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 12:49:29,131 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.6))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-01-31 12:49:29,134 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.7))) (+ .cse0 main_~x~0_11 (* (- 4294967296) (div (+ .cse0 main_~x~0_11) 4294967296)))) 0)) [2022-01-31 12:49:29,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:49:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:49:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:49:29,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:49:29,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724939678] [2022-01-31 12:49:29,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724939678] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:49:29,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087195833] [2022-01-31 12:49:29,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 12:49:29,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:49:29,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:49:29,313 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:49:29,314 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:49:29,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 12:49:29,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:49:29,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 12:49:29,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:49:29,505 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:49:29,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:49:40,178 WARN L228 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:50:18,228 WARN L228 SmtUtils]: Spent 10.25s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:50:32,674 WARN L228 SmtUtils]: Spent 10.92s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:52:06,036 WARN L860 $PredicateComparison]: unable to prove that (or (and (or (< (+ (* 4294967296 (div c_main_~y~0 4294967296)) c_main_~n~0) (+ (* (div c_main_~n~0 4294967296) 4294967296) c_main_~y~0 1)) (forall ((aux_mod_v_main_~x~0_36_31 Int)) (or (< 0 aux_mod_v_main_~x~0_36_31) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_36_31 Int)) (or (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_36_31 (* aux_div_v_main_~x~0_36_31 4294967296)))) (exists ((v_it_2 Int)) (and (<= 1 v_it_2) (not (< 0 (mod (+ (* v_it_2 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_2 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_36_31 (* aux_div_v_main_~x~0_36_31 4294967296))))))) (not .cse0)) (or .cse0 (forall ((aux_div_v_main_~x~0_36_31 Int)) (not (= (+ aux_mod_v_main_~x~0_36_31 (* aux_div_v_main_~x~0_36_31 4294967296)) c_main_~x~0)))))) (< aux_mod_v_main_~x~0_36_31 0)))) (forall ((v_main_~y~0_34 Int)) (or (<= v_main_~y~0_34 c_main_~y~0) (and (forall ((aux_mod_aux_mod_v_main_~x~0_36_31_86 Int) (aux_div_aux_mod_v_main_~x~0_36_31_86 Int)) (let ((.cse2 (* v_main_~y~0_34 4294967295)) (.cse1 (+ (* aux_div_aux_mod_v_main_~x~0_36_31_86 4294967296) aux_mod_aux_mod_v_main_~x~0_36_31_86))) (or (<= aux_mod_aux_mod_v_main_~x~0_36_31_86 0) (<= .cse1 (+ .cse2 c_main_~y~0)) (and (forall ((aux_div_v_main_~y~0_33_31 Int) (aux_mod_v_main_~y~0_33_31 Int)) (or (< c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~y~0_33_31 1)) (exists ((v_it_4 Int)) (and (<= (+ v_main_~y~0_34 v_it_4 1) (+ aux_mod_v_main_~y~0_33_31 (* aux_div_v_main_~y~0_33_31 4294967296))) (<= 1 v_it_4) (not (< 0 (mod (+ (* v_it_4 4294967295) aux_mod_aux_mod_v_main_~x~0_36_31_86) 4294967296))))) (not (< v_main_~y~0_34 (+ aux_mod_v_main_~y~0_33_31 (* aux_div_v_main_~y~0_33_31 4294967296)))) (< aux_mod_v_main_~y~0_33_31 0))) (forall ((aux_div_v_main_~y~0_33_31 Int) (aux_mod_v_main_~y~0_33_31 Int)) (or (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~y~0_33_31) c_main_~n~0) (exists ((v_it_4 Int)) (and (<= (+ v_main_~y~0_34 v_it_4 1) (+ aux_mod_v_main_~y~0_33_31 (* aux_div_v_main_~y~0_33_31 4294967296))) (<= 1 v_it_4) (not (< 0 (mod (+ (* v_it_4 4294967295) aux_mod_aux_mod_v_main_~x~0_36_31_86) 4294967296))))) (not (< v_main_~y~0_34 (+ aux_mod_v_main_~y~0_33_31 (* aux_div_v_main_~y~0_33_31 4294967296)))) (<= 4294967296 aux_mod_v_main_~y~0_33_31)))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) v_main_~y~0_34 (* 4294967295 c_main_~y~0) aux_mod_aux_mod_v_main_~x~0_36_31_86) 4294967296))) (<= 1 v_it_4) (<= (+ v_it_4 c_main_~y~0 1) v_main_~y~0_34))) (<= (+ .cse2 4294967296 c_main_~y~0) .cse1) (let ((.cse3 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse3) (forall ((aux_div_v_main_~x~0_36_31 Int)) (or (not (< (+ (* v_main_~y~0_34 4294967295) c_main_~x~0 c_main_~y~0) (+ (* aux_div_v_main_~x~0_36_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_36_31_86 4294967296) aux_mod_aux_mod_v_main_~x~0_36_31_86))) (exists ((v_it_2 Int)) (and (<= (+ v_it_2 (* v_main_~y~0_34 4294967295) c_main_~x~0 c_main_~y~0 1) (+ (* aux_div_v_main_~x~0_36_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_36_31_86 4294967296) aux_mod_aux_mod_v_main_~x~0_36_31_86)) (<= 1 v_it_2) (not (< 0 (mod (+ (* v_it_2 4294967295) c_main_~z~0) 4294967296)))))))) (or .cse3 (forall ((aux_div_v_main_~x~0_36_31 Int)) (not (= (+ (* aux_div_v_main_~x~0_36_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_36_31_86 4294967296) aux_mod_aux_mod_v_main_~x~0_36_31_86) (+ (* v_main_~y~0_34 4294967295) c_main_~x~0 c_main_~y~0))))))) (<= 4294967296 aux_mod_aux_mod_v_main_~x~0_36_31_86)))) (or (forall ((aux_mod_aux_mod_v_main_~x~0_36_31_86 Int) (aux_div_aux_mod_v_main_~x~0_36_31_86 Int)) (let ((.cse5 (* v_main_~y~0_34 4294967295)) (.cse4 (+ (* aux_div_aux_mod_v_main_~x~0_36_31_86 4294967296) aux_mod_aux_mod_v_main_~x~0_36_31_86))) (or (< aux_mod_aux_mod_v_main_~x~0_36_31_86 0) (< 0 aux_mod_aux_mod_v_main_~x~0_36_31_86) (<= .cse4 (+ .cse5 c_main_~y~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) v_main_~y~0_34 (* 4294967295 c_main_~y~0) aux_mod_aux_mod_v_main_~x~0_36_31_86) 4294967296))) (<= 1 v_it_4) (<= (+ v_it_4 c_main_~y~0 1) v_main_~y~0_34))) (<= (+ .cse5 4294967296 c_main_~y~0) .cse4) (let ((.cse6 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse6) (forall ((aux_div_v_main_~x~0_36_31 Int)) (or (not (< (+ (* v_main_~y~0_34 4294967295) c_main_~x~0 c_main_~y~0) (+ (* aux_div_v_main_~x~0_36_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_36_31_86 4294967296) aux_mod_aux_mod_v_main_~x~0_36_31_86))) (exists ((v_it_2 Int)) (and (<= (+ v_it_2 (* v_main_~y~0_34 4294967295) c_main_~x~0 c_main_~y~0 1) (+ (* aux_div_v_main_~x~0_36_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_36_31_86 4294967296) aux_mod_aux_mod_v_main_~x~0_36_31_86)) (<= 1 v_it_2) (not (< 0 (mod (+ (* v_it_2 4294967295) c_main_~z~0) 4294967296)))))))) (or .cse6 (forall ((aux_div_v_main_~x~0_36_31 Int)) (not (= (+ (* aux_div_v_main_~x~0_36_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_36_31_86 4294967296) aux_mod_aux_mod_v_main_~x~0_36_31_86) (+ (* v_main_~y~0_34 4294967295) c_main_~x~0 c_main_~y~0)))))))))) (let ((.cse8 (* (div c_main_~n~0 4294967296) 4294967296)) (.cse7 (+ (* (div v_main_~y~0_34 4294967296) 4294967296) c_main_~n~0))) (and (< .cse7 (+ .cse8 v_main_~y~0_34 1)) (<= (+ .cse8 v_main_~y~0_34) .cse7)))))))) (< 0 (mod c_main_~y~0 4294967296))) is different from true [2022-01-31 12:52:40,738 WARN L228 SmtUtils]: Spent 16.68s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:52:45,685 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 12:52:45,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087195833] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:52:45,685 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:52:45,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 11] total 20 [2022-01-31 12:52:45,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176384343] [2022-01-31 12:52:45,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:52:45,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 12:52:45,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:52:45,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 12:52:45,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=246, Unknown=21, NotChecked=34, Total=380 [2022-01-31 12:52:45,686 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:52:54,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:52:54,735 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-01-31 12:52:54,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 12:52:54,735 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 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:52:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:52:54,736 INFO L225 Difference]: With dead ends: 45 [2022-01-31 12:52:54,736 INFO L226 Difference]: Without dead ends: 39 [2022-01-31 12:52:54,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 105.6s TimeCoverageRelationStatistics Valid=130, Invalid=403, Unknown=23, NotChecked=44, Total=600 [2022-01-31 12:52:54,736 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:52:54,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 46 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 45 Invalid, 0 Unknown, 57 Unchecked, 0.1s Time] [2022-01-31 12:52:54,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-31 12:52:54,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-01-31 12:52:54,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 30 states have internal predecessors, (46), 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:52:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2022-01-31 12:52:54,739 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 18 [2022-01-31 12:52:54,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:52:54,739 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2022-01-31 12:52:54,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:52:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2022-01-31 12:52:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:52:54,739 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:52:54,739 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:52:54,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-31 12:52:54,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 12:52:54,945 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:52:54,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:52:54,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1481938624, now seen corresponding path program 1 times [2022-01-31 12:52:54,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:52:54,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597120084] [2022-01-31 12:52:54,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:52:54,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:52:54,949 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:52:54,950 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 12:52:54,951 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.2))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-01-31 12:52:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:54,989 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 12:52:54,999 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 12:52:55,002 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.6))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-01-31 12:52:55,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:52:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:52:55,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:52:55,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597120084] [2022-01-31 12:52:55,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597120084] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:52:55,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656655955] [2022-01-31 12:52:55,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:52:55,213 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:52:55,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:52:55,214 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:52:55,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process