/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-6c470ae [2022-02-14 21:15:52,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-14 21:15:52,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-14 21:15:52,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-14 21:15:52,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-14 21:15:52,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-14 21:15:52,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-14 21:15:52,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-14 21:15:52,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-14 21:15:52,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-14 21:15:52,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-14 21:15:52,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-14 21:15:52,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-14 21:15:52,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-14 21:15:52,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-14 21:15:52,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-14 21:15:52,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-14 21:15:52,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-14 21:15:52,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-14 21:15:52,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-14 21:15:52,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-14 21:15:52,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-14 21:15:52,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-14 21:15:52,497 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-14 21:15:52,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-14 21:15:52,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-14 21:15:52,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-14 21:15:52,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-14 21:15:52,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-14 21:15:52,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-14 21:15:52,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-14 21:15:52,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-14 21:15:52,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-14 21:15:52,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-14 21:15:52,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-14 21:15:52,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-14 21:15:52,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-14 21:15:52,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-14 21:15:52,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-14 21:15:52,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-14 21:15:52,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-14 21:15:52,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-14 21:15:52,511 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-14 21:15:52,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-14 21:15:52,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-14 21:15:52,512 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-14 21:15:52,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-14 21:15:52,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-14 21:15:52,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-14 21:15:52,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-14 21:15:52,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-14 21:15:52,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-14 21:15:52,513 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-14 21:15:52,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-14 21:15:52,513 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-14 21:15:52,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-14 21:15:52,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-14 21:15:52,514 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-14 21:15:52,514 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-14 21:15:52,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-14 21:15:52,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:15:52,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-14 21:15:52,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-14 21:15:52,515 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-14 21:15:52,515 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-02-14 21:15:52,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-14 21:15:52,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-14 21:15:52,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-14 21:15:52,717 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-14 21:15:52,718 INFO L275 PluginConnector]: CDTParser initialized [2022-02-14 21:15:52,718 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-02-14 21:15:52,792 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64eb3e747/6b5bc433a4d74f94bc8e5b9800deea64/FLAGadd07f193 [2022-02-14 21:15:53,142 INFO L306 CDTParser]: Found 1 translation units. [2022-02-14 21:15:53,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-02-14 21:15:53,147 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64eb3e747/6b5bc433a4d74f94bc8e5b9800deea64/FLAGadd07f193 [2022-02-14 21:15:53,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64eb3e747/6b5bc433a4d74f94bc8e5b9800deea64 [2022-02-14 21:15:53,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-14 21:15:53,158 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-14 21:15:53,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-14 21:15:53,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-14 21:15:53,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-14 21:15:53,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:15:53" (1/1) ... [2022-02-14 21:15:53,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e222d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:15:53, skipping insertion in model container [2022-02-14 21:15:53,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:15:53" (1/1) ... [2022-02-14 21:15:53,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-14 21:15:53,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-14 21:15:53,299 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-02-14 21:15:53,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:15:53,314 INFO L203 MainTranslator]: Completed pre-run [2022-02-14 21:15:53,321 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-02-14 21:15:53,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:15:53,335 INFO L208 MainTranslator]: Completed translation [2022-02-14 21:15:53,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:15:53 WrapperNode [2022-02-14 21:15:53,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-14 21:15:53,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-14 21:15:53,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-14 21:15:53,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-14 21:15:53,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:15:53" (1/1) ... [2022-02-14 21:15:53,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:15:53" (1/1) ... [2022-02-14 21:15:53,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:15:53" (1/1) ... [2022-02-14 21:15:53,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:15:53" (1/1) ... [2022-02-14 21:15:53,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:15:53" (1/1) ... [2022-02-14 21:15:53,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:15:53" (1/1) ... [2022-02-14 21:15:53,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:15:53" (1/1) ... [2022-02-14 21:15:53,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-14 21:15:53,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-14 21:15:53,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-14 21:15:53,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-14 21:15:53,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:15:53" (1/1) ... [2022-02-14 21:15:53,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:15:53,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:15:53,379 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-02-14 21:15:53,383 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-02-14 21:15:53,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-14 21:15:53,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-14 21:15:53,414 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-14 21:15:53,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-14 21:15:53,414 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-14 21:15:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-14 21:15:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-14 21:15:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-14 21:15:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-14 21:15:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-02-14 21:15:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-14 21:15:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-14 21:15:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-14 21:15:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-14 21:15:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-14 21:15:53,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-14 21:15:53,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-14 21:15:53,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-14 21:15:53,461 INFO L234 CfgBuilder]: Building ICFG [2022-02-14 21:15:53,462 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-14 21:15:53,581 INFO L275 CfgBuilder]: Performing block encoding [2022-02-14 21:15:53,585 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-14 21:15:53,585 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-14 21:15:53,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:15:53 BoogieIcfgContainer [2022-02-14 21:15:53,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-14 21:15:53,587 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-14 21:15:53,588 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-14 21:15:53,589 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-14 21:15:53,591 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:15:53" (1/1) ... [2022-02-14 21:15:53,750 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-02-14 21:15:53,751 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-02-14 21:15:53,925 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-02-14 21:15:53,925 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-02-14 21:15:53,992 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-02-14 21:15:53,992 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-02-14 21:15:56,083 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-02-14 21:15:56,083 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-02-14 21:15:56,153 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-02-14 21:15:56,153 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-02-14 21:15:56,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:15:56 BasicIcfg [2022-02-14 21:15:56,156 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-14 21:15:56,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-14 21:15:56,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-14 21:15:56,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-14 21:15:56,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 09:15:53" (1/4) ... [2022-02-14 21:15:56,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d9b839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:15:56, skipping insertion in model container [2022-02-14 21:15:56,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:15:53" (2/4) ... [2022-02-14 21:15:56,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d9b839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:15:56, skipping insertion in model container [2022-02-14 21:15:56,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:15:53" (3/4) ... [2022-02-14 21:15:56,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d9b839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 09:15:56, skipping insertion in model container [2022-02-14 21:15:56,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:15:56" (4/4) ... [2022-02-14 21:15:56,162 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de51.cJordan [2022-02-14 21:15:56,166 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-14 21:15:56,166 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-14 21:15:56,192 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-14 21:15:56,197 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-14 21:15:56,197 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-14 21:15:56,207 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-02-14 21:15:56,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-14 21:15:56,214 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:15:56,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:15:56,216 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:15:56,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:15:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash 702671213, now seen corresponding path program 1 times [2022-02-14 21:15:56,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:15:56,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116870275] [2022-02-14 21:15:56,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:15:56,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:15:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:15:56,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:15:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:15:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:15:56,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:15:56,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116870275] [2022-02-14 21:15:56,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116870275] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:15:56,346 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:15:56,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-14 21:15:56,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566975236] [2022-02-14 21:15:56,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:15:56,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-14 21:15:56,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:15:56,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-14 21:15:56,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-14 21:15:56,385 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-02-14 21:15:56,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:15:56,410 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-14 21:15:56,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-14 21:15:56,417 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-02-14 21:15:56,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:15:56,430 INFO L225 Difference]: With dead ends: 24 [2022-02-14 21:15:56,430 INFO L226 Difference]: Without dead ends: 17 [2022-02-14 21:15:56,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-14 21:15:56,433 INFO L933 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-02-14 21:15:56,434 INFO L934 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-02-14 21:15:56,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-14 21:15:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-14 21:15:56,455 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-02-14 21:15:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-02-14 21:15:56,456 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-02-14 21:15:56,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:15:56,457 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-02-14 21:15:56,457 INFO L471 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-02-14 21:15:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-02-14 21:15:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-14 21:15:56,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:15:56,458 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:15:56,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-14 21:15:56,458 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:15:56,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:15:56,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1128942900, now seen corresponding path program 1 times [2022-02-14 21:15:56,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:15:56,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540949113] [2022-02-14 21:15:56,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:15:56,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:15:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:15:56,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:15:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:15:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:15:56,623 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:15:56,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540949113] [2022-02-14 21:15:56,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540949113] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:15:56,623 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:15:56,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 21:15:56,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266580942] [2022-02-14 21:15:56,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:15:56,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 21:15:56,625 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:15:56,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 21:15:56,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 21:15:56,626 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-02-14 21:15:56,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:15:56,692 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2022-02-14 21:15:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 21:15:56,693 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-02-14 21:15:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:15:56,693 INFO L225 Difference]: With dead ends: 29 [2022-02-14 21:15:56,693 INFO L226 Difference]: Without dead ends: 26 [2022-02-14 21:15:56,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-14 21:15:56,694 INFO L933 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.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:15:56,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 33 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-02-14 21:15:56,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-14 21:15:56,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-02-14 21:15:56,697 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-02-14 21:15:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-02-14 21:15:56,698 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2022-02-14 21:15:56,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:15:56,698 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-02-14 21:15:56,698 INFO L471 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-02-14 21:15:56,699 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-02-14 21:15:56,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 21:15:56,699 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:15:56,699 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:15:56,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-14 21:15:56,699 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:15:56,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:15:56,700 INFO L85 PathProgramCache]: Analyzing trace with hash -610770875, now seen corresponding path program 1 times [2022-02-14 21:15:56,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:15:56,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551735708] [2022-02-14 21:15:56,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:15:56,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:15:56,716 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-02-14 21:15:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:15:56,740 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-02-14 21:15:56,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:15:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:15:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:15:56,784 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:15:56,784 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551735708] [2022-02-14 21:15:56,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551735708] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:15:56,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284461448] [2022-02-14 21:15:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:15:56,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:15:56,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:15:56,786 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-02-14 21:15:56,801 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-02-14 21:15:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:15:56,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-14 21:15:56,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:15:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:15:57,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:16:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:16:03,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284461448] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:16:03,846 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:16:03,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-02-14 21:16:03,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203727998] [2022-02-14 21:16:03,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:16:03,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-14 21:16:03,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:16:03,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-14 21:16:03,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=136, Unknown=3, NotChecked=0, Total=182 [2022-02-14 21:16:03,848 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-02-14 21:16:04,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:16:04,000 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-02-14 21:16:04,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 21:16:04,001 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-02-14 21:16:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:16:04,003 INFO L225 Difference]: With dead ends: 34 [2022-02-14 21:16:04,003 INFO L226 Difference]: Without dead ends: 31 [2022-02-14 21:16:04,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=82, Invalid=257, Unknown=3, NotChecked=0, Total=342 [2022-02-14 21:16:04,004 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-02-14 21:16:04,004 INFO L934 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-02-14 21:16:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-14 21:16:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-02-14 21:16:04,007 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-02-14 21:16:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-02-14 21:16:04,008 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 17 [2022-02-14 21:16:04,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:16:04,008 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-02-14 21:16:04,008 INFO L471 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-02-14 21:16:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-02-14 21:16:04,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 21:16:04,009 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:16:04,009 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:16:04,036 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-02-14 21:16:04,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:16:04,224 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:16:04,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:16:04,224 INFO L85 PathProgramCache]: Analyzing trace with hash 162216202, now seen corresponding path program 1 times [2022-02-14 21:16:04,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:16:04,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032523778] [2022-02-14 21:16:04,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:04,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:16:04,230 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-02-14 21:16:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:04,244 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-02-14 21:16:04,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:16:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:16:04,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:16:04,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032523778] [2022-02-14 21:16:04,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032523778] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:16:04,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938426134] [2022-02-14 21:16:04,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:04,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:16:04,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:16:04,365 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-02-14 21:16:04,366 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-02-14 21:16:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:04,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-14 21:16:04,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:16:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:16:04,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:16:04,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938426134] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:16:04,485 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:16:04,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-02-14 21:16:04,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879039824] [2022-02-14 21:16:04,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:16:04,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 21:16:04,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:16:04,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 21:16:04,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-14 21:16:04,486 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-02-14 21:16:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:16:04,503 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-02-14 21:16:04,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 21:16:04,503 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-02-14 21:16:04,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:16:04,504 INFO L225 Difference]: With dead ends: 32 [2022-02-14 21:16:04,504 INFO L226 Difference]: Without dead ends: 29 [2022-02-14 21:16:04,504 INFO L932 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-02-14 21:16:04,505 INFO L933 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-02-14 21:16:04,505 INFO L934 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-02-14 21:16:04,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-14 21:16:04,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-02-14 21:16:04,507 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-02-14 21:16:04,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-02-14 21:16:04,508 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 17 [2022-02-14 21:16:04,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:16:04,508 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-02-14 21:16:04,508 INFO L471 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-02-14 21:16:04,508 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-02-14 21:16:04,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 21:16:04,509 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:16:04,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:16:04,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-14 21:16:04,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-14 21:16:04,724 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:16:04,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:16:04,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1833749398, now seen corresponding path program 1 times [2022-02-14 21:16:04,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:16:04,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453595382] [2022-02-14 21:16:04,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:04,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:16:04,729 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-02-14 21:16:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:04,753 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-02-14 21:16:04,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:16:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:16:04,828 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:16:04,828 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453595382] [2022-02-14 21:16:04,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453595382] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:16:04,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336742124] [2022-02-14 21:16:04,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:04,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:16:04,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:16:04,830 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-02-14 21:16:04,832 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-02-14 21:16:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:04,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-14 21:16:04,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:16:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:16:04,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:16:04,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336742124] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:16:04,981 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:16:04,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2022-02-14 21:16:04,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137665089] [2022-02-14 21:16:04,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:16:04,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 21:16:04,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:16:04,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 21:16:04,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-02-14 21:16:04,983 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-02-14 21:16:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:16:05,008 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2022-02-14 21:16:05,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-14 21:16:05,008 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-02-14 21:16:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:16:05,009 INFO L225 Difference]: With dead ends: 35 [2022-02-14 21:16:05,009 INFO L226 Difference]: Without dead ends: 32 [2022-02-14 21:16:05,010 INFO L932 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-02-14 21:16:05,011 INFO L933 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-02-14 21:16:05,011 INFO L934 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-02-14 21:16:05,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-14 21:16:05,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-02-14 21:16:05,018 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-02-14 21:16:05,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2022-02-14 21:16:05,022 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 17 [2022-02-14 21:16:05,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:16:05,022 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2022-02-14 21:16:05,023 INFO L471 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-02-14 21:16:05,023 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2022-02-14 21:16:05,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 21:16:05,024 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:16:05,024 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:16:05,042 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-02-14 21:16:05,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:16:05,241 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:16:05,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:16:05,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2110277654, now seen corresponding path program 1 times [2022-02-14 21:16:05,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:16:05,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056937568] [2022-02-14 21:16:05,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:05,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:16:05,245 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-02-14 21:16:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:05,258 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-02-14 21:16:05,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:16:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:16:05,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:16:05,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056937568] [2022-02-14 21:16:05,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056937568] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:16:05,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051757697] [2022-02-14 21:16:05,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:05,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:16:05,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:16:05,376 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-02-14 21:16:05,378 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-02-14 21:16:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:05,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-14 21:16:05,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:16:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:16:05,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:16:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:16:08,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051757697] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:16:08,951 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:16:08,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-02-14 21:16:08,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399852190] [2022-02-14 21:16:08,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:16:08,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-14 21:16:08,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:16:08,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-14 21:16:08,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=215, Unknown=1, NotChecked=0, Total=272 [2022-02-14 21:16:08,952 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-02-14 21:16:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:16:10,026 INFO L93 Difference]: Finished difference Result 52 states and 80 transitions. [2022-02-14 21:16:10,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-14 21:16:10,027 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-02-14 21:16:10,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:16:10,027 INFO L225 Difference]: With dead ends: 52 [2022-02-14 21:16:10,027 INFO L226 Difference]: Without dead ends: 48 [2022-02-14 21:16:10,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=146, Invalid=503, Unknown=1, NotChecked=0, Total=650 [2022-02-14 21:16:10,028 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 47 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:16:10,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 53 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 89 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2022-02-14 21:16:10,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-14 21:16:10,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2022-02-14 21:16:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 29 states have internal predecessors, (47), 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-02-14 21:16:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 51 transitions. [2022-02-14 21:16:10,031 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 51 transitions. Word has length 17 [2022-02-14 21:16:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:16:10,031 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 51 transitions. [2022-02-14 21:16:10,031 INFO L471 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-02-14 21:16:10,032 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 51 transitions. [2022-02-14 21:16:10,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 21:16:10,032 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:16:10,032 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:16:10,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-14 21:16:10,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:16:10,240 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:16:10,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:16:10,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1727307284, now seen corresponding path program 2 times [2022-02-14 21:16:10,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:16:10,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426784937] [2022-02-14 21:16:10,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:10,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:16:10,245 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-02-14 21:16:10,246 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-02-14 21:16:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:10,257 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-02-14 21:16:10,259 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-02-14 21:16:10,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:16:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:16:10,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:16:10,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426784937] [2022-02-14 21:16:10,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426784937] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:16:10,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387692826] [2022-02-14 21:16:10,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:16:10,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:16:10,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:16:10,314 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-02-14 21:16:10,315 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-02-14 21:16:10,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:16:10,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:16:10,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-14 21:16:10,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:16:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:16:10,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:16:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:16:46,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387692826] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:16:46,975 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:16:46,975 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2022-02-14 21:16:46,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993893719] [2022-02-14 21:16:46,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:16:46,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-14 21:16:46,976 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:16:46,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-14 21:16:46,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=174, Unknown=15, NotChecked=0, Total=240 [2022-02-14 21:16:46,977 INFO L87 Difference]: Start difference. First operand 34 states and 51 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-02-14 21:16:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:16:51,145 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2022-02-14 21:16:51,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-14 21:16:51,145 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-02-14 21:16:51,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:16:51,146 INFO L225 Difference]: With dead ends: 45 [2022-02-14 21:16:51,146 INFO L226 Difference]: Without dead ends: 39 [2022-02-14 21:16:51,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=118, Invalid=371, Unknown=17, NotChecked=0, Total=506 [2022-02-14 21:16:51,147 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:16:51,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 47 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-02-14 21:16:51,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-14 21:16:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-02-14 21:16:51,149 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-02-14 21:16:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2022-02-14 21:16:51,150 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 18 [2022-02-14 21:16:51,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:16:51,150 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2022-02-14 21:16:51,150 INFO L471 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-02-14 21:16:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2022-02-14 21:16:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 21:16:51,151 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:16:51,151 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:16:51,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-14 21:16:51,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:16:51,359 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:16:51,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:16:51,359 INFO L85 PathProgramCache]: Analyzing trace with hash 760455623, now seen corresponding path program 1 times [2022-02-14 21:16:51,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:16:51,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309995634] [2022-02-14 21:16:51,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:51,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:16:51,363 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-02-14 21:16:51,364 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-02-14 21:16:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:51,373 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-02-14 21:16:51,374 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-02-14 21:16:51,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:16:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:51,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:16:51,467 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:16:51,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309995634] [2022-02-14 21:16:51,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309995634] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:16:51,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967327069] [2022-02-14 21:16:51,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:51,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:16:51,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:16:51,468 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-02-14 21:16:51,469 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-02-14 21:16:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:51,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-14 21:16:51,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:16:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:16:51,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:17:03,052 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_29_31 Int) (aux_mod_v_main_~x~0_28_31 Int) (aux_div_v_main_~x~0_29_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_28_31) (< aux_mod_v_main_~x~0_29_31 0) (< 0 aux_mod_v_main_~x~0_29_31) (= aux_mod_v_main_~x~0_28_31 (mod c_main_~n~0 4294967296)) (let ((.cse0 (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31))) (and (not (= .cse0 c_main_~x~0)) (or (not (< 0 (mod c_main_~x~0 4294967296))) (exists ((v_it_4 Int)) (and (<= (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31 v_it_4 1) c_main_~x~0) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< .cse0 c_main_~x~0))))) (< aux_mod_v_main_~x~0_28_31 0) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse1) (forall ((aux_div_v_main_~x~0_28_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31 v_it_5 1) (+ aux_mod_v_main_~x~0_28_31 (* aux_div_v_main_~x~0_28_31 4294967296))) (<= 1 v_it_5))) (not (< (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31) (+ aux_mod_v_main_~x~0_28_31 (* aux_div_v_main_~x~0_28_31 4294967296))))))) (or (forall ((aux_div_v_main_~x~0_28_31 Int)) (not (= (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31) (+ aux_mod_v_main_~x~0_28_31 (* aux_div_v_main_~x~0_28_31 4294967296))))) .cse1))))) is different from false [2022-02-14 21:17:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-14 21:17:20,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967327069] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:17:20,202 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:17:20,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 10] total 18 [2022-02-14 21:17:20,202 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258584435] [2022-02-14 21:17:20,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:17:20,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-14 21:17:20,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:17:20,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-14 21:17:20,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=206, Unknown=8, NotChecked=30, Total=306 [2022-02-14 21:17:20,203 INFO L87 Difference]: Start difference. First operand 33 states and 49 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-02-14 21:17:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:17:22,649 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2022-02-14 21:17:22,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-14 21:17:22,649 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-02-14 21:17:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:17:22,650 INFO L225 Difference]: With dead ends: 45 [2022-02-14 21:17:22,650 INFO L226 Difference]: Without dead ends: 42 [2022-02-14 21:17:22,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=107, Invalid=350, Unknown=9, NotChecked=40, Total=506 [2022-02-14 21:17:22,651 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:17:22,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 90 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 52 Unchecked, 0.1s Time] [2022-02-14 21:17:22,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-14 21:17:22,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2022-02-14 21:17:22,653 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-02-14 21:17:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2022-02-14 21:17:22,653 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 18 [2022-02-14 21:17:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:17:22,653 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2022-02-14 21:17:22,653 INFO L471 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-02-14 21:17:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2022-02-14 21:17:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 21:17:22,654 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:17:22,654 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:17:22,672 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-02-14 21:17:22,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:22,863 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:17:22,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:17:22,864 INFO L85 PathProgramCache]: Analyzing trace with hash 571694412, now seen corresponding path program 1 times [2022-02-14 21:17:22,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:17:22,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172608362] [2022-02-14 21:17:22,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:22,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:17:22,868 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-02-14 21:17:22,869 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-02-14 21:17:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:22,879 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-02-14 21:17:22,882 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-02-14 21:17:22,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:17:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:17:22,978 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:17:22,978 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172608362] [2022-02-14 21:17:22,978 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172608362] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:17:22,978 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205421079] [2022-02-14 21:17:22,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:22,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:22,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:17:22,980 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-02-14 21:17:22,981 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-02-14 21:17:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:23,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-14 21:17:23,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:17:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:17:23,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:18:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:18:02,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205421079] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:18:02,927 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:18:02,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2022-02-14 21:18:02,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281598732] [2022-02-14 21:18:02,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:18:02,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-14 21:18:02,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:18:02,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-14 21:18:02,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=200, Unknown=14, NotChecked=0, Total=272 [2022-02-14 21:18:02,928 INFO L87 Difference]: Start difference. First operand 35 states and 52 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-02-14 21:18:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:18:11,190 INFO L93 Difference]: Finished difference Result 47 states and 71 transitions. [2022-02-14 21:18:11,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-14 21:18:11,190 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-02-14 21:18:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:18:11,191 INFO L225 Difference]: With dead ends: 47 [2022-02-14 21:18:11,191 INFO L226 Difference]: Without dead ends: 44 [2022-02-14 21:18:11,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=114, Invalid=374, Unknown=18, NotChecked=0, Total=506 [2022-02-14 21:18:11,192 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:18:11,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 59 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2022-02-14 21:18:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-14 21:18:11,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-02-14 21:18:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.625) internal successors, (52), 32 states have internal predecessors, (52), 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-02-14 21:18:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 56 transitions. [2022-02-14 21:18:11,195 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 56 transitions. Word has length 18 [2022-02-14 21:18:11,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:18:11,195 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 56 transitions. [2022-02-14 21:18:11,195 INFO L471 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-02-14 21:18:11,196 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 56 transitions. [2022-02-14 21:18:11,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 21:18:11,196 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:18:11,196 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:18:11,214 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-02-14 21:18:11,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:18:11,407 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:18:11,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:18:11,408 INFO L85 PathProgramCache]: Analyzing trace with hash -984935833, now seen corresponding path program 1 times [2022-02-14 21:18:11,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:18:11,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167901001] [2022-02-14 21:18:11,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:18:11,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:18:11,412 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-02-14 21:18:11,413 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-02-14 21:18:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:18:11,424 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-02-14 21:18:11,427 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-02-14 21:18:11,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:18:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:18:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:18:11,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:18:11,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167901001] [2022-02-14 21:18:11,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167901001] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:18:11,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092816926] [2022-02-14 21:18:11,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:18:11,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:18:11,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:18:11,572 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-02-14 21:18:11,573 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-02-14 21:18:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:18:11,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-14 21:18:11,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:18:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:18:11,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:18:28,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:18:28,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092816926] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:18:28,154 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:18:28,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 17 [2022-02-14 21:18:28,155 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187936063] [2022-02-14 21:18:28,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:18:28,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-14 21:18:28,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:18:28,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-14 21:18:28,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=211, Unknown=6, NotChecked=0, Total=272 [2022-02-14 21:18:28,156 INFO L87 Difference]: Start difference. First operand 37 states and 56 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-02-14 21:18:28,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:18:28,365 INFO L93 Difference]: Finished difference Result 48 states and 73 transitions. [2022-02-14 21:18:28,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-14 21:18:28,365 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-02-14 21:18:28,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:18:28,366 INFO L225 Difference]: With dead ends: 48 [2022-02-14 21:18:28,367 INFO L226 Difference]: Without dead ends: 45 [2022-02-14 21:18:28,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=130, Invalid=464, Unknown=6, NotChecked=0, Total=600 [2022-02-14 21:18:28,368 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:18:28,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 80 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 86 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-02-14 21:18:28,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-14 21:18:28,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-02-14 21:18:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 34 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-02-14 21:18:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 60 transitions. [2022-02-14 21:18:28,374 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 60 transitions. Word has length 18 [2022-02-14 21:18:28,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:18:28,375 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 60 transitions. [2022-02-14 21:18:28,375 INFO L471 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-02-14 21:18:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 60 transitions. [2022-02-14 21:18:28,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 21:18:28,376 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:18:28,376 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:18:28,394 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-02-14 21:18:28,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-14 21:18:28,583 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:18:28,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:18:28,584 INFO L85 PathProgramCache]: Analyzing trace with hash -211948756, now seen corresponding path program 1 times [2022-02-14 21:18:28,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:18:28,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966201552] [2022-02-14 21:18:28,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:18:28,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:18:28,587 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-02-14 21:18:28,590 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-02-14 21:18:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:18:28,600 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-02-14 21:18:28,602 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-02-14 21:18:28,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:18:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:18:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:18:28,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:18:28,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966201552] [2022-02-14 21:18:28,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966201552] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:18:28,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235704575] [2022-02-14 21:18:28,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:18:28,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:18:28,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:18:28,687 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-02-14 21:18:28,688 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-02-14 21:18:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:18:28,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-14 21:18:28,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:18:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:18:28,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:18:28,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235704575] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:18:28,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:18:28,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 13 [2022-02-14 21:18:28,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791577498] [2022-02-14 21:18:28,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:18:28,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 21:18:28,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:18:28,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 21:18:28,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-02-14 21:18:28,814 INFO L87 Difference]: Start difference. First operand 39 states and 60 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-02-14 21:18:28,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:18:28,838 INFO L93 Difference]: Finished difference Result 49 states and 73 transitions. [2022-02-14 21:18:28,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-14 21:18:28,838 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-02-14 21:18:28,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:18:28,839 INFO L225 Difference]: With dead ends: 49 [2022-02-14 21:18:28,839 INFO L226 Difference]: Without dead ends: 46 [2022-02-14 21:18:28,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-02-14 21:18:28,839 INFO L933 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-02-14 21:18:28,839 INFO L934 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-02-14 21:18:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-14 21:18:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2022-02-14 21:18:28,841 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-02-14 21:18:28,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 54 transitions. [2022-02-14 21:18:28,841 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 54 transitions. Word has length 18 [2022-02-14 21:18:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:18:28,842 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 54 transitions. [2022-02-14 21:18:28,842 INFO L471 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-02-14 21:18:28,842 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 54 transitions. [2022-02-14 21:18:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 21:18:28,842 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:18:28,842 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:18:28,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-14 21:18:29,050 WARN L452 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-02-14 21:18:29,050 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:18:29,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:18:29,050 INFO L85 PathProgramCache]: Analyzing trace with hash -967377177, now seen corresponding path program 1 times [2022-02-14 21:18:29,050 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:18:29,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200116674] [2022-02-14 21:18:29,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:18:29,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:18:29,054 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-02-14 21:18:29,055 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-02-14 21:18:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:18:29,068 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-02-14 21:18:29,075 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-02-14 21:18:29,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:18:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:18:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:18:29,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:18:29,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200116674] [2022-02-14 21:18:29,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200116674] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:18:29,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816598753] [2022-02-14 21:18:29,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:18:29,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:18:29,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:18:29,251 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-02-14 21:18:29,252 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-02-14 21:18:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:18:29,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-14 21:18:29,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:18:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:18:30,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:19:36,618 WARN L228 SmtUtils]: Spent 53.97s 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-02-14 21:19:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:19:42,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816598753] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:19:42,344 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:19:42,344 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2022-02-14 21:19:42,344 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294695065] [2022-02-14 21:19:42,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:19:42,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-14 21:19:42,344 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:19:42,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-14 21:19:42,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=361, Unknown=7, NotChecked=0, Total=462 [2022-02-14 21:19:42,345 INFO L87 Difference]: Start difference. First operand 36 states and 54 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-02-14 21:19:44,526 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* (div c_main_~x~0 4294967296) 4294967296))) (let ((.cse0 (* (div c_main_~n~0 4294967296) 4294967296)) (.cse1 (+ c_main_~n~0 .cse2))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (or (< 0 (mod c_main_~z~0 4294967296)) (and (<= (+ .cse0 c_main_~x~0) .cse1) (< .cse1 (+ .cse0 c_main_~x~0 1)))) (or (and (<= c_main_~n~0 .cse0) (<= .cse1 (+ (* (div (+ (* (- 1) c_main_~x~0) c_main_~n~0 .cse2) 4294967296) 4294967296) c_main_~x~0))) (<= (+ (* 4294967296 (div c_main_~y~0 4294967296)) 1) c_main_~y~0)) (forall ((aux_div_aux_mod_v_main_~z~0_39_31_121 Int) (aux_mod_aux_mod_v_main_~z~0_39_31_121 Int) (aux_div_v_main_~z~0_39_31 Int)) (let ((.cse5 (* aux_div_aux_mod_v_main_~z~0_39_31_121 4294967296))) (let ((.cse4 (+ .cse5 (* 4294967296 aux_div_v_main_~z~0_39_31) aux_mod_aux_mod_v_main_~z~0_39_31_121)) (.cse3 (+ c_main_~x~0 c_main_~z~0))) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ (* aux_div_aux_mod_v_main_~z~0_39_31_121 4294967296) aux_mod_aux_mod_v_main_~z~0_39_31_121)))) (< .cse3 .cse4) (not (< c_main_~x~0 (+ .cse5 aux_mod_aux_mod_v_main_~z~0_39_31_121))) (< .cse4 .cse3) (< aux_mod_aux_mod_v_main_~z~0_39_31_121 0) (< c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~z~0_39_31_121 1)))))) (<= c_main_~z~0 (* (div c_main_~z~0 4294967296) 4294967296)) (forall ((aux_div_aux_mod_v_main_~z~0_39_31_121 Int) (aux_mod_aux_mod_v_main_~z~0_39_31_121 Int) (aux_div_v_main_~z~0_39_31 Int)) (let ((.cse8 (* aux_div_aux_mod_v_main_~z~0_39_31_121 4294967296))) (let ((.cse7 (+ .cse8 (* 4294967296 aux_div_v_main_~z~0_39_31) aux_mod_aux_mod_v_main_~z~0_39_31_121)) (.cse6 (+ c_main_~x~0 c_main_~z~0))) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ (* aux_div_aux_mod_v_main_~z~0_39_31_121 4294967296) aux_mod_aux_mod_v_main_~z~0_39_31_121)))) (< .cse6 .cse7) (not (< c_main_~x~0 (+ .cse8 aux_mod_aux_mod_v_main_~z~0_39_31_121))) (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~z~0_39_31_121) c_main_~n~0) (< .cse7 .cse6) (<= 4294967296 aux_mod_aux_mod_v_main_~z~0_39_31_121))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)))) is different from false [2022-02-14 21:19:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:19:49,361 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2022-02-14 21:19:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-14 21:19:49,362 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-02-14 21:19:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:19:49,362 INFO L225 Difference]: With dead ends: 51 [2022-02-14 21:19:49,362 INFO L226 Difference]: Without dead ends: 45 [2022-02-14 21:19:49,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 77.8s TimeCoverageRelationStatistics Valid=184, Invalid=740, Unknown=10, NotChecked=58, Total=992 [2022-02-14 21:19:49,363 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:19:49,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 53 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2022-02-14 21:19:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-14 21:19:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2022-02-14 21:19:49,365 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-02-14 21:19:49,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2022-02-14 21:19:49,365 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 60 transitions. Word has length 18 [2022-02-14 21:19:49,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:19:49,365 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 60 transitions. [2022-02-14 21:19:49,365 INFO L471 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-02-14 21:19:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 60 transitions. [2022-02-14 21:19:49,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 21:19:49,366 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:19:49,366 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:19:49,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-14 21:19:49,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-14 21:19:49,578 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:19:49,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:19:49,578 INFO L85 PathProgramCache]: Analyzing trace with hash -194390100, now seen corresponding path program 1 times [2022-02-14 21:19:49,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:19:49,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874599730] [2022-02-14 21:19:49,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:49,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:19:49,581 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-02-14 21:19:49,582 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-02-14 21:19:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:49,598 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-02-14 21:19:49,603 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-02-14 21:19:49,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:19:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:19:49,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:19:49,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874599730] [2022-02-14 21:19:49,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874599730] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:19:49,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553791021] [2022-02-14 21:19:49,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:49,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:19:49,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:19:49,744 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-02-14 21:19:49,744 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-02-14 21:19:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:49,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-14 21:19:49,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:19:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:19:50,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:19:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:19:53,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553791021] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:19:53,987 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:19:53,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 19 [2022-02-14 21:19:53,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109164486] [2022-02-14 21:19:53,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:19:53,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-14 21:19:53,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:19:53,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-14 21:19:53,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=262, Unknown=1, NotChecked=0, Total=342 [2022-02-14 21:19:53,988 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-02-14 21:19:54,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:19:54,309 INFO L93 Difference]: Finished difference Result 59 states and 90 transitions. [2022-02-14 21:19:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-14 21:19:54,310 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-02-14 21:19:54,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:19:54,310 INFO L225 Difference]: With dead ends: 59 [2022-02-14 21:19:54,310 INFO L226 Difference]: Without dead ends: 55 [2022-02-14 21:19:54,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=150, Invalid=499, Unknown=1, NotChecked=0, Total=650 [2022-02-14 21:19:54,311 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 48 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:19:54,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 67 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 78 Invalid, 0 Unknown, 26 Unchecked, 0.1s Time] [2022-02-14 21:19:54,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-14 21:19:54,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2022-02-14 21:19:54,313 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-02-14 21:19:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2022-02-14 21:19:54,313 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 64 transitions. Word has length 18 [2022-02-14 21:19:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:19:54,313 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 64 transitions. [2022-02-14 21:19:54,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:54,313 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 64 transitions. [2022-02-14 21:19:54,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 21:19:54,314 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:19:54,314 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:19:54,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-02-14 21:19:54,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-14 21:19:54,519 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:19:54,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:19:54,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2001594489, now seen corresponding path program 1 times [2022-02-14 21:19:54,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:19:54,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610459893] [2022-02-14 21:19:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:54,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:19:54,523 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-02-14 21:19:54,524 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-02-14 21:19:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:54,535 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-02-14 21:19:54,559 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-02-14 21:19:54,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:19:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:19:54,777 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:19:54,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610459893] [2022-02-14 21:19:54,777 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610459893] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:19:54,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958143310] [2022-02-14 21:19:54,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:54,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:19:54,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:19:54,778 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-02-14 21:19:54,779 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-02-14 21:19:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:54,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-14 21:19:54,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:19:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:19:55,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:19:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:19:58,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958143310] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:19:58,415 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:19:58,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-02-14 21:19:58,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835766973] [2022-02-14 21:19:58,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:19:58,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-14 21:19:58,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:19:58,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-14 21:19:58,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-02-14 21:19:58,416 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-02-14 21:19:59,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:19:59,746 INFO L93 Difference]: Finished difference Result 63 states and 98 transitions. [2022-02-14 21:19:59,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-14 21:19:59,746 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-02-14 21:19:59,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:19:59,747 INFO L225 Difference]: With dead ends: 63 [2022-02-14 21:19:59,747 INFO L226 Difference]: Without dead ends: 59 [2022-02-14 21:19:59,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2022-02-14 21:19:59,748 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 50 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:19:59,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 56 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 62 Unchecked, 0.1s Time] [2022-02-14 21:19:59,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-14 21:19:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2022-02-14 21:19:59,749 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-02-14 21:19:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 66 transitions. [2022-02-14 21:19:59,750 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 66 transitions. Word has length 18 [2022-02-14 21:19:59,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:19:59,751 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 66 transitions. [2022-02-14 21:19:59,751 INFO L471 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-02-14 21:19:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2022-02-14 21:19:59,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 21:19:59,752 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:19:59,752 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:19:59,770 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-02-14 21:19:59,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-14 21:19:59,955 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:19:59,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:19:59,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2104611596, now seen corresponding path program 1 times [2022-02-14 21:19:59,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:19:59,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156230052] [2022-02-14 21:19:59,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:59,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:19:59,959 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-02-14 21:19:59,961 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-02-14 21:19:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:59,973 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-02-14 21:19:59,984 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-02-14 21:20:00,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:20:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:20:00,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:20:00,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156230052] [2022-02-14 21:20:00,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156230052] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:20:00,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331281968] [2022-02-14 21:20:00,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:20:00,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:20:00,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:20:00,246 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-02-14 21:20:00,247 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-02-14 21:20:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:00,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-14 21:20:00,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:20:01,810 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-14 21:20:01,831 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-02-14 21:20:02,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-14 21:20:02,013 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) 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-02-14 21:20:02,020 INFO L158 Benchmark]: Toolchain (without parser) took 248862.03ms. Allocated memory was 221.2MB in the beginning and 266.3MB in the end (delta: 45.1MB). Free memory was 172.2MB in the beginning and 88.2MB in the end (delta: 84.0MB). Peak memory consumption was 130.4MB. Max. memory is 8.0GB. [2022-02-14 21:20:02,021 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 221.2MB. Free memory is still 188.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-14 21:20:02,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.89ms. Allocated memory is still 221.2MB. Free memory was 172.0MB in the beginning and 198.4MB in the end (delta: -26.4MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-02-14 21:20:02,021 INFO L158 Benchmark]: Boogie Preprocessor took 19.09ms. Allocated memory is still 221.2MB. Free memory was 198.4MB in the beginning and 196.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-14 21:20:02,021 INFO L158 Benchmark]: RCFGBuilder took 231.53ms. Allocated memory is still 221.2MB. Free memory was 196.8MB in the beginning and 185.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-14 21:20:02,021 INFO L158 Benchmark]: IcfgTransformer took 2569.08ms. Allocated memory is still 221.2MB. Free memory was 185.8MB in the beginning and 158.0MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-02-14 21:20:02,022 INFO L158 Benchmark]: TraceAbstraction took 245861.65ms. Allocated memory was 221.2MB in the beginning and 266.3MB in the end (delta: 45.1MB). Free memory was 157.5MB in the beginning and 88.2MB in the end (delta: 69.3MB). Peak memory consumption was 114.3MB. Max. memory is 8.0GB. [2022-02-14 21:20:02,023 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.10ms. Allocated memory is still 221.2MB. Free memory is still 188.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 174.89ms. Allocated memory is still 221.2MB. Free memory was 172.0MB in the beginning and 198.4MB in the end (delta: -26.4MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.09ms. Allocated memory is still 221.2MB. Free memory was 198.4MB in the beginning and 196.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 231.53ms. Allocated memory is still 221.2MB. Free memory was 196.8MB in the beginning and 185.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 2569.08ms. Allocated memory is still 221.2MB. Free memory was 185.8MB in the beginning and 158.0MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 245861.65ms. Allocated memory was 221.2MB in the beginning and 266.3MB in the end (delta: 45.1MB). Free memory was 157.5MB in the beginning and 88.2MB in the end (delta: 69.3MB). Peak memory consumption was 114.3MB. 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-02-14 21:20:02,221 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...