/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-de51.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 04:03:37,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 04:03:37,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 04:03:37,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 04:03:37,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 04:03:37,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 04:03:37,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 04:03:37,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 04:03:37,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 04:03:37,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 04:03:37,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 04:03:37,647 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 04:03:37,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 04:03:37,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 04:03:37,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 04:03:37,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 04:03:37,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 04:03:37,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 04:03:37,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 04:03:37,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 04:03:37,667 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 04:03:37,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 04:03:37,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 04:03:37,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 04:03:37,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 04:03:37,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 04:03:37,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 04:03:37,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 04:03:37,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 04:03:37,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 04:03:37,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 04:03:37,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 04:03:37,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 04:03:37,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 04:03:37,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 04:03:37,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 04:03:37,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 04:03:37,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 04:03:37,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 04:03:37,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 04:03:37,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 04:03:37,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 04:03:37,690 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-20 04:03:37,701 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 04:03:37,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 04:03:37,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 04:03:37,704 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 04:03:37,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 04:03:37,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 04:03:37,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 04:03:37,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 04:03:37,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 04:03:37,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 04:03:37,706 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 04:03:37,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 04:03:37,706 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 04:03:37,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 04:03:37,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 04:03:37,706 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 04:03:37,706 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 04:03:37,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 04:03:37,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 04:03:37,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 04:03:37,707 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 04:03:37,708 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 04:03:37,708 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-20 04:03:37,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 04:03:37,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 04:03:37,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 04:03:37,969 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 04:03:37,969 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 04:03:37,970 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-03-20 04:03:38,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0d6441cf/7f6fd64b612e49d98efd761c627e5cb6/FLAG3c60d94f0 [2022-03-20 04:03:38,413 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 04:03:38,414 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-03-20 04:03:38,420 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0d6441cf/7f6fd64b612e49d98efd761c627e5cb6/FLAG3c60d94f0 [2022-03-20 04:03:38,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0d6441cf/7f6fd64b612e49d98efd761c627e5cb6 [2022-03-20 04:03:38,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 04:03:38,828 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 04:03:38,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 04:03:38,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 04:03:38,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 04:03:38,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:03:38" (1/1) ... [2022-03-20 04:03:38,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eaf8dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:03:38, skipping insertion in model container [2022-03-20 04:03:38,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:03:38" (1/1) ... [2022-03-20 04:03:38,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 04:03:38,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 04:03:39,008 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-de51.c[368,381] [2022-03-20 04:03:39,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 04:03:39,044 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 04:03:39,056 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-de51.c[368,381] [2022-03-20 04:03:39,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 04:03:39,073 INFO L208 MainTranslator]: Completed translation [2022-03-20 04:03:39,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:03:39 WrapperNode [2022-03-20 04:03:39,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 04:03:39,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 04:03:39,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 04:03:39,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 04:03:39,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:03:39" (1/1) ... [2022-03-20 04:03:39,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:03:39" (1/1) ... [2022-03-20 04:03:39,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:03:39" (1/1) ... [2022-03-20 04:03:39,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:03:39" (1/1) ... [2022-03-20 04:03:39,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:03:39" (1/1) ... [2022-03-20 04:03:39,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:03:39" (1/1) ... [2022-03-20 04:03:39,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:03:39" (1/1) ... [2022-03-20 04:03:39,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 04:03:39,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 04:03:39,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 04:03:39,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 04:03:39,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:03:39" (1/1) ... [2022-03-20 04:03:39,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 04:03:39,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:03:39,138 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-20 04:03:39,159 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-20 04:03:39,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 04:03:39,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 04:03:39,181 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 04:03:39,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 04:03:39,181 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 04:03:39,182 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 04:03:39,182 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 04:03:39,182 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 04:03:39,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 04:03:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-20 04:03:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 04:03:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 04:03:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 04:03:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 04:03:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 04:03:39,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 04:03:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 04:03:39,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 04:03:39,251 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 04:03:39,252 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 04:03:39,424 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 04:03:39,446 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 04:03:39,447 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-03-20 04:03:39,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:03:39 BoogieIcfgContainer [2022-03-20 04:03:39,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 04:03:39,449 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 04:03:39,449 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 04:03:39,462 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 04:03:39,465 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:03:39" (1/1) ... [2022-03-20 04:03:39,467 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-03-20 04:03:39,730 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-20 04:03:39,730 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-20 04:03:39,902 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-20 04:03:39,903 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (= v_main_~z~0_8 (+ v_main_~z~0_7 1)) (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_8} OutVars{main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_7, main_#t~post8=|v_main_#t~post8_1|, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] to Formula: (let ((.cse0 (mod v_main_~z~0_8 4294967296))) (or (and (= v_main_~x~0_9 v_main_~x~0_8) (<= .cse0 0) (= v_main_~z~0_8 v_main_~z~0_7) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (forall ((v_it_2 Int)) (or (< 0 (mod (+ v_main_~z~0_8 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~z~0_7 v_it_2 1) v_main_~z~0_8)) (not (<= 1 v_it_2)))) (= (+ v_main_~x~0_9 v_main_~z~0_8 (* (- 1) v_main_~z~0_7)) v_main_~x~0_8) (< 0 .cse0) (< v_main_~z~0_7 v_main_~z~0_8)))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_8, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_7, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] [2022-03-20 04:03:39,972 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-20 04:03:39,973 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-20 04:03:42,124 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-20 04:03:42,125 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-20 04:03:42,187 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-20 04:03:42,188 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_10 (+ v_main_~z~0_9 1)) (< 0 (mod v_main_~z~0_10 4294967296)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_10} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_9, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] to Formula: (let ((.cse0 (mod v_main_~z~0_10 4294967296))) (or (and (= v_main_~x~0_11 v_main_~x~0_10) (<= .cse0 0) (= |v_main_#t~post14_3| |v_main_#t~post14_1|) (= v_main_~z~0_10 v_main_~z~0_9) (= |v_main_#t~post13_3| |v_main_#t~post13_1|)) (and (= v_main_~x~0_10 (+ v_main_~x~0_11 v_main_~z~0_10 (* (- 1) v_main_~z~0_9))) (< 0 .cse0) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~z~0_9 v_it_5 1) v_main_~z~0_10)) (< 0 (mod (+ v_main_~z~0_10 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)))) (< v_main_~z~0_9 v_main_~z~0_10)))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_10, main_#t~post13=|v_main_#t~post13_3|, main_#t~post14=|v_main_#t~post14_3|} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_9, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] [2022-03-20 04:03:42,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 04:03:42 BasicIcfg [2022-03-20 04:03:42,192 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 04:03:42,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 04:03:42,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 04:03:42,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 04:03:42,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 04:03:38" (1/4) ... [2022-03-20 04:03:42,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43746534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:03:42, skipping insertion in model container [2022-03-20 04:03:42,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:03:39" (2/4) ... [2022-03-20 04:03:42,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43746534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:03:42, skipping insertion in model container [2022-03-20 04:03:42,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:03:39" (3/4) ... [2022-03-20 04:03:42,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43746534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 04:03:42, skipping insertion in model container [2022-03-20 04:03:42,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 04:03:42" (4/4) ... [2022-03-20 04:03:42,199 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de51.cJordan [2022-03-20 04:03:42,204 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-20 04:03:42,204 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 04:03:42,237 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 04:03:42,243 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-20 04:03:42,243 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 04:03:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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-20 04:03:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-20 04:03:42,260 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:03:42,261 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:03:42,261 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:03:42,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:03:42,266 INFO L85 PathProgramCache]: Analyzing trace with hash 702671213, now seen corresponding path program 1 times [2022-03-20 04:03:42,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:03:42,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241438075] [2022-03-20 04:03:42,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:42,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:03:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:42,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:03:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:42,472 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-20 04:03:42,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:03:42,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241438075] [2022-03-20 04:03:42,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241438075] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:03:42,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:03:42,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 04:03:42,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607721116] [2022-03-20 04:03:42,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:03:42,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 04:03:42,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:03:42,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 04:03:42,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 04:03:42,538 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-20 04:03:42,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:03:42,580 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-03-20 04:03:42,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 04:03:42,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 16 [2022-03-20 04:03:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:03:42,590 INFO L225 Difference]: With dead ends: 24 [2022-03-20 04:03:42,590 INFO L226 Difference]: Without dead ends: 17 [2022-03-20 04:03:42,593 INFO L912 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-20 04:03:42,597 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 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-20 04:03:42,598 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 04:03:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-03-20 04:03:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-03-20 04:03:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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-20 04:03:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-03-20 04:03:42,626 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-03-20 04:03:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:03:42,627 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-03-20 04:03:42,627 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-20 04:03:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-03-20 04:03:42,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-20 04:03:42,628 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:03:42,628 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:03:42,629 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 04:03:42,629 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:03:42,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:03:42,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1128942900, now seen corresponding path program 1 times [2022-03-20 04:03:42,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:03:42,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021708730] [2022-03-20 04:03:42,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:42,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:03:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:42,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:03:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:42,861 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-20 04:03:42,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:03:42,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021708730] [2022-03-20 04:03:42,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021708730] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:03:42,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:03:42,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 04:03:42,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684265758] [2022-03-20 04:03:42,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:03:42,866 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 04:03:42,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:03:42,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 04:03:42,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-20 04:03:42,868 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-20 04:03:42,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:03:42,981 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2022-03-20 04:03:42,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 04:03:42,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2022-03-20 04:03:42,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:03:42,983 INFO L225 Difference]: With dead ends: 29 [2022-03-20 04:03:42,983 INFO L226 Difference]: Without dead ends: 26 [2022-03-20 04:03:42,984 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-20 04:03:42,986 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:03:42,986 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 33 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 9 Unchecked, 0.1s Time] [2022-03-20 04:03:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-03-20 04:03:42,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-03-20 04:03:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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-20 04:03:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-03-20 04:03:43,000 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2022-03-20 04:03:43,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:03:43,000 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-03-20 04:03:43,000 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-20 04:03:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-03-20 04:03:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:03:43,001 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:03:43,001 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:03:43,001 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 04:03:43,001 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:03:43,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:03:43,002 INFO L85 PathProgramCache]: Analyzing trace with hash -610770875, now seen corresponding path program 1 times [2022-03-20 04:03:43,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:03:43,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615841994] [2022-03-20 04:03:43,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:43,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:03:43,029 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:03:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:43,074 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:03:43,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:03:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:43,172 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-20 04:03:43,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:03:43,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615841994] [2022-03-20 04:03:43,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615841994] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:03:43,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110230142] [2022-03-20 04:03:43,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:43,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:03:43,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:03:43,176 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-20 04:03:43,179 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-20 04:03:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:43,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-20 04:03:43,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:03:43,422 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-20 04:03:43,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:03:48,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:03:48,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110230142] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:03:48,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:03:48,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-03-20 04:03:48,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912056399] [2022-03-20 04:03:48,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:03:48,441 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 04:03:48,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:03:48,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 04:03:48,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=137, Unknown=2, NotChecked=0, Total=182 [2022-03-20 04:03:48,442 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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-20 04:03:48,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:03:48,599 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-03-20 04:03:48,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:03:48,600 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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-20 04:03:48,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:03:48,601 INFO L225 Difference]: With dead ends: 34 [2022-03-20 04:03:48,601 INFO L226 Difference]: Without dead ends: 31 [2022-03-20 04:03:48,602 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=82, Invalid=258, Unknown=2, NotChecked=0, Total=342 [2022-03-20 04:03:48,603 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:03:48,603 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 60 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 74 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2022-03-20 04:03:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-03-20 04:03:48,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-03-20 04:03:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 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-20 04:03:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-03-20 04:03:48,608 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 17 [2022-03-20 04:03:48,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:03:48,608 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-03-20 04:03:48,608 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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-20 04:03:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-03-20 04:03:48,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:03:48,609 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:03:48,610 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:03:48,635 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-20 04:03:48,810 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-20 04:03:48,811 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:03:48,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:03:48,811 INFO L85 PathProgramCache]: Analyzing trace with hash 162216202, now seen corresponding path program 1 times [2022-03-20 04:03:48,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:03:48,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927904284] [2022-03-20 04:03:48,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:48,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:03:48,818 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-20 04:03:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:48,839 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-20 04:03:48,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:03:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:48,968 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-20 04:03:48,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:03:48,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927904284] [2022-03-20 04:03:48,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927904284] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:03:48,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911605544] [2022-03-20 04:03:48,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:48,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:03:48,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:03:48,971 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-20 04:03:49,007 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-20 04:03:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:49,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-20 04:03:49,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:03:49,139 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-20 04:03:49,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:03:49,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911605544] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:03:49,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:03:49,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-03-20 04:03:49,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449670423] [2022-03-20 04:03:49,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:03:49,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 04:03:49,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:03:49,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 04:03:49,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-20 04:03:49,142 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-20 04:03:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:03:49,166 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-03-20 04:03:49,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 04:03:49,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-03-20 04:03:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:03:49,169 INFO L225 Difference]: With dead ends: 32 [2022-03-20 04:03:49,169 INFO L226 Difference]: Without dead ends: 29 [2022-03-20 04:03:49,169 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-03-20 04:03:49,172 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 53 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-20 04:03:49,174 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 53 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-03-20 04:03:49,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-03-20 04:03:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-03-20 04:03:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 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-20 04:03:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-03-20 04:03:49,183 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 17 [2022-03-20 04:03:49,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:03:49,187 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-03-20 04:03:49,187 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-20 04:03:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-03-20 04:03:49,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:03:49,191 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:03:49,191 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:03:49,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-20 04:03:49,392 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-20 04:03:49,392 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:03:49,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:03:49,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1833749398, now seen corresponding path program 1 times [2022-03-20 04:03:49,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:03:49,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724849346] [2022-03-20 04:03:49,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:49,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:03:49,400 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-20 04:03:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:49,418 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-20 04:03:49,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:03:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:49,522 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-20 04:03:49,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:03:49,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724849346] [2022-03-20 04:03:49,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724849346] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:03:49,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891485198] [2022-03-20 04:03:49,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:49,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:03:49,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:03:49,524 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-20 04:03:49,553 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-20 04:03:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:49,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 04:03:49,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:03:49,687 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-20 04:03:49,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:03:49,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891485198] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:03:49,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:03:49,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2022-03-20 04:03:49,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851652348] [2022-03-20 04:03:49,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:03:49,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 04:03:49,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:03:49,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 04:03:49,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-03-20 04:03:49,690 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-20 04:03:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:03:49,716 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2022-03-20 04:03:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 04:03:49,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 17 [2022-03-20 04:03:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:03:49,717 INFO L225 Difference]: With dead ends: 35 [2022-03-20 04:03:49,717 INFO L226 Difference]: Without dead ends: 32 [2022-03-20 04:03:49,717 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-03-20 04:03:49,718 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:03:49,718 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 71 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-03-20 04:03:49,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-20 04:03:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-03-20 04:03:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 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-20 04:03:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2022-03-20 04:03:49,721 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 17 [2022-03-20 04:03:49,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:03:49,721 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2022-03-20 04:03:49,721 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-20 04:03:49,721 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2022-03-20 04:03:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:03:49,722 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:03:49,722 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:03:49,750 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-20 04:03:49,939 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-20 04:03:49,940 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:03:49,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:03:49,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2110277654, now seen corresponding path program 1 times [2022-03-20 04:03:49,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:03:49,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520583492] [2022-03-20 04:03:49,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:49,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:03:49,946 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-20 04:03:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:49,968 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-20 04:03:50,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:03:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:50,107 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-20 04:03:50,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:03:50,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520583492] [2022-03-20 04:03:50,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520583492] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:03:50,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193918713] [2022-03-20 04:03:50,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:50,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:03:50,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:03:50,109 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-20 04:03:50,122 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-20 04:03:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:50,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-20 04:03:50,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:03:50,791 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-20 04:03:50,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:03:54,154 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-20 04:03:54,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193918713] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:03:54,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:03:54,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-03-20 04:03:54,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977319351] [2022-03-20 04:03:54,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:03:54,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-20 04:03:54,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:03:54,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-20 04:03:54,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=216, Unknown=1, NotChecked=0, Total=272 [2022-03-20 04:03:54,156 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 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-20 04:03:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:03:54,913 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2022-03-20 04:03:54,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 04:03:54,914 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 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-20 04:03:54,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:03:54,915 INFO L225 Difference]: With dead ends: 45 [2022-03-20 04:03:54,915 INFO L226 Difference]: Without dead ends: 42 [2022-03-20 04:03:54,915 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=115, Invalid=390, Unknown=1, NotChecked=0, Total=506 [2022-03-20 04:03:54,916 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:03:54,916 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 53 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 28 Unchecked, 0.1s Time] [2022-03-20 04:03:54,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-03-20 04:03:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2022-03-20 04:03:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 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-20 04:03:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2022-03-20 04:03:54,919 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 17 [2022-03-20 04:03:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:03:54,919 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2022-03-20 04:03:54,920 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 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-20 04:03:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2022-03-20 04:03:54,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:03:54,920 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:03:54,920 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:03:54,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-20 04:03:55,121 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-20 04:03:55,121 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:03:55,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:03:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1727307284, now seen corresponding path program 2 times [2022-03-20 04:03:55,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:03:55,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101549295] [2022-03-20 04:03:55,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:55,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:03:55,128 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:03:55,129 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_11 .cse0 (* (- 4294967296) (div (+ main_~z~0_11 .cse0) 4294967296)))) 0)) [2022-03-20 04:03:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:55,154 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:03:55,156 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_11 .cse0 (* (- 4294967296) (div (+ main_~z~0_11 .cse0) 4294967296)))) 0)) [2022-03-20 04:03:55,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:03:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:03:55,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:03:55,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101549295] [2022-03-20 04:03:55,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101549295] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:03:55,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165253119] [2022-03-20 04:03:55,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 04:03:55,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:03:55,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:03:55,222 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-20 04:03:55,222 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-20 04:03:55,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 04:03:55,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:03:55,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:03:55,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:03:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:03:55,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:04:03,552 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_23_31 Int)) (or (> 0 aux_mod_v_main_~x~0_23_31) (= aux_mod_v_main_~x~0_23_31 (mod c_main_~n~0 4294967296)) (>= aux_mod_v_main_~x~0_23_31 4294967296) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~x~0_23_31 Int)) (not (= (+ aux_mod_v_main_~x~0_23_31 (* aux_div_v_main_~x~0_23_31 4294967296)) c_main_~x~0)))) (or (forall ((v_main_~x~0_24 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_24) (<= 1 v_it_5))) (let ((.cse1 (< 0 (mod (+ (* v_main_~x~0_24 4294967295) c_main_~x~0 c_main_~z~0) 4294967296)))) (and (or (not .cse1) (forall ((aux_div_v_main_~x~0_23_31 Int)) (or (not (< v_main_~x~0_24 (+ aux_mod_v_main_~x~0_23_31 (* aux_div_v_main_~x~0_23_31 4294967296)))) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) (* v_main_~x~0_24 4294967295) c_main_~x~0 c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_main_~x~0_24 v_it_5 1) (+ aux_mod_v_main_~x~0_23_31 (* aux_div_v_main_~x~0_23_31 4294967296)))))))) (or (forall ((aux_div_v_main_~x~0_23_31 Int)) (not (= (+ aux_mod_v_main_~x~0_23_31 (* aux_div_v_main_~x~0_23_31 4294967296)) v_main_~x~0_24))) .cse1))) (not (< c_main_~x~0 v_main_~x~0_24)))) (not .cse0)))))) is different from false [2022-03-20 04:04:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-20 04:04:08,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165253119] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:04:08,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:04:08,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2022-03-20 04:04:08,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281292875] [2022-03-20 04:04:08,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:04:08,014 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-20 04:04:08,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:04:08,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-20 04:04:08,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=4, NotChecked=26, Total=240 [2022-03-20 04:04:08,015 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 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-20 04:04:08,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:04:08,182 INFO L93 Difference]: Finished difference Result 44 states and 66 transitions. [2022-03-20 04:04:08,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 04:04:08,183 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 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 18 [2022-03-20 04:04:08,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:04:08,184 INFO L225 Difference]: With dead ends: 44 [2022-03-20 04:04:08,184 INFO L226 Difference]: Without dead ends: 38 [2022-03-20 04:04:08,184 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=4, NotChecked=40, Total=506 [2022-03-20 04:04:08,185 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:04:08,185 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 61 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-03-20 04:04:08,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-03-20 04:04:08,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-03-20 04:04:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 27 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-20 04:04:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2022-03-20 04:04:08,187 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 18 [2022-03-20 04:04:08,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:04:08,187 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2022-03-20 04:04:08,188 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 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-20 04:04:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2022-03-20 04:04:08,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:04:08,188 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:04:08,188 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:04:08,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-20 04:04:08,391 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-20 04:04:08,392 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:04:08,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:04:08,392 INFO L85 PathProgramCache]: Analyzing trace with hash 760455623, now seen corresponding path program 1 times [2022-03-20 04:04:08,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:04:08,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128404219] [2022-03-20 04:04:08,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:04:08,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:04:08,398 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-20 04:04:08,399 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:04:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:04:08,411 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:04:08,413 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:04:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:04:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:04:08,534 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-20 04:04:08,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:04:08,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128404219] [2022-03-20 04:04:08,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128404219] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:04:08,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951756463] [2022-03-20 04:04:08,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:04:08,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:04:08,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:04:08,540 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-20 04:04:08,541 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-20 04:04:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:04:08,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-20 04:04:08,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:04:08,802 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-20 04:04:08,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:04:58,835 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-20 04:04:58,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951756463] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:04:58,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:04:58,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 10] total 18 [2022-03-20 04:04:58,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158538247] [2022-03-20 04:04:58,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:04:58,836 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 04:04:58,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:04:58,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 04:04:58,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=228, Unknown=15, NotChecked=0, Total=306 [2022-03-20 04:04:58,837 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 15 states have internal predecessors, (30), 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-20 04:05:01,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:05:01,209 INFO L93 Difference]: Finished difference Result 44 states and 66 transitions. [2022-03-20 04:05:01,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 04:05:01,209 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 15 states have internal predecessors, (30), 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 18 [2022-03-20 04:05:01,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:05:01,210 INFO L225 Difference]: With dead ends: 44 [2022-03-20 04:05:01,210 INFO L226 Difference]: Without dead ends: 41 [2022-03-20 04:05:01,211 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 38.7s TimeCoverageRelationStatistics Valid=109, Invalid=381, Unknown=16, NotChecked=0, Total=506 [2022-03-20 04:05:01,211 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 30 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:05:01,211 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 77 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 62 Invalid, 0 Unknown, 68 Unchecked, 0.1s Time] [2022-03-20 04:05:01,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-20 04:05:01,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-03-20 04:05:01,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 29 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-20 04:05:01,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2022-03-20 04:05:01,215 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2022-03-20 04:05:01,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:05:01,215 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2022-03-20 04:05:01,215 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 15 states have internal predecessors, (30), 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-20 04:05:01,215 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2022-03-20 04:05:01,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:05:01,216 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:05:01,216 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:05:01,236 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-20 04:05:01,427 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-20 04:05:01,428 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:05:01,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:05:01,428 INFO L85 PathProgramCache]: Analyzing trace with hash 571694412, now seen corresponding path program 1 times [2022-03-20 04:05:01,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:05:01,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790485016] [2022-03-20 04:05:01,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:01,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:05:01,440 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:05:01,445 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:05:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:01,471 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.2))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:05:01,474 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:05:01,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:05:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:01,750 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-20 04:05:01,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:05:01,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790485016] [2022-03-20 04:05:01,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790485016] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:05:01,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531828765] [2022-03-20 04:05:01,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:01,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:05:01,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:05:01,752 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-20 04:05:01,753 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-20 04:05:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:01,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-20 04:05:01,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:05:01,999 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-20 04:05:01,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:05:50,300 WARN L232 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:05:56,606 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-20 04:05:56,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531828765] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:05:56,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:05:56,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2022-03-20 04:05:56,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67383553] [2022-03-20 04:05:56,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:05:56,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-20 04:05:56,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:05:56,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-20 04:05:56,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=198, Unknown=16, NotChecked=0, Total=272 [2022-03-20 04:05:56,608 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 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-20 04:06:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:06:03,076 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-03-20 04:06:03,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 04:06:03,076 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 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 18 [2022-03-20 04:06:03,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:06:03,077 INFO L225 Difference]: With dead ends: 46 [2022-03-20 04:06:03,077 INFO L226 Difference]: Without dead ends: 43 [2022-03-20 04:06:03,077 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 54.7s TimeCoverageRelationStatistics Valid=114, Invalid=373, Unknown=19, NotChecked=0, Total=506 [2022-03-20 04:06:03,078 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 04:06:03,078 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 70 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 87 Invalid, 0 Unknown, 54 Unchecked, 0.2s Time] [2022-03-20 04:06:03,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-20 04:06:03,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2022-03-20 04:06:03,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 31 states have internal predecessors, (50), 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-20 04:06:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 54 transitions. [2022-03-20 04:06:03,082 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 54 transitions. Word has length 18 [2022-03-20 04:06:03,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:06:03,082 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 54 transitions. [2022-03-20 04:06:03,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 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-20 04:06:03,082 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 54 transitions. [2022-03-20 04:06:03,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:06:03,083 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:03,083 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:03,102 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-20 04:06:03,291 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-20 04:06:03,292 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:03,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:03,292 INFO L85 PathProgramCache]: Analyzing trace with hash -984935833, now seen corresponding path program 1 times [2022-03-20 04:06:03,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:03,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982901726] [2022-03-20 04:06:03,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:03,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:03,297 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-20 04:06:03,298 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:03,311 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.2))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:03,317 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:03,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:03,586 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-20 04:06:03,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:03,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982901726] [2022-03-20 04:06:03,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982901726] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:06:03,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783167161] [2022-03-20 04:06:03,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:03,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:06:03,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:06:03,588 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-20 04:06:03,595 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-20 04:06:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:03,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:06:03,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:06:04,073 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-20 04:06:04,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:06:21,990 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-20 04:06:21,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783167161] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:06:21,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:06:21,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 17 [2022-03-20 04:06:21,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654290576] [2022-03-20 04:06:21,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:06:21,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-20 04:06:21,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:06:21,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-20 04:06:21,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=211, Unknown=6, NotChecked=0, Total=272 [2022-03-20 04:06:21,992 INFO L87 Difference]: Start difference. First operand 36 states and 54 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 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-20 04:06:22,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:06:22,465 INFO L93 Difference]: Finished difference Result 47 states and 71 transitions. [2022-03-20 04:06:22,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 04:06:22,466 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 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-20 04:06:22,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:06:22,466 INFO L225 Difference]: With dead ends: 47 [2022-03-20 04:06:22,466 INFO L226 Difference]: Without dead ends: 44 [2022-03-20 04:06:22,467 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=130, Invalid=464, Unknown=6, NotChecked=0, Total=600 [2022-03-20 04:06:22,467 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:06:22,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 73 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 76 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2022-03-20 04:06:22,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-20 04:06:22,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2022-03-20 04:06:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:06:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 58 transitions. [2022-03-20 04:06:22,471 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 58 transitions. Word has length 18 [2022-03-20 04:06:22,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:06:22,471 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 58 transitions. [2022-03-20 04:06:22,471 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 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-20 04:06:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. [2022-03-20 04:06:22,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:06:22,472 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:22,472 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:22,496 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-20 04:06:22,686 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-20 04:06:22,686 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:22,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:22,687 INFO L85 PathProgramCache]: Analyzing trace with hash -211948756, now seen corresponding path program 1 times [2022-03-20 04:06:22,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:22,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419279575] [2022-03-20 04:06:22,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:22,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:22,691 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-20 04:06:22,693 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-20 04:06:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:22,711 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.2))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:22,714 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-03-20 04:06:22,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:22,899 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-20 04:06:22,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:22,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419279575] [2022-03-20 04:06:22,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419279575] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:06:22,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143885304] [2022-03-20 04:06:22,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:22,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:06:22,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:06:22,901 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-20 04:06:22,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-20 04:06:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:22,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 04:06:22,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:06:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:06:23,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:06:23,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143885304] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:06:23,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:06:23,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 13 [2022-03-20 04:06:23,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103948493] [2022-03-20 04:06:23,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:06:23,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 04:06:23,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:06:23,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 04:06:23,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-03-20 04:06:23,150 INFO L87 Difference]: Start difference. First operand 38 states and 58 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-20 04:06:23,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:06:23,203 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2022-03-20 04:06:23,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 04:06:23,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2022-03-20 04:06:23,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:06:23,204 INFO L225 Difference]: With dead ends: 48 [2022-03-20 04:06:23,204 INFO L226 Difference]: Without dead ends: 45 [2022-03-20 04:06:23,204 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-03-20 04:06:23,205 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:06:23,205 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 84 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-03-20 04:06:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-20 04:06:23,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2022-03-20 04:06:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.6) internal successors, (48), 30 states have internal predecessors, (48), 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-20 04:06:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2022-03-20 04:06:23,208 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 18 [2022-03-20 04:06:23,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:06:23,208 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2022-03-20 04:06:23,208 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-20 04:06:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2022-03-20 04:06:23,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:06:23,209 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:23,209 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:23,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-20 04:06:23,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:06:23,416 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:23,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:23,416 INFO L85 PathProgramCache]: Analyzing trace with hash -967377177, now seen corresponding path program 1 times [2022-03-20 04:06:23,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:23,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415103903] [2022-03-20 04:06:23,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:23,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:23,420 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-20 04:06:23,421 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:23,446 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-20 04:06:23,456 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.4))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:23,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:23,777 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-20 04:06:23,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:23,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415103903] [2022-03-20 04:06:23,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415103903] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:06:23,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319464691] [2022-03-20 04:06:23,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:23,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:06:23,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:06:23,780 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:06:23,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-20 04:06:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:23,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-20 04:06:23,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:06:24,922 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-20 04:06:24,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:07:27,341 WARN L232 SmtUtils]: Spent 39.47s on a formula simplification. DAG size of input: 57 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:07:34,059 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-20 04:07:34,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319464691] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:07:34,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:07:34,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2022-03-20 04:07:34,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426554493] [2022-03-20 04:07:34,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:07:34,060 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-20 04:07:34,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:07:34,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-20 04:07:34,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=358, Unknown=10, NotChecked=0, Total=462 [2022-03-20 04:07:34,060 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 19 states have internal predecessors, (34), 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-20 04:09:29,203 WARN L232 SmtUtils]: Spent 1.41m on a formula simplification. DAG size of input: 78 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:09:34,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:09:34,060 INFO L93 Difference]: Finished difference Result 54 states and 82 transitions. [2022-03-20 04:09:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-20 04:09:34,061 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 19 states have internal predecessors, (34), 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-20 04:09:34,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:09:34,061 INFO L225 Difference]: With dead ends: 54 [2022-03-20 04:09:34,061 INFO L226 Difference]: Without dead ends: 47 [2022-03-20 04:09:34,062 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 186.5s TimeCoverageRelationStatistics Valid=241, Invalid=856, Unknown=25, NotChecked=0, Total=1122 [2022-03-20 04:09:34,062 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 71 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 04:09:34,062 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 44 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 87 Invalid, 0 Unknown, 56 Unchecked, 0.2s Time] [2022-03-20 04:09:34,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-03-20 04:09:34,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-03-20 04:09:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.6) internal successors, (56), 35 states have internal predecessors, (56), 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-20 04:09:34,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2022-03-20 04:09:34,065 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 60 transitions. Word has length 18 [2022-03-20 04:09:34,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:09:34,066 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 60 transitions. [2022-03-20 04:09:34,066 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 19 states have internal predecessors, (34), 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-20 04:09:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 60 transitions. [2022-03-20 04:09:34,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:09:34,067 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:09:34,067 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:09:34,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-20 04:09:34,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-20 04:09:34,279 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:09:34,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:09:34,280 INFO L85 PathProgramCache]: Analyzing trace with hash -194390100, now seen corresponding path program 1 times [2022-03-20 04:09:34,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:09:34,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197878598] [2022-03-20 04:09:34,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:09:34,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:09:34,285 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-20 04:09:34,286 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-20 04:09:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:34,297 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-20 04:09:34,306 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-20 04:09:34,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:09:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:34,563 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-20 04:09:34,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:09:34,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197878598] [2022-03-20 04:09:34,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197878598] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:09:34,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629230208] [2022-03-20 04:09:34,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:09:34,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:09:34,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:09:34,568 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:09:34,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-20 04:09:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:34,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-20 04:09:34,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:09:35,454 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-20 04:09:35,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:09:38,658 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-20 04:09:38,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629230208] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:09:38,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:09:38,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 19 [2022-03-20 04:09:38,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151957935] [2022-03-20 04:09:38,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:09:38,659 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-20 04:09:38,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:09:38,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-20 04:09:38,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-03-20 04:09:38,660 INFO L87 Difference]: Start difference. First operand 40 states and 60 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-20 04:09:39,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:09:39,510 INFO L93 Difference]: Finished difference Result 59 states and 90 transitions. [2022-03-20 04:09:39,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 04:09:39,510 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 18 [2022-03-20 04:09:39,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:09:39,511 INFO L225 Difference]: With dead ends: 59 [2022-03-20 04:09:39,511 INFO L226 Difference]: Without dead ends: 55 [2022-03-20 04:09:39,511 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2022-03-20 04:09:39,513 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 04:09:39,513 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 71 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 99 Invalid, 0 Unknown, 39 Unchecked, 0.2s Time] [2022-03-20 04:09:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-03-20 04:09:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2022-03-20 04:09:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 37 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:09:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2022-03-20 04:09:39,518 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 64 transitions. Word has length 18 [2022-03-20 04:09:39,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:09:39,518 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 64 transitions. [2022-03-20 04:09:39,518 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-20 04:09:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 64 transitions. [2022-03-20 04:09:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:09:39,519 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:09:39,519 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:09:39,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-20 04:09:39,723 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-20 04:09:39,724 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:09:39,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:09:39,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2001594489, now seen corresponding path program 1 times [2022-03-20 04:09:39,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:09:39,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476326459] [2022-03-20 04:09:39,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:09:39,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:09:39,728 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-20 04:09:39,729 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-20 04:09:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:39,745 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-20 04:09:39,752 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-20 04:09:40,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:09:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:40,115 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-20 04:09:40,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:09:40,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476326459] [2022-03-20 04:09:40,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476326459] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:09:40,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868532615] [2022-03-20 04:09:40,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:09:40,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:09:40,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:09:40,116 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:09:40,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-20 04:09:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:40,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-20 04:09:40,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:09:43,192 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-20 04:09:43,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:09:47,638 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-20 04:09:47,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868532615] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:09:47,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:09:47,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-03-20 04:09:47,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517396295] [2022-03-20 04:09:47,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:09:47,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 04:09:47,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:09:47,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 04:09:47,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=240, Unknown=2, NotChecked=0, Total=306 [2022-03-20 04:09:47,640 INFO L87 Difference]: Start difference. First operand 42 states and 64 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 15 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-20 04:09:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:09:49,806 INFO L93 Difference]: Finished difference Result 63 states and 98 transitions. [2022-03-20 04:09:49,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-20 04:09:49,806 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 15 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-20 04:09:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:09:49,807 INFO L225 Difference]: With dead ends: 63 [2022-03-20 04:09:49,807 INFO L226 Difference]: Without dead ends: 59 [2022-03-20 04:09:49,807 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=175, Invalid=579, Unknown=2, NotChecked=0, Total=756 [2022-03-20 04:09:49,808 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 59 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 04:09:49,808 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 68 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 95 Invalid, 0 Unknown, 75 Unchecked, 0.2s Time] [2022-03-20 04:09:49,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-20 04:09:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2022-03-20 04:09:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.631578947368421) internal successors, (62), 38 states have internal predecessors, (62), 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-20 04:09:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 66 transitions. [2022-03-20 04:09:49,811 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 66 transitions. Word has length 18 [2022-03-20 04:09:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:09:49,811 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 66 transitions. [2022-03-20 04:09:49,812 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 15 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-20 04:09:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2022-03-20 04:09:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:09:49,812 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:09:49,812 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:09:49,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-20 04:09:50,027 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-20 04:09:50,028 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:09:50,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:09:50,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2104611596, now seen corresponding path program 1 times [2022-03-20 04:09:50,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:09:50,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603004206] [2022-03-20 04:09:50,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:09:50,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:09:50,031 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-20 04:09:50,034 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-20 04:09:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:50,049 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-20 04:09:50,055 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-20 04:09:50,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:09:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:50,547 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-20 04:09:50,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:09:50,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603004206] [2022-03-20 04:09:50,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603004206] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:09:50,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514367113] [2022-03-20 04:09:50,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:09:50,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:09:50,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:09:50,549 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:09:50,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-20 04:09:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:50,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-20 04:09:50,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:09:52,616 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-20 04:09:52,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-20 04:09:52,817 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-20 04:09:52,817 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: not dual finite connective at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:374) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:635) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-20 04:09:52,821 INFO L158 Benchmark]: Toolchain (without parser) took 373992.86ms. Allocated memory was 203.4MB in the beginning and 262.1MB in the end (delta: 58.7MB). Free memory was 152.1MB in the beginning and 126.1MB in the end (delta: 26.0MB). Peak memory consumption was 85.2MB. Max. memory is 8.0GB. [2022-03-20 04:09:52,821 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 203.4MB. Free memory is still 168.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 04:09:52,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.67ms. Allocated memory is still 203.4MB. Free memory was 151.9MB in the beginning and 179.5MB in the end (delta: -27.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-20 04:09:52,821 INFO L158 Benchmark]: Boogie Preprocessor took 26.12ms. Allocated memory is still 203.4MB. Free memory was 179.5MB in the beginning and 177.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-20 04:09:52,822 INFO L158 Benchmark]: RCFGBuilder took 347.22ms. Allocated memory is still 203.4MB. Free memory was 177.9MB in the beginning and 167.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-20 04:09:52,822 INFO L158 Benchmark]: IcfgTransformer took 2742.66ms. Allocated memory is still 203.4MB. Free memory was 167.4MB in the beginning and 140.5MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-03-20 04:09:52,822 INFO L158 Benchmark]: TraceAbstraction took 370627.09ms. Allocated memory was 203.4MB in the beginning and 262.1MB in the end (delta: 58.7MB). Free memory was 139.9MB in the beginning and 126.1MB in the end (delta: 13.8MB). Peak memory consumption was 72.8MB. Max. memory is 8.0GB. [2022-03-20 04:09:52,823 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 203.4MB. Free memory is still 168.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.67ms. Allocated memory is still 203.4MB. Free memory was 151.9MB in the beginning and 179.5MB in the end (delta: -27.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.12ms. Allocated memory is still 203.4MB. Free memory was 179.5MB in the beginning and 177.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 347.22ms. Allocated memory is still 203.4MB. Free memory was 177.9MB in the beginning and 167.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 2742.66ms. Allocated memory is still 203.4MB. Free memory was 167.4MB in the beginning and 140.5MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 370627.09ms. Allocated memory was 203.4MB in the beginning and 262.1MB in the end (delta: 58.7MB). Free memory was 139.9MB in the beginning and 126.1MB in the end (delta: 13.8MB). Peak memory consumption was 72.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: not dual finite connective de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: not dual finite connective: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:374) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-20 04:09:53,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...