/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-7968f31 [2022-03-17 15:21:09,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 15:21:09,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 15:21:09,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 15:21:09,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 15:21:09,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 15:21:09,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 15:21:09,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 15:21:09,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 15:21:09,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 15:21:09,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 15:21:09,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 15:21:09,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 15:21:09,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 15:21:09,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 15:21:09,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 15:21:09,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 15:21:09,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 15:21:09,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 15:21:09,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 15:21:09,914 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 15:21:09,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 15:21:09,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 15:21:09,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 15:21:09,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 15:21:09,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 15:21:09,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 15:21:09,921 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 15:21:09,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 15:21:09,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 15:21:09,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 15:21:09,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 15:21:09,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 15:21:09,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 15:21:09,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 15:21:09,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 15:21:09,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 15:21:09,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 15:21:09,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 15:21:09,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 15:21:09,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 15:21:09,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 15:21:09,928 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-17 15:21:09,936 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 15:21:09,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 15:21:09,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 15:21:09,937 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-17 15:21:09,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 15:21:09,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-17 15:21:09,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 15:21:09,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 15:21:09,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 15:21:09,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 15:21:09,938 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-17 15:21:09,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 15:21:09,938 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 15:21:09,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 15:21:09,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 15:21:09,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 15:21:09,939 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-17 15:21:09,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 15:21:09,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 15:21:09,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 15:21:09,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 15:21:09,940 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 15:21:09,940 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-17 15:21:10,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 15:21:10,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 15:21:10,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 15:21:10,164 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 15:21:10,167 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 15:21:10,168 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-03-17 15:21:10,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79f90aff/17c1089b374e48f1879f38ebb6a1b2fc/FLAG6845ba100 [2022-03-17 15:21:10,612 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 15:21:10,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de41.c [2022-03-17 15:21:10,617 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79f90aff/17c1089b374e48f1879f38ebb6a1b2fc/FLAG6845ba100 [2022-03-17 15:21:11,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79f90aff/17c1089b374e48f1879f38ebb6a1b2fc [2022-03-17 15:21:11,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 15:21:11,038 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 15:21:11,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 15:21:11,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 15:21:11,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 15:21:11,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:21:11" (1/1) ... [2022-03-17 15:21:11,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f3d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:21:11, skipping insertion in model container [2022-03-17 15:21:11,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:21:11" (1/1) ... [2022-03-17 15:21:11,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 15:21:11,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 15:21:11,179 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-03-17 15:21:11,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 15:21:11,211 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 15:21:11,220 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-03-17 15:21:11,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 15:21:11,234 INFO L208 MainTranslator]: Completed translation [2022-03-17 15:21:11,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:21:11 WrapperNode [2022-03-17 15:21:11,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 15:21:11,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 15:21:11,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 15:21:11,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 15:21:11,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:21:11" (1/1) ... [2022-03-17 15:21:11,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:21:11" (1/1) ... [2022-03-17 15:21:11,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:21:11" (1/1) ... [2022-03-17 15:21:11,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:21:11" (1/1) ... [2022-03-17 15:21:11,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:21:11" (1/1) ... [2022-03-17 15:21:11,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:21:11" (1/1) ... [2022-03-17 15:21:11,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:21:11" (1/1) ... [2022-03-17 15:21:11,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 15:21:11,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 15:21:11,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 15:21:11,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 15:21:11,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:21:11" (1/1) ... [2022-03-17 15:21:11,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 15:21:11,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:21:11,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-17 15:21:11,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-17 15:21:11,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 15:21:11,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 15:21:11,318 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 15:21:11,319 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-17 15:21:11,319 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 15:21:11,319 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 15:21:11,320 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 15:21:11,320 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 15:21:11,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 15:21:11,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-17 15:21:11,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-17 15:21:11,320 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 15:21:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 15:21:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 15:21:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 15:21:11,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 15:21:11,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 15:21:11,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 15:21:11,380 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 15:21:11,381 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 15:21:11,461 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 15:21:11,465 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 15:21:11,466 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-17 15:21:11,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:21:11 BoogieIcfgContainer [2022-03-17 15:21:11,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 15:21:11,468 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 15:21:11,468 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 15:21:11,469 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 15:21:11,471 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:21:11" (1/1) ... [2022-03-17 15:21:11,685 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:21:11,686 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-03-17 15:21:11,841 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:21:11,842 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-03-17 15:21:11,901 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:21:11,902 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-03-17 15:21:11,956 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:21:11,956 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-03-17 15:21:11,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 03:21:11 BasicIcfg [2022-03-17 15:21:11,961 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 15:21:11,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 15:21:11,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 15:21:11,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 15:21:11,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:21:11" (1/4) ... [2022-03-17 15:21:11,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c166539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:21:11, skipping insertion in model container [2022-03-17 15:21:11,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:21:11" (2/4) ... [2022-03-17 15:21:11,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c166539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:21:11, skipping insertion in model container [2022-03-17 15:21:11,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:21:11" (3/4) ... [2022-03-17 15:21:11,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c166539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:21:11, skipping insertion in model container [2022-03-17 15:21:11,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 03:21:11" (4/4) ... [2022-03-17 15:21:11,972 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de41.cJordan [2022-03-17 15:21:11,981 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-17 15:21:11,981 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-17 15:21:12,012 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 15:21:12,018 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-17 15:21:12,018 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-17 15:21:12,026 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-03-17 15:21:12,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-17 15:21:12,032 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:21:12,033 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:21:12,033 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:21:12,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:21:12,037 INFO L85 PathProgramCache]: Analyzing trace with hash -2015447748, now seen corresponding path program 1 times [2022-03-17 15:21:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:21:12,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563352220] [2022-03-17 15:21:12,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:21:12,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:21:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:12,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:21:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:21:12,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:21:12,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563352220] [2022-03-17 15:21:12,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563352220] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:21:12,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:21:12,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-17 15:21:12,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305705666] [2022-03-17 15:21:12,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:21:12,195 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-17 15:21:12,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:21:12,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-17 15:21:12,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-17 15:21:12,220 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-03-17 15:21:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:21:12,248 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-03-17 15:21:12,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-17 15:21:12,255 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-03-17 15:21:12,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:21:12,262 INFO L225 Difference]: With dead ends: 23 [2022-03-17 15:21:12,263 INFO L226 Difference]: Without dead ends: 16 [2022-03-17 15:21:12,264 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-17 15:21:12,269 INFO L912 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-03-17 15:21:12,271 INFO L913 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-03-17 15:21:12,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-03-17 15:21:12,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-03-17 15:21:12,295 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-03-17 15:21:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-03-17 15:21:12,296 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15 [2022-03-17 15:21:12,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:21:12,297 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-03-17 15:21:12,297 INFO L479 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-03-17 15:21:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-03-17 15:21:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-17 15:21:12,298 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:21:12,298 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:21:12,298 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-17 15:21:12,298 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:21:12,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:21:12,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1389121438, now seen corresponding path program 1 times [2022-03-17 15:21:12,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:21:12,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670242142] [2022-03-17 15:21:12,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:21:12,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:21:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:12,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:21:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:21:12,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:21:12,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670242142] [2022-03-17 15:21:12,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670242142] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:21:12,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:21:12,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-17 15:21:12,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651144855] [2022-03-17 15:21:12,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:21:12,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 15:21:12,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:21:12,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 15:21:12,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-17 15:21:12,556 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-03-17 15:21:12,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:21:12,666 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-03-17 15:21:12,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 15:21:12,666 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-03-17 15:21:12,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:21:12,667 INFO L225 Difference]: With dead ends: 27 [2022-03-17 15:21:12,667 INFO L226 Difference]: Without dead ends: 24 [2022-03-17 15:21:12,670 INFO L911 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-03-17 15:21:12,672 INFO L912 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.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:21:12,672 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 42 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 4 Unchecked, 0.1s Time] [2022-03-17 15:21:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-03-17 15:21:12,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-03-17 15:21:12,681 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-03-17 15:21:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-03-17 15:21:12,682 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 15 [2022-03-17 15:21:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:21:12,682 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-03-17 15:21:12,682 INFO L479 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-03-17 15:21:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-03-17 15:21:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-17 15:21:12,683 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:21:12,683 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:21:12,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-17 15:21:12,683 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:21:12,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:21:12,684 INFO L85 PathProgramCache]: Analyzing trace with hash 139812261, now seen corresponding path program 1 times [2022-03-17 15:21:12,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:21:12,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530643606] [2022-03-17 15:21:12,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:21:12,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:21:12,706 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:21:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:12,765 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:21:12,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:21:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:21:12,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:21:12,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530643606] [2022-03-17 15:21:12,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530643606] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:21:12,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212441826] [2022-03-17 15:21:12,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:21:12,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:21:12,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:21:12,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:21:12,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-17 15:21:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:12,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 15:21:12,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:21:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:21:13,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:21:13,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212441826] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:21:13,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:21:13,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-03-17 15:21:13,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471449202] [2022-03-17 15:21:13,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:21:13,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 15:21:13,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:21:13,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 15:21:13,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-03-17 15:21:13,255 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-03-17 15:21:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:21:13,286 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-03-17 15:21:13,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 15:21:13,287 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-03-17 15:21:13,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:21:13,288 INFO L225 Difference]: With dead ends: 26 [2022-03-17 15:21:13,288 INFO L226 Difference]: Without dead ends: 19 [2022-03-17 15:21:13,289 INFO L911 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-03-17 15:21:13,291 INFO L912 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-03-17 15:21:13,293 INFO L913 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-03-17 15:21:13,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-03-17 15:21:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-03-17 15:21:13,297 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-03-17 15:21:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-03-17 15:21:13,298 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 16 [2022-03-17 15:21:13,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:21:13,299 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-03-17 15:21:13,299 INFO L479 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-03-17 15:21:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-03-17 15:21:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-17 15:21:13,299 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:21:13,299 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:21:13,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-17 15:21:13,519 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:21:13,520 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:21:13,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:21:13,520 INFO L85 PathProgramCache]: Analyzing trace with hash -894405051, now seen corresponding path program 1 times [2022-03-17 15:21:13,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:21:13,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450294490] [2022-03-17 15:21:13,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:21:13,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:21:13,528 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:21:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:13,575 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-03-17 15:21:13,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:21:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:21:13,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:21:13,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450294490] [2022-03-17 15:21:13,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450294490] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:21:13,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130958296] [2022-03-17 15:21:13,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:21:13,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:21:13,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:21:13,715 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:21:13,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-17 15:21:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:13,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 15:21:13,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:21:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:21:13,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:21:13,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130958296] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:21:13,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:21:13,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-03-17 15:21:13,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428863220] [2022-03-17 15:21:13,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:21:13,918 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 15:21:13,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:21:13,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 15:21:13,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-03-17 15:21:13,920 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-03-17 15:21:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:21:13,952 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-03-17 15:21:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-17 15:21:13,952 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-03-17 15:21:13,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:21:13,954 INFO L225 Difference]: With dead ends: 25 [2022-03-17 15:21:13,954 INFO L226 Difference]: Without dead ends: 22 [2022-03-17 15:21:13,954 INFO L911 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-03-17 15:21:13,956 INFO L912 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-03-17 15:21:13,957 INFO L913 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-03-17 15:21:13,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-03-17 15:21:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-03-17 15:21:13,961 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-03-17 15:21:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-03-17 15:21:13,962 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 16 [2022-03-17 15:21:13,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:21:13,962 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-03-17 15:21:13,962 INFO L479 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-03-17 15:21:13,963 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-03-17 15:21:13,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-17 15:21:13,963 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:21:13,963 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:21:13,991 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-03-17 15:21:14,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-17 15:21:14,184 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:21:14,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:21:14,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1590526661, now seen corresponding path program 1 times [2022-03-17 15:21:14,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:21:14,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151940285] [2022-03-17 15:21:14,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:21:14,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:21:14,198 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-03-17 15:21:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:14,224 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-03-17 15:21:14,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:21:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:21:14,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:21:14,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151940285] [2022-03-17 15:21:14,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151940285] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:21:14,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068513403] [2022-03-17 15:21:14,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:21:14,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:21:14,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:21:14,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:21:14,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-17 15:21:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:14,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-17 15:21:14,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:21:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:21:18,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:21:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:21:24,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068513403] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:21:24,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:21:24,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-03-17 15:21:24,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470911244] [2022-03-17 15:21:24,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:21:24,183 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-17 15:21:24,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:21:24,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-17 15:21:24,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=212, Unknown=1, NotChecked=0, Total=272 [2022-03-17 15:21:24,184 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-03-17 15:21:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:21:24,385 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-03-17 15:21:24,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-17 15:21:24,386 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-03-17 15:21:24,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:21:24,387 INFO L225 Difference]: With dead ends: 31 [2022-03-17 15:21:24,388 INFO L226 Difference]: Without dead ends: 28 [2022-03-17 15:21:24,388 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=118, Invalid=387, Unknown=1, NotChecked=0, Total=506 [2022-03-17 15:21:24,389 INFO L912 BasicCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:21:24,389 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 52 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2022-03-17 15:21:24,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-03-17 15:21:24,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-03-17 15:21:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:21:24,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-03-17 15:21:24,392 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 16 [2022-03-17 15:21:24,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:21:24,393 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-03-17 15:21:24,393 INFO L479 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-03-17 15:21:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-03-17 15:21:24,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 15:21:24,393 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:21:24,393 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:21:24,423 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-03-17 15:21:24,604 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:21:24,605 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:21:24,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:21:24,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1930032162, now seen corresponding path program 1 times [2022-03-17 15:21:24,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:21:24,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513642526] [2022-03-17 15:21:24,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:21:24,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:21:24,612 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:21:24,613 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-03-17 15:21:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:24,635 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:21:24,642 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-03-17 15:21:24,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:21:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:21:24,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:21:24,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513642526] [2022-03-17 15:21:24,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513642526] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:21:24,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17361508] [2022-03-17 15:21:24,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:21:24,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:21:24,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:21:24,836 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:21:24,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-17 15:21:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:24,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-17 15:21:24,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:21:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:21:25,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:21:53,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:21:53,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17361508] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:21:53,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:21:53,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 19 [2022-03-17 15:21:53,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774050497] [2022-03-17 15:21:53,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:21:53,207 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-17 15:21:53,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:21:53,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-17 15:21:53,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=254, Unknown=8, NotChecked=0, Total=342 [2022-03-17 15:21:53,208 INFO L87 Difference]: Start difference. First operand 26 states and 35 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-03-17 15:21:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:21:57,989 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-03-17 15:21:57,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-17 15:21:57,990 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-03-17 15:21:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:21:57,991 INFO L225 Difference]: With dead ends: 35 [2022-03-17 15:21:57,991 INFO L226 Difference]: Without dead ends: 32 [2022-03-17 15:21:57,991 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=137, Invalid=453, Unknown=10, NotChecked=0, Total=600 [2022-03-17 15:21:57,992 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:21:57,992 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 54 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 57 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2022-03-17 15:21:57,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-17 15:21:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-03-17 15:21:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:21:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2022-03-17 15:21:57,995 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 17 [2022-03-17 15:21:57,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:21:57,995 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-03-17 15:21:57,996 INFO L479 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-03-17 15:21:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-03-17 15:21:57,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 15:21:57,996 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:21:57,996 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:21:58,027 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-03-17 15:21:58,207 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:21:58,208 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:21:58,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:21:58,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2088406878, now seen corresponding path program 1 times [2022-03-17 15:21:58,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:21:58,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809442562] [2022-03-17 15:21:58,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:21:58,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:21:58,216 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-03-17 15:21:58,217 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-03-17 15:21:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:58,241 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-03-17 15:21:58,257 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-03-17 15:21:58,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:21:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:21:58,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:21:58,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809442562] [2022-03-17 15:21:58,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809442562] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:21:58,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287000351] [2022-03-17 15:21:58,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:21:58,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:21:58,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:21:58,425 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:21:58,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-17 15:21:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:21:58,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-17 15:21:58,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:21:59,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:21:59,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:22:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:22:16,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287000351] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:22:16,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:22:16,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-03-17 15:22:16,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973320444] [2022-03-17 15:22:16,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:22:16,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-17 15:22:16,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:22:16,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-17 15:22:16,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=262, Unknown=3, NotChecked=0, Total=342 [2022-03-17 15:22:16,237 INFO L87 Difference]: Start difference. First operand 28 states and 38 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-03-17 15:22:16,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:22:16,738 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2022-03-17 15:22:16,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-17 15:22:16,738 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-03-17 15:22:16,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:22:16,739 INFO L225 Difference]: With dead ends: 42 [2022-03-17 15:22:16,739 INFO L226 Difference]: Without dead ends: 37 [2022-03-17 15:22:16,739 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=193, Invalid=674, Unknown=3, NotChecked=0, Total=870 [2022-03-17 15:22:16,740 INFO L912 BasicCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:22:16,740 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 65 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 51 Invalid, 0 Unknown, 71 Unchecked, 0.1s Time] [2022-03-17 15:22:16,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-03-17 15:22:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2022-03-17 15:22:16,743 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-03-17 15:22:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2022-03-17 15:22:16,744 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 17 [2022-03-17 15:22:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:22:16,744 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2022-03-17 15:22:16,744 INFO L479 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-03-17 15:22:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2022-03-17 15:22:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 15:22:16,745 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:22:16,745 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:22:16,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-17 15:22:16,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:22:16,948 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:22:16,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:22:16,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1433573341, now seen corresponding path program 1 times [2022-03-17 15:22:16,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:22:16,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662390278] [2022-03-17 15:22:16,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:22:16,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:22:16,953 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-03-17 15:22:16,954 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-03-17 15:22:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:22:16,969 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-03-17 15:22:16,975 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-03-17 15:22:17,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:22:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:22:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:22:17,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:22:17,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662390278] [2022-03-17 15:22:17,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662390278] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:22:17,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738600707] [2022-03-17 15:22:17,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:22:17,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:22:17,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:22:17,164 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:22:17,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-17 15:22:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:22:17,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-17 15:22:17,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:22:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:22:17,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:22:20,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:22:20,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738600707] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:22:20,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:22:20,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 19 [2022-03-17 15:22:20,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482741096] [2022-03-17 15:22:20,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:22:20,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-17 15:22:20,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:22:20,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-17 15:22:20,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=275, Unknown=1, NotChecked=0, Total=342 [2022-03-17 15:22:20,220 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-03-17 15:22:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:22:22,570 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-03-17 15:22:22,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-17 15:22:22,571 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-03-17 15:22:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:22:22,571 INFO L225 Difference]: With dead ends: 39 [2022-03-17 15:22:22,571 INFO L226 Difference]: Without dead ends: 36 [2022-03-17 15:22:22,572 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=153, Invalid=547, Unknown=2, NotChecked=0, Total=702 [2022-03-17 15:22:22,572 INFO L912 BasicCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:22:22,573 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 57 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2022-03-17 15:22:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-17 15:22:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-03-17 15:22:22,575 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-03-17 15:22:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2022-03-17 15:22:22,576 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 17 [2022-03-17 15:22:22,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:22:22,576 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2022-03-17 15:22:22,576 INFO L479 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-03-17 15:22:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2022-03-17 15:22:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 15:22:22,577 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:22:22,577 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:22:22,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-17 15:22:22,791 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:22:22,792 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:22:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:22:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1054189566, now seen corresponding path program 1 times [2022-03-17 15:22:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:22:22,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134425921] [2022-03-17 15:22:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:22:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:22:22,800 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-03-17 15:22:22,800 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-03-17 15:22:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:22:22,822 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-03-17 15:22:22,842 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-03-17 15:22:23,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:22:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:22:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:22:23,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:22:23,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134425921] [2022-03-17 15:22:23,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134425921] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:22:23,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928988372] [2022-03-17 15:22:23,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:22:23,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:22:23,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:22:23,059 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:22:23,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-17 15:22:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:22:23,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 15:22:23,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:22:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:22:23,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:22:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:22:26,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928988372] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:22:26,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:22:26,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-03-17 15:22:26,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347014833] [2022-03-17 15:22:26,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:22:26,139 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-17 15:22:26,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:22:26,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-17 15:22:26,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=194, Unknown=1, NotChecked=0, Total=240 [2022-03-17 15:22:26,140 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-03-17 15:22:30,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:22:30,793 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-03-17 15:22:30,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-17 15:22:30,793 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-03-17 15:22:30,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:22:30,794 INFO L225 Difference]: With dead ends: 40 [2022-03-17 15:22:30,794 INFO L226 Difference]: Without dead ends: 37 [2022-03-17 15:22:30,794 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=119, Invalid=430, Unknown=3, NotChecked=0, Total=552 [2022-03-17 15:22:30,795 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:22:30,795 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 68 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2022-03-17 15:22:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-03-17 15:22:30,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-03-17 15:22:30,798 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-03-17 15:22:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-03-17 15:22:30,798 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2022-03-17 15:22:30,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:22:30,799 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2022-03-17 15:22:30,799 INFO L479 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-03-17 15:22:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2022-03-17 15:22:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:22:30,799 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:22:30,800 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:22:30,816 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-03-17 15:22:31,003 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:22:31,004 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:22:31,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:22:31,004 INFO L85 PathProgramCache]: Analyzing trace with hash 325265765, now seen corresponding path program 2 times [2022-03-17 15:22:31,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:22:31,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727603629] [2022-03-17 15:22:31,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:22:31,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:22:31,008 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:22:31,010 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-03-17 15:22:31,010 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-03-17 15:22:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:22:31,030 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-03-17 15:22:31,034 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-03-17 15:22:31,037 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-03-17 15:22:31,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:22:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:22:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:22:31,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:22:31,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727603629] [2022-03-17 15:22:31,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727603629] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:22:31,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346259632] [2022-03-17 15:22:31,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:22:31,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:22:31,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:22:31,232 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:22:31,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-17 15:22:31,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:22:31,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:22:31,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-17 15:22:31,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:22:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:22:31,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:22:41,854 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse0) (forall ((v_main_~y~0_34 Int)) (or (let ((.cse1 (< 0 (mod (+ (* v_main_~y~0_34 4294967295) c_main_~x~0 c_main_~y~0) 4294967296)))) (and (or .cse1 (let ((.cse3 (* (div c_main_~n~0 4294967296) 4294967296)) (.cse2 (+ (* (div v_main_~y~0_34 4294967296) 4294967296) c_main_~n~0))) (and (< .cse2 (+ .cse3 v_main_~y~0_34 1)) (<= (+ .cse3 v_main_~y~0_34) .cse2)))) (or (and (forall ((aux_div_v_main_~y~0_33_31 Int) (aux_mod_v_main_~y~0_33_31 Int)) (or (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) (* v_main_~y~0_34 4294967295) c_main_~x~0 c_main_~y~0) 4294967296))))) (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~y~0_33_31) c_main_~n~0) (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 4294967296))) (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) (* v_main_~y~0_34 4294967295) c_main_~x~0 c_main_~y~0) 4294967296))))) (not (< v_main_~y~0_34 (+ aux_mod_v_main_~y~0_33_31 (* aux_div_v_main_~y~0_33_31 4294967296)))) (> 0 aux_mod_v_main_~y~0_33_31)))) (not .cse1)))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ v_it_4 c_main_~y~0 1) v_main_~y~0_34))) (not (< c_main_~y~0 v_main_~y~0_34))))) (or (let ((.cse5 (+ (* 4294967296 (div c_main_~y~0 4294967296)) c_main_~n~0)) (.cse4 (* (div c_main_~n~0 4294967296) 4294967296))) (and (<= (+ .cse4 c_main_~y~0) .cse5) (< .cse5 (+ .cse4 c_main_~y~0 1)))) .cse0))) is different from false [2022-03-17 15:22:54,091 WARN L232 SmtUtils]: Spent 8.67s 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-03-17 15:24:31,678 WARN L855 $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-03-17 15:25:00,955 WARN L232 SmtUtils]: Spent 16.30s 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-03-17 15:25:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-03-17 15:25:01,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346259632] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:25:01,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:25:01,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 11] total 20 [2022-03-17 15:25:01,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903262934] [2022-03-17 15:25:01,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:25:01,124 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-17 15:25:01,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:25:01,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-17 15:25:01,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=8, NotChecked=66, Total=380 [2022-03-17 15:25:01,125 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-03-17 15:25:09,383 WARN L232 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 149 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:25:09,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:25:09,541 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-03-17 15:25:09,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 15:25:09,542 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-03-17 15:25:09,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:25:09,542 INFO L225 Difference]: With dead ends: 45 [2022-03-17 15:25:09,542 INFO L226 Difference]: Without dead ends: 39 [2022-03-17 15:25:09,542 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 55.1s TimeCoverageRelationStatistics Valid=125, Invalid=380, Unknown=9, NotChecked=86, Total=600 [2022-03-17 15:25:09,543 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:25:09,543 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 62 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 92 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2022-03-17 15:25:09,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-03-17 15:25:09,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-03-17 15:25:09,546 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-03-17 15:25:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2022-03-17 15:25:09,546 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 18 [2022-03-17 15:25:09,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:25:09,546 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2022-03-17 15:25:09,546 INFO L479 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-03-17 15:25:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2022-03-17 15:25:09,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:25:09,547 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:25:09,547 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:25:09,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-17 15:25:09,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-17 15:25:09,752 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:25:09,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:25:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1481938624, now seen corresponding path program 1 times [2022-03-17 15:25:09,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:25:09,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110836988] [2022-03-17 15:25:09,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:09,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:25:09,756 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:09,758 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-03-17 15:25:09,766 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-03-17 15:25:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:09,798 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-03-17 15:25:09,803 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-03-17 15:25:09,818 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-03-17 15:25:09,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:25:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:25:09,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:25:09,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110836988] [2022-03-17 15:25:09,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110836988] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:25:09,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676240721] [2022-03-17 15:25:09,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:09,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:25:09,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:25:09,970 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:25:09,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process