/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de62.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-18 17:42:45,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-18 17:42:45,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-18 17:42:45,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-18 17:42:45,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-18 17:42:45,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-18 17:42:45,791 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-18 17:42:45,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-18 17:42:45,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-18 17:42:45,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-18 17:42:45,799 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-18 17:42:45,800 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-18 17:42:45,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-18 17:42:45,802 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-18 17:42:45,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-18 17:42:45,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-18 17:42:45,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-18 17:42:45,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-18 17:42:45,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-18 17:42:45,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-18 17:42:45,812 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-18 17:42:45,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-18 17:42:45,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-18 17:42:45,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-18 17:42:45,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-18 17:42:45,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-18 17:42:45,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-18 17:42:45,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-18 17:42:45,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-18 17:42:45,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-18 17:42:45,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-18 17:42:45,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-18 17:42:45,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-18 17:42:45,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-18 17:42:45,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-18 17:42:45,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-18 17:42:45,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-18 17:42:45,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-18 17:42:45,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-18 17:42:45,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-18 17:42:45,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-18 17:42:45,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-18 17:42:45,826 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-18 17:42:45,834 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-18 17:42:45,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-18 17:42:45,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-18 17:42:45,836 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-18 17:42:45,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-18 17:42:45,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-18 17:42:45,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-18 17:42:45,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-18 17:42:45,836 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-18 17:42:45,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-18 17:42:45,837 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-18 17:42:45,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-18 17:42:45,837 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-18 17:42:45,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-18 17:42:45,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-18 17:42:45,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-18 17:42:45,838 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-18 17:42:45,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-18 17:42:45,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 17:42:45,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-18 17:42:45,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-18 17:42:45,838 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-18 17:42:45,839 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-18 17:42:46,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-18 17:42:46,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-18 17:42:46,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-18 17:42:46,024 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-18 17:42:46,026 INFO L275 PluginConnector]: CDTParser initialized [2022-03-18 17:42:46,027 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-03-18 17:42:46,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19164afc2/375e2de2206c49a1aa78a2bedc15271d/FLAGd054bac13 [2022-03-18 17:42:46,379 INFO L306 CDTParser]: Found 1 translation units. [2022-03-18 17:42:46,379 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-03-18 17:42:46,384 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19164afc2/375e2de2206c49a1aa78a2bedc15271d/FLAGd054bac13 [2022-03-18 17:42:46,819 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19164afc2/375e2de2206c49a1aa78a2bedc15271d [2022-03-18 17:42:46,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-18 17:42:46,823 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-18 17:42:46,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-18 17:42:46,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-18 17:42:46,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-18 17:42:46,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 05:42:46" (1/1) ... [2022-03-18 17:42:46,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270c8114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:42:46, skipping insertion in model container [2022-03-18 17:42:46,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 05:42:46" (1/1) ... [2022-03-18 17:42:46,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-18 17:42:46,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-18 17:42:46,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de62.c[368,381] [2022-03-18 17:42:46,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 17:42:46,961 INFO L203 MainTranslator]: Completed pre-run [2022-03-18 17:42:46,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de62.c[368,381] [2022-03-18 17:42:46,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 17:42:46,982 INFO L208 MainTranslator]: Completed translation [2022-03-18 17:42:46,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:42:46 WrapperNode [2022-03-18 17:42:46,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-18 17:42:46,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-18 17:42:46,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-18 17:42:46,983 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-18 17:42:46,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:42:46" (1/1) ... [2022-03-18 17:42:46,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:42:46" (1/1) ... [2022-03-18 17:42:46,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:42:46" (1/1) ... [2022-03-18 17:42:46,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:42:46" (1/1) ... [2022-03-18 17:42:46,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:42:46" (1/1) ... [2022-03-18 17:42:46,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:42:46" (1/1) ... [2022-03-18 17:42:46,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:42:46" (1/1) ... [2022-03-18 17:42:47,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-18 17:42:47,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-18 17:42:47,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-18 17:42:47,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-18 17:42:47,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:42:46" (1/1) ... [2022-03-18 17:42:47,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 17:42:47,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 17:42:47,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-18 17:42:47,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-18 17:42:47,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-18 17:42:47,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-18 17:42:47,060 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-18 17:42:47,063 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-18 17:42:47,063 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-18 17:42:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-18 17:42:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-18 17:42:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-18 17:42:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-18 17:42:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-18 17:42:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-18 17:42:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-18 17:42:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-18 17:42:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-18 17:42:47,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-18 17:42:47,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-18 17:42:47,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-18 17:42:47,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-18 17:42:47,117 INFO L234 CfgBuilder]: Building ICFG [2022-03-18 17:42:47,118 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-18 17:42:47,206 INFO L275 CfgBuilder]: Performing block encoding [2022-03-18 17:42:47,210 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-18 17:42:47,210 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-18 17:42:47,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 05:42:47 BoogieIcfgContainer [2022-03-18 17:42:47,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-18 17:42:47,212 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-18 17:42:47,212 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-18 17:42:47,227 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-18 17:42:47,230 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 05:42:47" (1/1) ... [2022-03-18 17:42:47,352 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-18 17:42:47,353 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_8 (+ v_main_~y~0_9 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] to Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~y~0_9 v_main_~y~0_8) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~x~0_7 v_main_~x~0_6)) (and (< 0 .cse0) (= v_main_~x~0_6 (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_7 v_main_~y~0_9)) (< v_main_~y~0_9 v_main_~y~0_8) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_7 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~y~0_9 v_it_1 1) v_main_~y~0_8))))))) InVars {main_~y~0=v_main_~y~0_9, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_7, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] [2022-03-18 17:42:47,457 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-18 17:42:47,458 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_8 (+ v_main_~z~0_7 1)) (< 0 (mod v_main_~z~0_8 4294967296)) (= v_main_~x~0_11 (+ v_main_~x~0_12 1))) InVars {main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_8} OutVars{main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_7, main_#t~post8=|v_main_#t~post8_1|, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] to Formula: (let ((.cse0 (mod v_main_~z~0_8 4294967296))) (or (and (forall ((v_it_2 Int)) (or (< 0 (mod (+ v_main_~z~0_8 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~z~0_7 v_it_2 1) v_main_~z~0_8)) (not (<= 1 v_it_2)))) (= v_main_~x~0_11 (+ v_main_~x~0_12 v_main_~z~0_8 (* (- 1) v_main_~z~0_7))) (< 0 .cse0) (< v_main_~z~0_7 v_main_~z~0_8)) (and (<= .cse0 0) (= v_main_~z~0_8 v_main_~z~0_7) (= v_main_~x~0_12 v_main_~x~0_11) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)))) InVars {main_~x~0=v_main_~x~0_12, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_8, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_11, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_7, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] [2022-03-18 17:42:47,518 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-18 17:42:47,518 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~z~0=v_main_~z~0_3, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post10=|v_main_#t~post10_1|, main_~z~0=v_main_~z~0_2, main_~y~0=v_main_~y~0_4, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] to Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|) (<= .cse0 0)) (and (= v_main_~y~0_4 (+ v_main_~y~0_5 v_main_~z~0_3 (* (- 1) v_main_~z~0_2))) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= (+ v_main_~z~0_3 v_it_3 1) v_main_~z~0_2)) (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_5 (* v_it_3 4294967295)) 4294967296)))) (< v_main_~z~0_3 v_main_~z~0_2)))) InVars {main_~y~0=v_main_~y~0_5, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] [2022-03-18 17:42:47,600 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-18 17:42:47,601 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~x~0_10 4294967296)) (= v_main_~x~0_10 (+ v_main_~x~0_9 1)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] to Formula: (let ((.cse0 (mod v_main_~x~0_10 4294967296))) (or (and (<= .cse0 0) (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (= v_main_~y~0_11 v_main_~y~0_10) (= v_main_~x~0_10 v_main_~x~0_9)) (and (= (+ v_main_~x~0_10 v_main_~y~0_11 (* (- 1) v_main_~x~0_9)) v_main_~y~0_10) (< 0 .cse0) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_10) 4294967296)) (not (<= (+ v_main_~x~0_9 v_it_4 1) v_main_~x~0_10)) (not (<= 1 v_it_4)))) (< v_main_~x~0_9 v_main_~x~0_10)))) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_9, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] [2022-03-18 17:42:47,668 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-18 17:42:47,668 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_10 (+ v_main_~z~0_9 1)) (< 0 (mod v_main_~z~0_10 4294967296)) (= v_main_~x~0_13 (+ v_main_~x~0_14 1))) InVars {main_~x~0=v_main_~x~0_14, main_~z~0=v_main_~z~0_10} OutVars{main_~x~0=v_main_~x~0_13, main_~z~0=v_main_~z~0_9, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] to Formula: (let ((.cse0 (mod v_main_~z~0_10 4294967296))) (or (and (<= .cse0 0) (= |v_main_#t~post14_3| |v_main_#t~post14_1|) (= v_main_~z~0_10 v_main_~z~0_9) (= v_main_~x~0_14 v_main_~x~0_13) (= |v_main_#t~post13_3| |v_main_#t~post13_1|)) (and (< 0 .cse0) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~z~0_9 v_it_5 1) v_main_~z~0_10)) (< 0 (mod (+ v_main_~z~0_10 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)))) (< v_main_~z~0_9 v_main_~z~0_10) (= v_main_~x~0_13 (+ v_main_~x~0_14 v_main_~z~0_10 (* (- 1) v_main_~z~0_9)))))) InVars {main_~x~0=v_main_~x~0_14, main_~z~0=v_main_~z~0_10, main_#t~post13=|v_main_#t~post13_3|, main_#t~post14=|v_main_#t~post14_3|} OutVars{main_~x~0=v_main_~x~0_13, main_~z~0=v_main_~z~0_9, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] [2022-03-18 17:42:47,734 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-18 17:42:47,735 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~x~0_3 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_#t~post15, main_#t~post16, main_~y~0] to Formula: (let ((.cse0 (mod v_main_~y~0_7 4294967296))) (or (and (= |v_main_#t~post15_3| |v_main_#t~post15_1|) (= |v_main_#t~post16_3| |v_main_#t~post16_1|) (= v_main_~y~0_7 v_main_~y~0_6) (= v_main_~x~0_3 v_main_~x~0_2) (<= .cse0 0)) (and (< 0 .cse0) (= v_main_~y~0_6 (+ v_main_~x~0_2 v_main_~y~0_7 (* (- 1) v_main_~x~0_3))) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~x~0_2 v_it_6 1) v_main_~x~0_3)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~y~0_7 (* v_it_6 4294967295)) 4294967296)))) (< v_main_~x~0_2 v_main_~x~0_3)))) InVars {main_#t~post15=|v_main_#t~post15_3|, main_~y~0=v_main_~y~0_7, main_#t~post16=|v_main_#t~post16_3|, main_~x~0=v_main_~x~0_3} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post15, main_#t~post16, main_~y~0] [2022-03-18 17:42:47,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 18.03 05:42:47 BasicIcfg [2022-03-18 17:42:47,738 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-18 17:42:47,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-18 17:42:47,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-18 17:42:47,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-18 17:42:47,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.03 05:42:46" (1/4) ... [2022-03-18 17:42:47,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2caf3248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 05:42:47, skipping insertion in model container [2022-03-18 17:42:47,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:42:46" (2/4) ... [2022-03-18 17:42:47,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2caf3248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 05:42:47, skipping insertion in model container [2022-03-18 17:42:47,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 05:42:47" (3/4) ... [2022-03-18 17:42:47,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2caf3248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.03 05:42:47, skipping insertion in model container [2022-03-18 17:42:47,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 18.03 05:42:47" (4/4) ... [2022-03-18 17:42:47,744 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de62.cJordan [2022-03-18 17:42:47,747 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-18 17:42:47,748 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-18 17:42:47,774 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-18 17:42:47,779 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-18 17:42:47,779 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-18 17:42:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 17:42:47,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-18 17:42:47,792 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:42:47,793 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:42:47,793 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:42:47,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:42:47,796 INFO L85 PathProgramCache]: Analyzing trace with hash 430051023, now seen corresponding path program 1 times [2022-03-18 17:42:47,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:42:47,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211242741] [2022-03-18 17:42:47,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:42:47,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:42:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:42:47,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:42:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:42:47,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:42:47,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:42:47,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211242741] [2022-03-18 17:42:47,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211242741] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 17:42:47,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 17:42:47,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-18 17:42:47,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907104724] [2022-03-18 17:42:47,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 17:42:47,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-18 17:42:47,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:42:47,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-18 17:42:47,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-18 17:42:47,954 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:42:47,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:42:47,979 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-03-18 17:42:47,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-18 17:42:47,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-18 17:42:47,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:42:47,985 INFO L225 Difference]: With dead ends: 25 [2022-03-18 17:42:47,985 INFO L226 Difference]: Without dead ends: 18 [2022-03-18 17:42:47,986 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-18 17:42:47,988 INFO L912 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 17:42:47,989 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 17:42:48,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-03-18 17:42:48,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-03-18 17:42:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:42:48,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-03-18 17:42:48,021 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-03-18 17:42:48,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:42:48,022 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-03-18 17:42:48,022 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:42:48,022 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-03-18 17:42:48,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-18 17:42:48,023 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:42:48,023 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:42:48,024 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-18 17:42:48,024 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:42:48,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:42:48,028 INFO L85 PathProgramCache]: Analyzing trace with hash -514488111, now seen corresponding path program 1 times [2022-03-18 17:42:48,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:42:48,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990291161] [2022-03-18 17:42:48,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:42:48,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:42:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:42:48,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:42:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:42:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:42:48,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:42:48,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990291161] [2022-03-18 17:42:48,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990291161] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 17:42:48,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 17:42:48,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-18 17:42:48,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200782766] [2022-03-18 17:42:48,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 17:42:48,127 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-18 17:42:48,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:42:48,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-18 17:42:48,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-18 17:42:48,128 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:42:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:42:48,199 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-03-18 17:42:48,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-18 17:42:48,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-18 17:42:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:42:48,201 INFO L225 Difference]: With dead ends: 28 [2022-03-18 17:42:48,201 INFO L226 Difference]: Without dead ends: 25 [2022-03-18 17:42:48,202 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-18 17:42:48,204 INFO L912 BasicCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 17:42:48,207 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 37 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 10 Unchecked, 0.0s Time] [2022-03-18 17:42:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-03-18 17:42:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2022-03-18 17:42:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:42:48,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-03-18 17:42:48,220 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 17 [2022-03-18 17:42:48,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:42:48,220 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-03-18 17:42:48,220 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:42:48,220 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-03-18 17:42:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-18 17:42:48,221 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:42:48,221 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:42:48,222 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-18 17:42:48,222 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:42:48,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:42:48,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1257458414, now seen corresponding path program 1 times [2022-03-18 17:42:48,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:42:48,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719039601] [2022-03-18 17:42:48,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:42:48,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:42:48,242 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:42:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:42:48,280 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:42:48,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:42:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:42:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:42:48,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:42:48,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719039601] [2022-03-18 17:42:48,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719039601] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 17:42:48,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001978503] [2022-03-18 17:42:48,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:42:48,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:42:48,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 17:42:48,364 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 17:42:48,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-18 17:42:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:42:48,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-18 17:42:48,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 17:42:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:42:48,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 17:42:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:42:53,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001978503] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 17:42:53,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 17:42:53,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-03-18 17:42:53,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458376721] [2022-03-18 17:42:53,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 17:42:53,157 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-18 17:42:53,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:42:53,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-18 17:42:53,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=67, Unknown=2, NotChecked=0, Total=90 [2022-03-18 17:42:53,159 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:42:53,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:42:53,277 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2022-03-18 17:42:53,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-18 17:42:53,277 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-18 17:42:53,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:42:53,279 INFO L225 Difference]: With dead ends: 31 [2022-03-18 17:42:53,279 INFO L226 Difference]: Without dead ends: 28 [2022-03-18 17:42:53,279 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=45, Invalid=135, Unknown=2, NotChecked=0, Total=182 [2022-03-18 17:42:53,280 INFO L912 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 17:42:53,280 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 57 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 32 Unchecked, 0.0s Time] [2022-03-18 17:42:53,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-03-18 17:42:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-03-18 17:42:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:42:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-03-18 17:42:53,283 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 18 [2022-03-18 17:42:53,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:42:53,283 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-03-18 17:42:53,283 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:42:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-03-18 17:42:53,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-18 17:42:53,294 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:42:53,294 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:42:53,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-18 17:42:53,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:42:53,504 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:42:53,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:42:53,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2030445491, now seen corresponding path program 1 times [2022-03-18 17:42:53,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:42:53,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969134958] [2022-03-18 17:42:53,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:42:53,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:42:53,517 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:42:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:42:53,549 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:42:53,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:42:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:42:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:42:53,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:42:53,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969134958] [2022-03-18 17:42:53,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969134958] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 17:42:53,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955260866] [2022-03-18 17:42:53,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:42:53,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:42:53,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 17:42:53,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 17:42:53,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-18 17:42:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:42:53,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-18 17:42:53,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 17:42:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:42:53,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 17:42:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:42:58,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955260866] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 17:42:58,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 17:42:58,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-03-18 17:42:58,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528552377] [2022-03-18 17:42:58,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 17:42:58,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-18 17:42:58,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:42:58,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-18 17:42:58,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=67, Unknown=2, NotChecked=0, Total=90 [2022-03-18 17:42:58,271 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:42:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:42:58,343 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2022-03-18 17:42:58,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-18 17:42:58,344 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-18 17:42:58,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:42:58,344 INFO L225 Difference]: With dead ends: 38 [2022-03-18 17:42:58,344 INFO L226 Difference]: Without dead ends: 35 [2022-03-18 17:42:58,345 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=45, Invalid=135, Unknown=2, NotChecked=0, Total=182 [2022-03-18 17:42:58,345 INFO L912 BasicCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 17:42:58,345 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 45 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2022-03-18 17:42:58,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-03-18 17:42:58,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-03-18 17:42:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:42:58,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2022-03-18 17:42:58,348 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 18 [2022-03-18 17:42:58,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:42:58,348 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2022-03-18 17:42:58,349 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:42:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2022-03-18 17:42:58,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 17:42:58,349 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:42:58,349 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:42:58,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-18 17:42:58,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-18 17:42:58,564 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:42:58,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:42:58,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1868584369, now seen corresponding path program 1 times [2022-03-18 17:42:58,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:42:58,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868814450] [2022-03-18 17:42:58,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:42:58,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:42:58,574 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:42:58,578 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-18 17:42:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:42:58,599 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.2))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:42:58,602 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-18 17:42:58,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:42:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:42:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:42:58,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:42:58,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868814450] [2022-03-18 17:42:58,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868814450] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 17:42:58,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138385689] [2022-03-18 17:42:58,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:42:58,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:42:58,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 17:42:58,696 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 17:42:58,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-18 17:42:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:42:58,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-18 17:42:58,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 17:42:58,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:42:58,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 17:43:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:43:24,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138385689] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 17:43:24,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 17:43:24,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2022-03-18 17:43:24,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493321952] [2022-03-18 17:43:24,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 17:43:24,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-18 17:43:24,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:43:24,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-18 17:43:24,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=183, Unknown=9, NotChecked=0, Total=240 [2022-03-18 17:43:24,149 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:43:38,557 WARN L232 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 17:44:14,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:44:14,302 INFO L93 Difference]: Finished difference Result 59 states and 91 transitions. [2022-03-18 17:44:14,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-18 17:44:14,303 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-18 17:44:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:44:14,304 INFO L225 Difference]: With dead ends: 59 [2022-03-18 17:44:14,304 INFO L226 Difference]: Without dead ends: 55 [2022-03-18 17:44:14,304 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 72.8s TimeCoverageRelationStatistics Valid=138, Invalid=537, Unknown=27, NotChecked=0, Total=702 [2022-03-18 17:44:14,304 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 17:44:14,305 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 72 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 86 Invalid, 0 Unknown, 93 Unchecked, 0.1s Time] [2022-03-18 17:44:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-03-18 17:44:14,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2022-03-18 17:44:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.6875) internal successors, (54), 32 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:44:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 58 transitions. [2022-03-18 17:44:14,308 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 58 transitions. Word has length 19 [2022-03-18 17:44:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:44:14,309 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 58 transitions. [2022-03-18 17:44:14,309 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:44:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 58 transitions. [2022-03-18 17:44:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 17:44:14,309 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:44:14,309 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:44:14,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-18 17:44:14,510 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:44:14,510 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:44:14,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:44:14,511 INFO L85 PathProgramCache]: Analyzing trace with hash 353225841, now seen corresponding path program 2 times [2022-03-18 17:44:14,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:44:14,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382489510] [2022-03-18 17:44:14,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:44:14,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:44:14,516 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:44:14,517 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_12 .cse0 (* (- 4294967296) (div (+ main_~y~0_12 .cse0) 4294967296)))) 0)) [2022-03-18 17:44:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:44:14,547 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.5))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:44:14,551 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_12 .cse0 (* (- 4294967296) (div (+ main_~y~0_12 .cse0) 4294967296)))) 0)) [2022-03-18 17:44:14,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:44:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:44:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-18 17:44:14,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:44:14,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382489510] [2022-03-18 17:44:14,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382489510] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 17:44:14,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 17:44:14,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-18 17:44:14,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035678577] [2022-03-18 17:44:14,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 17:44:14,633 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-18 17:44:14,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:44:14,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-18 17:44:14,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-18 17:44:14,634 INFO L87 Difference]: Start difference. First operand 37 states and 58 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:44:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:44:14,734 INFO L93 Difference]: Finished difference Result 52 states and 80 transitions. [2022-03-18 17:44:14,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-18 17:44:14,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-18 17:44:14,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:44:14,735 INFO L225 Difference]: With dead ends: 52 [2022-03-18 17:44:14,735 INFO L226 Difference]: Without dead ends: 46 [2022-03-18 17:44:14,736 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-18 17:44:14,736 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 17:44:14,736 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 47 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 69 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-03-18 17:44:14,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-03-18 17:44:14,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-03-18 17:44:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:44:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2022-03-18 17:44:14,739 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 61 transitions. Word has length 19 [2022-03-18 17:44:14,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:44:14,739 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 61 transitions. [2022-03-18 17:44:14,739 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:44:14,739 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 61 transitions. [2022-03-18 17:44:14,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 17:44:14,740 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:44:14,740 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:44:14,740 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-18 17:44:14,740 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:44:14,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:44:14,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1453978548, now seen corresponding path program 1 times [2022-03-18 17:44:14,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:44:14,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249586761] [2022-03-18 17:44:14,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:44:14,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:44:14,750 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:44:14,753 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:44:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:44:14,768 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:44:14,770 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:44:14,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:44:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:44:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:44:14,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:44:14,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249586761] [2022-03-18 17:44:14,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249586761] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 17:44:14,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310675380] [2022-03-18 17:44:14,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:44:14,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:44:14,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 17:44:14,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 17:44:14,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-18 17:44:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:44:14,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-18 17:44:14,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 17:44:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:44:15,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 17:44:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:44:39,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310675380] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 17:44:39,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 17:44:39,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2022-03-18 17:44:39,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896162670] [2022-03-18 17:44:39,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 17:44:39,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-18 17:44:39,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:44:39,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-18 17:44:39,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=137, Unknown=8, NotChecked=0, Total=182 [2022-03-18 17:44:39,149 INFO L87 Difference]: Start difference. First operand 39 states and 61 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:44:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:44:41,571 INFO L93 Difference]: Finished difference Result 56 states and 86 transitions. [2022-03-18 17:44:41,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-18 17:44:41,571 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-18 17:44:41,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:44:41,572 INFO L225 Difference]: With dead ends: 56 [2022-03-18 17:44:41,572 INFO L226 Difference]: Without dead ends: 53 [2022-03-18 17:44:41,572 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=81, Invalid=290, Unknown=9, NotChecked=0, Total=380 [2022-03-18 17:44:41,573 INFO L912 BasicCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 17:44:41,573 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 75 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 67 Invalid, 0 Unknown, 56 Unchecked, 0.1s Time] [2022-03-18 17:44:41,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-03-18 17:44:41,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2022-03-18 17:44:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 36 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:44:41,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 65 transitions. [2022-03-18 17:44:41,577 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 65 transitions. Word has length 19 [2022-03-18 17:44:41,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:44:41,577 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 65 transitions. [2022-03-18 17:44:41,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:44:41,577 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 65 transitions. [2022-03-18 17:44:41,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 17:44:41,578 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:44:41,578 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:44:41,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-18 17:44:41,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:44:41,783 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:44:41,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:44:41,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1642739759, now seen corresponding path program 1 times [2022-03-18 17:44:41,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:44:41,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446445377] [2022-03-18 17:44:41,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:44:41,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:44:41,788 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-18 17:44:41,789 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-18 17:44:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:44:41,815 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.5))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-18 17:44:41,818 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-18 17:44:41,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:44:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:44:41,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 17:44:41,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:44:41,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446445377] [2022-03-18 17:44:41,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446445377] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 17:44:41,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 17:44:41,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-18 17:44:41,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986530723] [2022-03-18 17:44:41,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 17:44:41,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-18 17:44:41,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:44:41,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-18 17:44:41,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-18 17:44:41,874 INFO L87 Difference]: Start difference. First operand 41 states and 65 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:44:41,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:44:41,967 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2022-03-18 17:44:41,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-18 17:44:41,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-18 17:44:41,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:44:41,969 INFO L225 Difference]: With dead ends: 57 [2022-03-18 17:44:41,969 INFO L226 Difference]: Without dead ends: 52 [2022-03-18 17:44:41,969 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-18 17:44:41,971 INFO L912 BasicCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 17:44:41,971 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 47 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 69 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-03-18 17:44:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-18 17:44:41,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2022-03-18 17:44:41,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 38 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:44:41,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 68 transitions. [2022-03-18 17:44:41,974 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 68 transitions. Word has length 19 [2022-03-18 17:44:41,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:44:41,974 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 68 transitions. [2022-03-18 17:44:41,974 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:44:41,974 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 68 transitions. [2022-03-18 17:44:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 17:44:41,974 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:44:41,974 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:44:41,974 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-18 17:44:41,975 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:44:41,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:44:41,975 INFO L85 PathProgramCache]: Analyzing trace with hash -869752682, now seen corresponding path program 1 times [2022-03-18 17:44:41,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:44:41,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693789971] [2022-03-18 17:44:41,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:44:41,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:44:41,979 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-18 17:44:41,983 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:44:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:44:41,992 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.5))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-18 17:44:41,994 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.6))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:44:42,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:44:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:44:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:44:42,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:44:42,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693789971] [2022-03-18 17:44:42,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693789971] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 17:44:42,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423857707] [2022-03-18 17:44:42,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:44:42,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:44:42,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 17:44:42,043 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 17:44:42,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-18 17:44:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:44:42,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-18 17:44:42,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 17:44:42,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:44:42,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 17:44:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:44:58,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423857707] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 17:44:58,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 17:44:58,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8] total 12 [2022-03-18 17:44:58,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845612148] [2022-03-18 17:44:58,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 17:44:58,035 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-18 17:44:58,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:44:58,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-18 17:44:58,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=101, Unknown=3, NotChecked=0, Total=132 [2022-03-18 17:44:58,035 INFO L87 Difference]: Start difference. First operand 43 states and 68 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:44:58,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:44:58,147 INFO L93 Difference]: Finished difference Result 58 states and 92 transitions. [2022-03-18 17:44:58,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-18 17:44:58,147 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-18 17:44:58,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:44:58,148 INFO L225 Difference]: With dead ends: 58 [2022-03-18 17:44:58,148 INFO L226 Difference]: Without dead ends: 55 [2022-03-18 17:44:58,148 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=55, Invalid=182, Unknown=3, NotChecked=0, Total=240 [2022-03-18 17:44:58,148 INFO L912 BasicCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 17:44:58,148 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 65 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 54 Unchecked, 0.0s Time] [2022-03-18 17:44:58,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-03-18 17:44:58,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2022-03-18 17:44:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:44:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2022-03-18 17:44:58,151 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 19 [2022-03-18 17:44:58,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:44:58,151 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2022-03-18 17:44:58,151 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:44:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2022-03-18 17:44:58,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 17:44:58,152 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:44:58,152 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:44:58,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-18 17:44:58,361 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:44:58,361 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:44:58,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:44:58,362 INFO L85 PathProgramCache]: Analyzing trace with hash 84699953, now seen corresponding path program 1 times [2022-03-18 17:44:58,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:44:58,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21559891] [2022-03-18 17:44:58,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:44:58,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:44:58,365 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:44:58,368 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:44:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:44:58,376 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:44:58,380 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:44:58,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:44:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:44:58,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:44:58,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:44:58,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21559891] [2022-03-18 17:44:58,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21559891] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 17:44:58,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233122400] [2022-03-18 17:44:58,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:44:58,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:44:58,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 17:44:58,442 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 17:44:58,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-18 17:44:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:44:58,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-18 17:44:58,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 17:44:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:44:58,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 17:45:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:45:03,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233122400] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 17:45:03,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 17:45:03,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 14 [2022-03-18 17:45:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761687097] [2022-03-18 17:45:03,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 17:45:03,203 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-18 17:45:03,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:45:03,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-18 17:45:03,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=144, Unknown=1, NotChecked=0, Total=182 [2022-03-18 17:45:03,206 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:45:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:45:03,348 INFO L93 Difference]: Finished difference Result 64 states and 101 transitions. [2022-03-18 17:45:03,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-18 17:45:03,349 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-18 17:45:03,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:45:03,350 INFO L225 Difference]: With dead ends: 64 [2022-03-18 17:45:03,350 INFO L226 Difference]: Without dead ends: 61 [2022-03-18 17:45:03,351 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=101, Invalid=360, Unknown=1, NotChecked=0, Total=462 [2022-03-18 17:45:03,351 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 17:45:03,352 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 59 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 70 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-03-18 17:45:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-18 17:45:03,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2022-03-18 17:45:03,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:45:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2022-03-18 17:45:03,361 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 19 [2022-03-18 17:45:03,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:45:03,361 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2022-03-18 17:45:03,361 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:45:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2022-03-18 17:45:03,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 17:45:03,362 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:45:03,362 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:45:03,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-18 17:45:03,578 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:45:03,578 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:45:03,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:45:03,579 INFO L85 PathProgramCache]: Analyzing trace with hash 857687030, now seen corresponding path program 1 times [2022-03-18 17:45:03,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:45:03,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008158049] [2022-03-18 17:45:03,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:45:03,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:45:03,582 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:45:03,583 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-18 17:45:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:45:03,590 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:45:03,594 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.4))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-18 17:45:03,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:45:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:45:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:45:03,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:45:03,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008158049] [2022-03-18 17:45:03,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008158049] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 17:45:03,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107814678] [2022-03-18 17:45:03,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:45:03,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:45:03,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 17:45:03,667 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 17:45:03,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-18 17:45:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:45:03,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-18 17:45:03,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 17:45:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:45:03,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 17:45:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:45:04,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107814678] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 17:45:04,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 17:45:04,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 14 [2022-03-18 17:45:04,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225135252] [2022-03-18 17:45:04,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 17:45:04,301 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-18 17:45:04,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:45:04,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-18 17:45:04,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-03-18 17:45:04,302 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:45:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:45:04,435 INFO L93 Difference]: Finished difference Result 62 states and 99 transitions. [2022-03-18 17:45:04,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-18 17:45:04,435 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-18 17:45:04,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:45:04,436 INFO L225 Difference]: With dead ends: 62 [2022-03-18 17:45:04,436 INFO L226 Difference]: Without dead ends: 59 [2022-03-18 17:45:04,436 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2022-03-18 17:45:04,437 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 17:45:04,437 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 64 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 92 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2022-03-18 17:45:04,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-18 17:45:04,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2022-03-18 17:45:04,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:45:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2022-03-18 17:45:04,439 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 19 [2022-03-18 17:45:04,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:45:04,439 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2022-03-18 17:45:04,440 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:45:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2022-03-18 17:45:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 17:45:04,440 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:45:04,440 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:45:04,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-18 17:45:04,647 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:45:04,649 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:45:04,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:45:04,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1145856883, now seen corresponding path program 2 times [2022-03-18 17:45:04,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:45:04,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850675394] [2022-03-18 17:45:04,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:45:04,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:45:04,655 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:45:04,655 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-18 17:45:04,656 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_10 .cse0 (* (- 4294967296) (div (+ main_~z~0_10 .cse0) 4294967296)))) 0)) [2022-03-18 17:45:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:45:04,671 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.3))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:45:04,673 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-18 17:45:04,676 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_10 .cse0 (* (- 4294967296) (div (+ main_~z~0_10 .cse0) 4294967296)))) 0)) [2022-03-18 17:45:04,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:45:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:45:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:45:04,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:45:04,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850675394] [2022-03-18 17:45:04,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850675394] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 17:45:04,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460126071] [2022-03-18 17:45:04,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 17:45:04,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:45:04,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 17:45:04,759 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 17:45:04,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-18 17:45:04,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 17:45:04,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 17:45:04,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-18 17:45:04,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 17:45:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:45:04,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 17:46:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:46:33,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460126071] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 17:46:33,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 17:46:33,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2022-03-18 17:46:33,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172119571] [2022-03-18 17:46:33,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 17:46:33,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-18 17:46:33,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:46:33,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-18 17:46:33,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=197, Unknown=25, NotChecked=0, Total=272 [2022-03-18 17:46:33,252 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:46:51,098 WARN L232 SmtUtils]: Spent 10.18s on a formula simplification that was a NOOP. DAG size: 109 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 17:46:53,131 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (forall ((aux_mod_v_main_~x~0_35_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_35_31) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (<= aux_mod_v_main_~y~0_26_31 0) (<= 4294967296 aux_mod_v_main_~y~0_26_31) (and (or (forall ((aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (< aux_mod_v_main_~z~0_32_31 0) (< 0 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0)))) (forall ((aux_div_v_main_~x~0_35_31 Int) (aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0) (<= aux_mod_v_main_~z~0_32_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_32_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (< aux_mod_v_main_~y~0_26_31 0) (let ((.cse0 (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) c_main_~y~0 c_main_~z~0) 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse0) (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) (* v_it_5 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))) (not .cse0)))) (< 0 aux_mod_v_main_~y~0_26_31)))) (not .cse1)) (or .cse1 (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse2) (or (not .cse2) (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))))))) (<= aux_mod_v_main_~x~0_35_31 0))) (<= c_main_~x~0 (* (div c_main_~x~0 4294967296) 4294967296)) (or (< 0 (mod c_main_~z~0 4294967296)) (forall ((aux_mod_v_main_~x~0_35_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_35_31) (<= aux_mod_v_main_~x~0_35_31 0) (let ((.cse3 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse3 (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0)))) (or (not .cse3) (and (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) (* v_it_5 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (< aux_mod_v_main_~y~0_26_31 0) (< 0 aux_mod_v_main_~y~0_26_31))) (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (<= aux_mod_v_main_~y~0_26_31 0) (<= 4294967296 aux_mod_v_main_~y~0_26_31) (and (or (forall ((aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (< aux_mod_v_main_~z~0_32_31 0) (< 0 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0)))) (forall ((aux_div_v_main_~x~0_35_31 Int) (aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0) (<= aux_mod_v_main_~z~0_32_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_32_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-18 17:47:22,251 WARN L232 SmtUtils]: Spent 10.36s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 17:48:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:48:12,986 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2022-03-18 17:48:12,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-18 17:48:12,986 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-18 17:48:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:48:12,987 INFO L225 Difference]: With dead ends: 69 [2022-03-18 17:48:12,987 INFO L226 Difference]: Without dead ends: 66 [2022-03-18 17:48:12,987 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 160.8s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=58, NotChecked=52, Total=812 [2022-03-18 17:48:12,988 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 49 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 17:48:12,988 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 81 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 87 Invalid, 0 Unknown, 125 Unchecked, 0.1s Time] [2022-03-18 17:48:12,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-03-18 17:48:12,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2022-03-18 17:48:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 41 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:48:12,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 74 transitions. [2022-03-18 17:48:12,990 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 74 transitions. Word has length 20 [2022-03-18 17:48:12,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:48:12,990 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 74 transitions. [2022-03-18 17:48:12,990 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:48:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 74 transitions. [2022-03-18 17:48:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 17:48:12,991 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:48:12,991 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:48:13,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-18 17:48:13,197 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-18 17:48:13,197 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:48:13,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:48:13,198 INFO L85 PathProgramCache]: Analyzing trace with hash -369501645, now seen corresponding path program 1 times [2022-03-18 17:48:13,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:48:13,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319769388] [2022-03-18 17:48:13,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:48:13,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:48:13,201 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:48:13,202 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-18 17:48:13,203 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-18 17:48:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:48:13,213 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.6))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:48:13,215 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.7))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-18 17:48:13,217 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.8))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-18 17:48:13,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:48:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:48:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 17:48:13,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:48:13,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319769388] [2022-03-18 17:48:13,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319769388] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 17:48:13,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249088540] [2022-03-18 17:48:13,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:48:13,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:48:13,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 17:48:13,314 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 17:48:13,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-18 17:48:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:48:13,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-18 17:48:13,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 17:48:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 17:48:13,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 17:48:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:48:27,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249088540] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 17:48:27,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 17:48:27,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 13 [2022-03-18 17:48:27,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129338239] [2022-03-18 17:48:27,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 17:48:27,440 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-18 17:48:27,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:48:27,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-18 17:48:27,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=119, Unknown=4, NotChecked=0, Total=156 [2022-03-18 17:48:27,440 INFO L87 Difference]: Start difference. First operand 46 states and 74 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:48:27,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:48:27,683 INFO L93 Difference]: Finished difference Result 71 states and 112 transitions. [2022-03-18 17:48:27,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-18 17:48:27,684 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-18 17:48:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:48:27,684 INFO L225 Difference]: With dead ends: 71 [2022-03-18 17:48:27,684 INFO L226 Difference]: Without dead ends: 61 [2022-03-18 17:48:27,685 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=74, Invalid=264, Unknown=4, NotChecked=0, Total=342 [2022-03-18 17:48:27,685 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 17:48:27,685 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 63 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 38 Unchecked, 0.0s Time] [2022-03-18 17:48:27,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-18 17:48:27,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2022-03-18 17:48:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 47 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:48:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 83 transitions. [2022-03-18 17:48:27,687 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 83 transitions. Word has length 20 [2022-03-18 17:48:27,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:48:27,687 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 83 transitions. [2022-03-18 17:48:27,687 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:48:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 83 transitions. [2022-03-18 17:48:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 17:48:27,688 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:48:27,688 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:48:27,704 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-03-18 17:48:27,899 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-18 17:48:27,899 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:48:27,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:48:27,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2118261262, now seen corresponding path program 1 times [2022-03-18 17:48:27,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:48:27,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710483055] [2022-03-18 17:48:27,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:48:27,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:48:27,903 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:48:27,904 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-18 17:48:27,904 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-18 17:48:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:48:27,913 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:48:27,915 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-18 17:48:27,920 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-18 17:48:28,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:48:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:48:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:48:28,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:48:28,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710483055] [2022-03-18 17:48:28,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710483055] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 17:48:28,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101424174] [2022-03-18 17:48:28,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:48:28,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:48:28,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 17:48:28,041 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 17:48:28,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-18 17:48:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:48:28,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-18 17:48:28,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 17:48:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:48:28,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 17:48:48,421 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_42_31 Int) (aux_mod_v_main_~y~0_35_31 Int)) (or (< aux_mod_v_main_~y~0_35_31 0) (and (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse0) (forall ((aux_div_v_main_~y~0_35_31 Int) (aux_div_v_main_~z~0_40_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_35_31 4294967296))) (let ((.cse3 (+ c_main_~y~0 c_main_~z~0)) (.cse2 (+ (* 4294967296 aux_div_v_main_~z~0_40_31) aux_mod_v_main_~y~0_35_31 .cse1))) (or (not (< (+ aux_mod_v_main_~y~0_35_31 .cse1) c_main_~y~0)) (< .cse2 .cse3) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296) 1) c_main_~y~0))) (< .cse3 .cse2)))))) (or .cse0 (< (div (+ (- 1) (* (- 1) c_main_~z~0)) (- 4294967296)) (+ 2 (div (+ (- 1) c_main_~z~0) 4294967296))) (forall ((aux_div_v_main_~y~0_35_31 Int)) (not (= (+ aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296)) c_main_~y~0)))))) (not (= (mod (+ aux_mod_v_main_~x~0_42_31 (* 4294967295 c_main_~x~0)) 4294967296) 0))) (forall ((aux_div_v_main_~x~0_42_31 Int)) (or (let ((.cse4 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse4) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_42_31 (* aux_div_v_main_~x~0_42_31 4294967296))) (<= 1 v_it_5) (not (< 0 (mod (+ (* v_it_5 4294967295) (* 4294967295 aux_mod_v_main_~y~0_35_31) c_main_~y~0 c_main_~z~0) 4294967296))))) (forall ((aux_div_v_main_~y~0_35_31 Int) (aux_div_v_main_~z~0_40_31 Int)) (let ((.cse7 (* 4294967296 aux_div_v_main_~z~0_40_31)) (.cse5 (* aux_div_v_main_~y~0_35_31 4294967296)) (.cse6 (+ c_main_~y~0 c_main_~z~0))) (or (not (< (+ aux_mod_v_main_~y~0_35_31 .cse5) c_main_~y~0)) (<= .cse6 (+ .cse7 aux_mod_v_main_~y~0_35_31 .cse5)) (<= (+ .cse7 aux_mod_v_main_~y~0_35_31 4294967296 .cse5) .cse6) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296) 1) c_main_~y~0))))))) (or .cse4 (<= (div (* (- 1) c_main_~z~0) (- 4294967296)) (+ (div (+ (- 4294967296) c_main_~z~0) 4294967296) 1)) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_42_31 (* aux_div_v_main_~x~0_42_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (forall ((aux_div_v_main_~y~0_35_31 Int)) (not (= (+ aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296)) c_main_~y~0)))))) (<= (+ aux_mod_v_main_~x~0_42_31 (* aux_div_v_main_~x~0_42_31 4294967296)) c_main_~x~0)))) (<= 4294967296 aux_mod_v_main_~x~0_42_31) (<= aux_mod_v_main_~x~0_42_31 0) (< 0 aux_mod_v_main_~y~0_35_31))) is different from false [2022-03-18 17:49:07,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-18 17:49:07,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101424174] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 17:49:07,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 17:49:07,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 11] total 20 [2022-03-18 17:49:07,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570279287] [2022-03-18 17:49:07,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 17:49:07,022 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-18 17:49:07,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:49:07,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-18 17:49:07,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=262, Unknown=12, NotChecked=34, Total=380 [2022-03-18 17:49:07,023 INFO L87 Difference]: Start difference. First operand 52 states and 83 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:49:21,310 WARN L232 SmtUtils]: Spent 10.10s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 17:49:23,319 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (forall ((aux_mod_v_main_~x~0_42_31 Int) (aux_mod_v_main_~y~0_35_31 Int)) (or (< aux_mod_v_main_~y~0_35_31 0) (and (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse0) (forall ((aux_div_v_main_~y~0_35_31 Int) (aux_div_v_main_~z~0_40_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_35_31 4294967296))) (let ((.cse3 (+ c_main_~y~0 c_main_~z~0)) (.cse2 (+ (* 4294967296 aux_div_v_main_~z~0_40_31) aux_mod_v_main_~y~0_35_31 .cse1))) (or (not (< (+ aux_mod_v_main_~y~0_35_31 .cse1) c_main_~y~0)) (< .cse2 .cse3) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296) 1) c_main_~y~0))) (< .cse3 .cse2)))))) (or .cse0 (< (div (+ (- 1) (* (- 1) c_main_~z~0)) (- 4294967296)) (+ 2 (div (+ (- 1) c_main_~z~0) 4294967296))) (forall ((aux_div_v_main_~y~0_35_31 Int)) (not (= (+ aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296)) c_main_~y~0)))))) (not (= (mod (+ aux_mod_v_main_~x~0_42_31 (* 4294967295 c_main_~x~0)) 4294967296) 0))) (forall ((aux_div_v_main_~x~0_42_31 Int)) (or (let ((.cse4 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse4) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_42_31 (* aux_div_v_main_~x~0_42_31 4294967296))) (<= 1 v_it_5) (not (< 0 (mod (+ (* v_it_5 4294967295) (* 4294967295 aux_mod_v_main_~y~0_35_31) c_main_~y~0 c_main_~z~0) 4294967296))))) (forall ((aux_div_v_main_~y~0_35_31 Int) (aux_div_v_main_~z~0_40_31 Int)) (let ((.cse7 (* 4294967296 aux_div_v_main_~z~0_40_31)) (.cse5 (* aux_div_v_main_~y~0_35_31 4294967296)) (.cse6 (+ c_main_~y~0 c_main_~z~0))) (or (not (< (+ aux_mod_v_main_~y~0_35_31 .cse5) c_main_~y~0)) (<= .cse6 (+ .cse7 aux_mod_v_main_~y~0_35_31 .cse5)) (<= (+ .cse7 aux_mod_v_main_~y~0_35_31 4294967296 .cse5) .cse6) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296) 1) c_main_~y~0))))))) (or .cse4 (<= (div (* (- 1) c_main_~z~0) (- 4294967296)) (+ (div (+ (- 4294967296) c_main_~z~0) 4294967296) 1)) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_42_31 (* aux_div_v_main_~x~0_42_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (forall ((aux_div_v_main_~y~0_35_31 Int)) (not (= (+ aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296)) c_main_~y~0)))))) (<= (+ aux_mod_v_main_~x~0_42_31 (* aux_div_v_main_~x~0_42_31 4294967296)) c_main_~x~0)))) (<= 4294967296 aux_mod_v_main_~x~0_42_31) (<= aux_mod_v_main_~x~0_42_31 0) (< 0 aux_mod_v_main_~y~0_35_31))) (<= c_main_~x~0 (* (div c_main_~x~0 4294967296) 4294967296)) (or (forall ((aux_mod_v_main_~x~0_42_31 Int) (aux_mod_v_main_~y~0_35_31 Int)) (or (< aux_mod_v_main_~y~0_35_31 0) (<= 4294967296 aux_mod_v_main_~x~0_42_31) (and (forall ((aux_div_v_main_~x~0_42_31 Int)) (or (<= (+ aux_mod_v_main_~x~0_42_31 (* aux_div_v_main_~x~0_42_31 4294967296)) c_main_~x~0) (not (< 0 (mod c_main_~y~0 4294967296))) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_42_31 (* aux_div_v_main_~x~0_42_31 4294967296))) (<= 1 v_it_5) (not (< 0 (mod (+ (* v_it_5 4294967295) (* 4294967295 aux_mod_v_main_~y~0_35_31) c_main_~y~0 c_main_~z~0) 4294967296))))) (forall ((aux_div_v_main_~y~0_35_31 Int) (aux_div_v_main_~z~0_40_31 Int)) (let ((.cse10 (* 4294967296 aux_div_v_main_~z~0_40_31)) (.cse8 (* aux_div_v_main_~y~0_35_31 4294967296)) (.cse9 (+ c_main_~y~0 c_main_~z~0))) (or (not (< (+ aux_mod_v_main_~y~0_35_31 .cse8) c_main_~y~0)) (<= .cse9 (+ .cse10 aux_mod_v_main_~y~0_35_31 .cse8)) (<= (+ .cse10 aux_mod_v_main_~y~0_35_31 4294967296 .cse8) .cse9) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296) 1) c_main_~y~0)))))))) (or (< 0 (mod c_main_~y~0 4294967296)) (not (= (mod (+ aux_mod_v_main_~x~0_42_31 (* 4294967295 c_main_~x~0)) 4294967296) 0)) (forall ((aux_div_v_main_~y~0_35_31 Int)) (not (= (+ aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296)) c_main_~y~0))))) (<= aux_mod_v_main_~x~0_42_31 0) (< 0 aux_mod_v_main_~y~0_35_31))) (< 0 (mod c_main_~z~0 4294967296))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-18 17:49:57,923 WARN L232 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 17:50:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:50:34,184 INFO L93 Difference]: Finished difference Result 75 states and 115 transitions. [2022-03-18 17:50:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-18 17:50:34,185 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-18 17:50:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:50:34,185 INFO L225 Difference]: With dead ends: 75 [2022-03-18 17:50:34,185 INFO L226 Difference]: Without dead ends: 71 [2022-03-18 17:50:34,186 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 116.6s TimeCoverageRelationStatistics Valid=170, Invalid=668, Unknown=40, NotChecked=114, Total=992 [2022-03-18 17:50:34,186 INFO L912 BasicCegarLoop]: 14 mSDtfsCounter, 59 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 17:50:34,186 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 82 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 97 Invalid, 0 Unknown, 133 Unchecked, 0.1s Time] [2022-03-18 17:50:34,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-03-18 17:50:34,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2022-03-18 17:50:34,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:50:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-03-18 17:50:34,188 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 20 [2022-03-18 17:50:34,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:50:34,189 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-03-18 17:50:34,189 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:50:34,189 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-03-18 17:50:34,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 17:50:34,189 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:50:34,189 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:50:34,205 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-03-18 17:50:34,400 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-18 17:50:34,401 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:50:34,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:50:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1929500051, now seen corresponding path program 1 times [2022-03-18 17:50:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:50:34,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879734905] [2022-03-18 17:50:34,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:50:34,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:50:34,404 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:50:34,405 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-18 17:50:34,405 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_11 .cse0 (* (- 4294967296) (div (+ main_~y~0_11 .cse0) 4294967296)))) 0)) [2022-03-18 17:50:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:50:34,417 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.6))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:50:34,418 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.7))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-18 17:50:34,420 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.8))) (+ main_~y~0_11 .cse0 (* (- 4294967296) (div (+ main_~y~0_11 .cse0) 4294967296)))) 0)) [2022-03-18 17:50:34,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:50:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:50:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-18 17:50:34,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:50:34,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879734905] [2022-03-18 17:50:34,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879734905] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 17:50:34,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 17:50:34,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-18 17:50:34,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598856645] [2022-03-18 17:50:34,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 17:50:34,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-18 17:50:34,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:50:34,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-18 17:50:34,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-18 17:50:34,483 INFO L87 Difference]: Start difference. First operand 50 states and 80 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:50:34,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:50:34,557 INFO L93 Difference]: Finished difference Result 62 states and 96 transitions. [2022-03-18 17:50:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-18 17:50:34,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-18 17:50:34,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:50:34,558 INFO L225 Difference]: With dead ends: 62 [2022-03-18 17:50:34,558 INFO L226 Difference]: Without dead ends: 57 [2022-03-18 17:50:34,558 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-18 17:50:34,559 INFO L912 BasicCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 17:50:34,559 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 51 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 65 Invalid, 0 Unknown, 11 Unchecked, 0.0s Time] [2022-03-18 17:50:34,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-03-18 17:50:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-03-18 17:50:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 46 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:50:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 82 transitions. [2022-03-18 17:50:34,563 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 82 transitions. Word has length 20 [2022-03-18 17:50:34,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:50:34,564 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 82 transitions. [2022-03-18 17:50:34,564 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:50:34,564 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 82 transitions. [2022-03-18 17:50:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 17:50:34,564 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:50:34,564 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:50:34,564 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-18 17:50:34,564 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:50:34,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:50:34,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1592480168, now seen corresponding path program 1 times [2022-03-18 17:50:34,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:50:34,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368146968] [2022-03-18 17:50:34,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:50:34,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:50:34,568 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:50:34,568 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-18 17:50:34,569 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-18 17:50:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:50:34,577 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.6))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:50:34,579 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.7))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-18 17:50:34,580 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.8))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-18 17:50:34,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:50:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:50:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:50:34,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:50:34,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368146968] [2022-03-18 17:50:34,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368146968] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 17:50:34,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471131575] [2022-03-18 17:50:34,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:50:34,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:50:34,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 17:50:34,684 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 17:50:34,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-18 17:50:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:50:34,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-18 17:50:34,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 17:50:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:50:34,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 17:50:59,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_46_31 Int) (v_main_~x~0_47 Int)) (or (<= aux_mod_v_main_~x~0_46_31 0) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (not (= v_main_~x~0_47 c_main_~x~0))) (or (not .cse0) (not (< v_main_~x~0_47 c_main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_main_~x~0_47 v_it_4 1) c_main_~x~0) (<= 1 v_it_4)))))) (<= 4294967296 aux_mod_v_main_~x~0_46_31) (and (forall ((aux_div_v_main_~x~0_46_31 Int) (aux_mod_v_main_~z~0_45_31 Int)) (or (<= 4294967296 aux_mod_v_main_~z~0_45_31) (<= aux_mod_v_main_~z~0_45_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_main_~x~0_47 v_it_5 1) (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))) (<= 1 v_it_5))) (<= (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296)) v_main_~x~0_47) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse1 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse1) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))))) (or (forall ((aux_div_v_main_~x~0_46_31 Int)) (not (= v_main_~x~0_47 (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))))) (forall ((aux_mod_v_main_~z~0_45_31 Int)) (or (< 0 aux_mod_v_main_~z~0_45_31) (let ((.cse2 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse2 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse2) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))) (< aux_mod_v_main_~z~0_45_31 0))))))) is different from false [2022-03-18 17:51:05,226 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((aux_mod_v_main_~x~0_46_31 Int) (v_main_~x~0_47 Int)) (or (<= aux_mod_v_main_~x~0_46_31 0) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (not (= v_main_~x~0_47 c_main_~x~0))) (or (not .cse0) (not (< v_main_~x~0_47 c_main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_main_~x~0_47 v_it_4 1) c_main_~x~0) (<= 1 v_it_4)))))) (and (forall ((aux_div_v_main_~x~0_46_31 Int) (aux_mod_v_main_~z~0_45_31 Int)) (or (<= 4294967296 aux_mod_v_main_~z~0_45_31) (<= aux_mod_v_main_~z~0_45_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_main_~x~0_47 v_it_5 1) (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))) (<= 1 v_it_5))) (not (< 0 (mod c_main_~y~0 4294967296))) (<= (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296)) v_main_~x~0_47) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))))) (or (forall ((aux_div_v_main_~x~0_46_31 Int)) (not (= v_main_~x~0_47 (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))))) (forall ((aux_mod_v_main_~z~0_45_31 Int)) (or (< 0 aux_mod_v_main_~z~0_45_31) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse1 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse1) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))) (< aux_mod_v_main_~z~0_45_31 0))))) (<= 4294967296 aux_mod_v_main_~x~0_46_31))) (< 0 (mod c_main_~z~0 4294967296))) is different from true [2022-03-18 17:51:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-18 17:51:11,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471131575] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 17:51:11,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 17:51:11,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2022-03-18 17:51:11,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144452907] [2022-03-18 17:51:11,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 17:51:11,499 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-18 17:51:11,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:51:11,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-18 17:51:11,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=8, NotChecked=54, Total=272 [2022-03-18 17:51:11,500 INFO L87 Difference]: Start difference. First operand 51 states and 82 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:51:23,753 WARN L232 SmtUtils]: Spent 10.08s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 17:52:02,503 WARN L232 SmtUtils]: Spent 10.09s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 17:52:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:52:27,377 INFO L93 Difference]: Finished difference Result 70 states and 110 transitions. [2022-03-18 17:52:27,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-18 17:52:27,377 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-18 17:52:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:52:27,378 INFO L225 Difference]: With dead ends: 70 [2022-03-18 17:52:27,378 INFO L226 Difference]: Without dead ends: 67 [2022-03-18 17:52:27,378 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 94.8s TimeCoverageRelationStatistics Valid=132, Invalid=496, Unknown=30, NotChecked=98, Total=756 [2022-03-18 17:52:27,379 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 17:52:27,379 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 62 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 51 Invalid, 0 Unknown, 119 Unchecked, 0.0s Time] [2022-03-18 17:52:27,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-03-18 17:52:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2022-03-18 17:52:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 44 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:52:27,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 78 transitions. [2022-03-18 17:52:27,381 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 78 transitions. Word has length 20 [2022-03-18 17:52:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:52:27,381 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 78 transitions. [2022-03-18 17:52:27,381 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:52:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 78 transitions. [2022-03-18 17:52:27,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 17:52:27,381 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:52:27,381 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:52:27,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-03-18 17:52:27,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-18 17:52:27,589 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:52:27,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:52:27,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2096941357, now seen corresponding path program 2 times [2022-03-18 17:52:27,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:52:27,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246003479] [2022-03-18 17:52:27,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:52:27,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:52:27,593 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:52:27,594 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:52:27,594 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-18 17:52:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:52:27,605 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.6))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:52:27,607 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.7))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:52:27,609 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.8))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-18 17:52:27,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:52:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:52:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:52:27,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:52:27,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246003479] [2022-03-18 17:52:27,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246003479] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 17:52:27,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446897259] [2022-03-18 17:52:27,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 17:52:27,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:52:27,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 17:52:27,680 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 17:52:27,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-18 17:52:27,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 17:52:27,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 17:52:27,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-18 17:52:27,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 17:52:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:52:27,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 17:52:31,623 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_51_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_51_31) (<= aux_mod_v_main_~x~0_51_31 0) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse0) (and (or (< 0 (mod (+ aux_mod_v_main_~x~0_51_31 (* 4294967295 c_main_~x~0) c_main_~y~0) 4294967296)) (forall ((aux_div_v_main_~x~0_51_31 Int)) (or (not (< (+ aux_mod_v_main_~x~0_51_31 (* aux_div_v_main_~x~0_51_31 4294967296)) c_main_~x~0)) (exists ((v_it_6 Int)) (and (<= (+ aux_mod_v_main_~x~0_51_31 v_it_6 (* aux_div_v_main_~x~0_51_31 4294967296) 1) c_main_~x~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))) (forall ((aux_div_v_main_~x~0_51_31 Int) (aux_mod_v_main_~y~0_43_31 Int) (aux_div_v_main_~y~0_43_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_43_31 4294967296))) (or (<= aux_mod_v_main_~y~0_43_31 0) (<= (+ .cse1 aux_mod_v_main_~y~0_43_31 c_main_~x~0) (+ aux_mod_v_main_~x~0_51_31 c_main_~y~0 (* aux_div_v_main_~x~0_51_31 4294967296))) (<= c_main_~y~0 (+ .cse1 aux_mod_v_main_~y~0_43_31)) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 (* aux_div_v_main_~y~0_43_31 4294967296) aux_mod_v_main_~y~0_43_31 1) c_main_~y~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= 4294967296 aux_mod_v_main_~y~0_43_31) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_51_31 v_it_6 c_main_~y~0 (* aux_div_v_main_~x~0_51_31 4294967296) 1) (+ (* aux_div_v_main_~y~0_43_31 4294967296) aux_mod_v_main_~y~0_43_31 c_main_~x~0)) (not (< 0 (mod (+ aux_mod_v_main_~y~0_43_31 (* v_it_6 4294967295)) 4294967296)))))))))) (or .cse0 (forall ((aux_div_v_main_~x~0_51_31 Int)) (not (= (+ aux_mod_v_main_~x~0_51_31 (* aux_div_v_main_~x~0_51_31 4294967296)) c_main_~x~0)))))))) is different from false [2022-03-18 17:52:45,637 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_51_31 Int) (v_main_~x~0_53 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_51_31) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~x~0_51_31 Int)) (not (= (+ aux_mod_v_main_~x~0_51_31 (* aux_div_v_main_~x~0_51_31 4294967296)) v_main_~x~0_53)))) (or (not .cse0) (and (forall ((aux_div_v_main_~x~0_51_31 Int) (aux_mod_v_main_~y~0_43_31 Int) (aux_div_v_main_~y~0_43_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_43_31 4294967296))) (or (<= aux_mod_v_main_~y~0_43_31 0) (<= (+ v_main_~x~0_53 .cse1 aux_mod_v_main_~y~0_43_31) (+ aux_mod_v_main_~x~0_51_31 c_main_~y~0 (* aux_div_v_main_~x~0_51_31 4294967296))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_43_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ aux_mod_v_main_~x~0_51_31 v_it_6 c_main_~y~0 (* aux_div_v_main_~x~0_51_31 4294967296) 1) (+ v_main_~x~0_53 (* aux_div_v_main_~y~0_43_31 4294967296) aux_mod_v_main_~y~0_43_31)))) (<= c_main_~y~0 (+ .cse1 aux_mod_v_main_~y~0_43_31)) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 (* aux_div_v_main_~y~0_43_31 4294967296) aux_mod_v_main_~y~0_43_31 1) c_main_~y~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= 4294967296 aux_mod_v_main_~y~0_43_31)))) (or (forall ((aux_div_v_main_~x~0_51_31 Int)) (or (not (< (+ aux_mod_v_main_~x~0_51_31 (* aux_div_v_main_~x~0_51_31 4294967296)) v_main_~x~0_53)) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_51_31 v_it_6 (* aux_div_v_main_~x~0_51_31 4294967296) 1) v_main_~x~0_53) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))))) (< 0 (mod (+ aux_mod_v_main_~x~0_51_31 (* v_main_~x~0_53 4294967295) c_main_~y~0) 4294967296))))))) (<= aux_mod_v_main_~x~0_51_31 0) (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not (= v_main_~x~0_53 c_main_~x~0)) .cse2) (or (not .cse2) (not (< c_main_~x~0 v_main_~x~0_53)) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_53) (<= 1 v_it_5)))))))) is different from false [2022-03-18 17:52:47,668 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_51_31 Int) (v_main_~x~0_53 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_51_31) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~x~0_51_31 Int)) (not (= (+ aux_mod_v_main_~x~0_51_31 (* aux_div_v_main_~x~0_51_31 4294967296)) v_main_~x~0_53)))) (or (not .cse0) (and (forall ((aux_div_v_main_~x~0_51_31 Int) (aux_mod_v_main_~y~0_43_31 Int) (aux_div_v_main_~y~0_43_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_43_31 4294967296))) (or (<= aux_mod_v_main_~y~0_43_31 0) (<= (+ v_main_~x~0_53 .cse1 aux_mod_v_main_~y~0_43_31) (+ aux_mod_v_main_~x~0_51_31 c_main_~y~0 (* aux_div_v_main_~x~0_51_31 4294967296))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_43_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ aux_mod_v_main_~x~0_51_31 v_it_6 c_main_~y~0 (* aux_div_v_main_~x~0_51_31 4294967296) 1) (+ v_main_~x~0_53 (* aux_div_v_main_~y~0_43_31 4294967296) aux_mod_v_main_~y~0_43_31)))) (<= c_main_~y~0 (+ .cse1 aux_mod_v_main_~y~0_43_31)) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 (* aux_div_v_main_~y~0_43_31 4294967296) aux_mod_v_main_~y~0_43_31 1) c_main_~y~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= 4294967296 aux_mod_v_main_~y~0_43_31)))) (or (forall ((aux_div_v_main_~x~0_51_31 Int)) (or (not (< (+ aux_mod_v_main_~x~0_51_31 (* aux_div_v_main_~x~0_51_31 4294967296)) v_main_~x~0_53)) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_51_31 v_it_6 (* aux_div_v_main_~x~0_51_31 4294967296) 1) v_main_~x~0_53) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))))) (< 0 (mod (+ aux_mod_v_main_~x~0_51_31 (* v_main_~x~0_53 4294967295) c_main_~y~0) 4294967296))))))) (<= aux_mod_v_main_~x~0_51_31 0) (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not (= v_main_~x~0_53 c_main_~x~0)) .cse2) (or (not .cse2) (not (< c_main_~x~0 v_main_~x~0_53)) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_53) (<= 1 v_it_5)))))))) is different from true [2022-03-18 17:52:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-03-18 17:52:59,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446897259] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 17:52:59,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 17:52:59,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2022-03-18 17:52:59,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829556650] [2022-03-18 17:52:59,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 17:52:59,597 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-18 17:52:59,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:52:59,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-18 17:52:59,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=188, Unknown=4, NotChecked=58, Total=306 [2022-03-18 17:52:59,598 INFO L87 Difference]: Start difference. First operand 49 states and 78 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:53:12,505 WARN L232 SmtUtils]: Spent 12.75s on a formula simplification. DAG size of input: 101 DAG size of output: 98 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 17:53:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:53:12,648 INFO L93 Difference]: Finished difference Result 71 states and 108 transitions. [2022-03-18 17:53:12,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-18 17:53:12,648 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-18 17:53:12,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:53:12,648 INFO L225 Difference]: With dead ends: 71 [2022-03-18 17:53:12,648 INFO L226 Difference]: Without dead ends: 61 [2022-03-18 17:53:12,649 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=132, Invalid=472, Unknown=4, NotChecked=94, Total=702 [2022-03-18 17:53:12,649 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 48 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 17:53:12,649 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 74 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 86 Invalid, 0 Unknown, 74 Unchecked, 0.1s Time] [2022-03-18 17:53:12,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-18 17:53:12,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-03-18 17:53:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 48 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:53:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 84 transitions. [2022-03-18 17:53:12,651 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 84 transitions. Word has length 20 [2022-03-18 17:53:12,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:53:12,651 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 84 transitions. [2022-03-18 17:53:12,651 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:53:12,651 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 84 transitions. [2022-03-18 17:53:12,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 17:53:12,652 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:53:12,652 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:53:12,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-18 17:53:12,864 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-18 17:53:12,864 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:53:12,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:53:12,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1165808695, now seen corresponding path program 1 times [2022-03-18 17:53:12,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:53:12,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69754167] [2022-03-18 17:53:12,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:53:12,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:53:12,867 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-18 17:53:12,868 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:53:12,868 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-18 17:53:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:53:12,876 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.8))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-18 17:53:12,878 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.9))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:53:12,879 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.10))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-18 17:53:12,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:53:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:53:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 17:53:12,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:53:12,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69754167] [2022-03-18 17:53:12,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69754167] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 17:53:12,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096306687] [2022-03-18 17:53:12,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:53:12,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:53:12,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 17:53:12,969 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 17:53:12,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-18 17:53:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:53:13,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-18 17:53:13,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 17:53:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:53:13,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 17:53:21,359 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_57_31 Int) (v_main_~x~0_58 Int)) (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~x~0_57_31 Int)) (not (= v_main_~x~0_58 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296)))))) (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_57_31 v_it_6 (* aux_div_v_main_~x~0_57_31 4294967296) 1) v_main_~x~0_58) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (not (< (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296)) v_main_~x~0_58)))) (not .cse0)))) (<= aux_mod_v_main_~x~0_57_31 0) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not (= v_main_~x~0_58 c_main_~x~0)) .cse1) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_58) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not .cse1) (not (< c_main_~x~0 v_main_~x~0_58))))) (<= 4294967296 aux_mod_v_main_~x~0_57_31))) is different from false [2022-03-18 17:53:23,371 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_57_31 Int) (v_main_~x~0_58 Int)) (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~x~0_57_31 Int)) (not (= v_main_~x~0_58 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296)))))) (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_57_31 v_it_6 (* aux_div_v_main_~x~0_57_31 4294967296) 1) v_main_~x~0_58) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (not (< (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296)) v_main_~x~0_58)))) (not .cse0)))) (<= aux_mod_v_main_~x~0_57_31 0) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not (= v_main_~x~0_58 c_main_~x~0)) .cse1) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_58) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not .cse1) (not (< c_main_~x~0 v_main_~x~0_58))))) (<= 4294967296 aux_mod_v_main_~x~0_57_31))) is different from true [2022-03-18 17:53:51,576 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_57_31 Int)) (or (and (forall ((aux_mod_v_main_~y~0_47_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse0) (forall ((aux_div_v_main_~y~0_47_31 Int)) (or (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31))) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse1) (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 c_main_~y~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< (+ c_main_~x~0 c_main_~y~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))))))) (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (not (= (+ c_main_~x~0 c_main_~y~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))))) .cse1))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)) (<= 1 v_it_4)))))) (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296)))))) (not (< 0 (mod c_main_~z~0 4294967296))) (forall ((aux_div_v_main_~y~0_47_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31) c_main_~y~0))) .cse0))) (< aux_mod_v_main_~y~0_47_31 0) (< 0 aux_mod_v_main_~y~0_47_31))) (forall ((aux_mod_v_main_~y~0_47_31 Int) (aux_div_v_main_~x~0_57_31 Int) (v_main_~x~0_58 Int)) (or (<= 4294967296 aux_mod_v_main_~y~0_47_31) (<= aux_mod_v_main_~y~0_47_31 0) (let ((.cse2 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not (= (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_47_31) 4294967296) 0)) .cse2 (let ((.cse3 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not (= v_main_~x~0_58 c_main_~x~0)) .cse3) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_58) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not .cse3) (not (< c_main_~x~0 v_main_~x~0_58)))))) (or (not .cse2) (forall ((aux_div_v_main_~y~0_47_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_47_31 4294967296))) (or (not (< c_main_~y~0 (+ .cse4 aux_mod_v_main_~y~0_47_31))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)) (<= 1 v_it_4))) (let ((.cse7 (< 0 (mod c_main_~z~0 4294967296))) (.cse5 (+ c_main_~x~0 c_main_~y~0)) (.cse6 (+ v_main_~x~0_58 .cse4 aux_mod_v_main_~y~0_47_31))) (and (or (not (= .cse5 .cse6)) .cse7) (or (not .cse7) (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 c_main_~y~0 1) (+ v_main_~x~0_58 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)))) (not (< .cse5 .cse6))))))))))) (<= v_main_~x~0_58 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_57_31 v_it_6 (* aux_div_v_main_~x~0_57_31 4294967296) 1) v_main_~x~0_58) (not (< 0 (mod (+ aux_mod_v_main_~y~0_47_31 (* v_it_6 4294967295)) 4294967296)))))))) (<= aux_mod_v_main_~x~0_57_31 0) (<= 4294967296 aux_mod_v_main_~x~0_57_31))) is different from false [2022-03-18 17:53:53,595 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_57_31 Int)) (or (and (forall ((aux_mod_v_main_~y~0_47_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse0) (forall ((aux_div_v_main_~y~0_47_31 Int)) (or (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31))) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse1) (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 c_main_~y~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< (+ c_main_~x~0 c_main_~y~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))))))) (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (not (= (+ c_main_~x~0 c_main_~y~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))))) .cse1))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)) (<= 1 v_it_4)))))) (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296)))))) (not (< 0 (mod c_main_~z~0 4294967296))) (forall ((aux_div_v_main_~y~0_47_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31) c_main_~y~0))) .cse0))) (< aux_mod_v_main_~y~0_47_31 0) (< 0 aux_mod_v_main_~y~0_47_31))) (forall ((aux_mod_v_main_~y~0_47_31 Int) (aux_div_v_main_~x~0_57_31 Int) (v_main_~x~0_58 Int)) (or (<= 4294967296 aux_mod_v_main_~y~0_47_31) (<= aux_mod_v_main_~y~0_47_31 0) (let ((.cse2 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not (= (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_47_31) 4294967296) 0)) .cse2 (let ((.cse3 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not (= v_main_~x~0_58 c_main_~x~0)) .cse3) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_58) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not .cse3) (not (< c_main_~x~0 v_main_~x~0_58)))))) (or (not .cse2) (forall ((aux_div_v_main_~y~0_47_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_47_31 4294967296))) (or (not (< c_main_~y~0 (+ .cse4 aux_mod_v_main_~y~0_47_31))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)) (<= 1 v_it_4))) (let ((.cse7 (< 0 (mod c_main_~z~0 4294967296))) (.cse5 (+ c_main_~x~0 c_main_~y~0)) (.cse6 (+ v_main_~x~0_58 .cse4 aux_mod_v_main_~y~0_47_31))) (and (or (not (= .cse5 .cse6)) .cse7) (or (not .cse7) (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 c_main_~y~0 1) (+ v_main_~x~0_58 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)))) (not (< .cse5 .cse6))))))))))) (<= v_main_~x~0_58 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_57_31 v_it_6 (* aux_div_v_main_~x~0_57_31 4294967296) 1) v_main_~x~0_58) (not (< 0 (mod (+ aux_mod_v_main_~y~0_47_31 (* v_it_6 4294967295)) 4294967296)))))))) (<= aux_mod_v_main_~x~0_57_31 0) (<= 4294967296 aux_mod_v_main_~x~0_57_31))) is different from true [2022-03-18 17:54:42,774 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_57_31 Int) (aux_mod_main_~y~0_26 Int)) (or (< aux_mod_main_~y~0_26 0) (< 0 aux_mod_main_~y~0_26) (<= aux_mod_v_main_~x~0_57_31 0) (<= 4294967296 aux_mod_v_main_~x~0_57_31) (and (forall ((aux_mod_v_main_~y~0_47_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296)))))) (not (< 0 (mod c_main_~z~0 4294967296))) (forall ((aux_div_main_~y~0_26 Int) (aux_div_v_main_~y~0_47_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31) (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26))))) .cse0) (or (not .cse0) (forall ((aux_div_main_~y~0_26 Int) (aux_div_v_main_~y~0_47_31 Int)) (or (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse1) (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (not (< (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296)))) (exists ((v_it_5 Int)) (and (<= (+ aux_mod_main_~y~0_26 v_it_5 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5)))))) (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (not (= (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))))) .cse1))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)))) (not (< (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26)) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)))))))) (< aux_mod_v_main_~y~0_47_31 0) (< 0 aux_mod_v_main_~y~0_47_31))) (or (not (< 0 (mod c_main_~x~0 4294967296))) (forall ((aux_div_main_~y~0_26 Int) (aux_mod_v_main_~y~0_47_31 Int) (aux_div_v_main_~y~0_47_31 Int) (aux_div_v_main_~x~0_57_31 Int) (v_main_~x~0_58 Int)) (let ((.cse6 (* 4294967296 aux_div_main_~y~0_26)) (.cse5 (* aux_div_v_main_~y~0_47_31 4294967296))) (or (let ((.cse4 (< 0 (mod c_main_~z~0 4294967296))) (.cse2 (+ aux_mod_main_~y~0_26 .cse6 c_main_~x~0)) (.cse3 (+ v_main_~x~0_58 .cse5 aux_mod_v_main_~y~0_47_31))) (and (or (not (= .cse2 .cse3)) .cse4) (or (not .cse4) (not (< .cse2 .cse3)) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ aux_mod_main_~y~0_26 v_it_5 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0 1) (+ v_main_~x~0_58 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31))))))) (<= 4294967296 aux_mod_v_main_~y~0_47_31) (<= aux_mod_v_main_~y~0_47_31 0) (<= v_main_~x~0_58 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_57_31 v_it_6 (* aux_div_v_main_~x~0_57_31 4294967296) 1) v_main_~x~0_58) (not (< 0 (mod (+ aux_mod_v_main_~y~0_47_31 (* v_it_6 4294967295)) 4294967296))))) (not (< (+ aux_mod_main_~y~0_26 .cse6) (+ .cse5 aux_mod_v_main_~y~0_47_31)))))))))) is different from true [2022-03-18 17:54:46,859 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_57_31 Int) (aux_mod_main_~y~0_26 Int)) (or (let ((.cse2 (not (< 0 (mod c_main_~x~0 4294967296))))) (and (or (forall ((aux_div_main_~y~0_26 Int) (aux_mod_v_main_~y~0_47_31 Int) (aux_div_v_main_~y~0_47_31 Int) (aux_div_v_main_~x~0_57_31 Int)) (let ((.cse0 (* 4294967296 aux_div_main_~y~0_26)) (.cse1 (* aux_div_v_main_~y~0_47_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_47_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ aux_mod_v_main_~x~0_57_31 v_it_6 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296) 1) (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0)))) (<= 4294967296 aux_mod_v_main_~y~0_47_31) (<= aux_mod_v_main_~y~0_47_31 0) (<= (+ aux_mod_main_~y~0_26 .cse0 c_main_~x~0) (+ aux_mod_v_main_~x~0_57_31 .cse1 aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)))) (not (< (+ aux_mod_main_~y~0_26 .cse0) (+ .cse1 aux_mod_v_main_~y~0_47_31)))))) .cse2) (or (forall ((aux_div_main_~y~0_26 Int) (aux_div_v_main_~y~0_47_31 Int) (aux_div_v_main_~x~0_57_31 Int)) (let ((.cse3 (* aux_div_v_main_~x~0_57_31 4294967296))) (let ((.cse5 (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0)) (.cse4 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) .cse3))) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ aux_mod_v_main_~x~0_57_31 v_it_4 (* aux_div_v_main_~x~0_57_31 4294967296) 1) c_main_~x~0) (<= 1 v_it_4))) (not (< (+ aux_mod_v_main_~x~0_57_31 .cse3) c_main_~x~0)) (< .cse4 .cse5) (< .cse5 .cse4))))) .cse2))) (< aux_mod_main_~y~0_26 0) (< 0 aux_mod_main_~y~0_26) (<= aux_mod_v_main_~x~0_57_31 0) (<= 4294967296 aux_mod_v_main_~x~0_57_31))) is different from true [2022-03-18 17:54:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-18 17:54:48,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096306687] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 17:54:48,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 17:54:48,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 19 [2022-03-18 17:54:48,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955063040] [2022-03-18 17:54:48,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 17:54:48,861 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-18 17:54:48,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:54:48,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-18 17:54:48,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=163, Unknown=8, NotChecked=116, Total=342 [2022-03-18 17:54:48,862 INFO L87 Difference]: Start difference. First operand 53 states and 84 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:54:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:54:56,202 INFO L93 Difference]: Finished difference Result 74 states and 113 transitions. [2022-03-18 17:54:56,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-18 17:54:56,202 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-18 17:54:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:54:56,202 INFO L225 Difference]: With dead ends: 74 [2022-03-18 17:54:56,203 INFO L226 Difference]: Without dead ends: 68 [2022-03-18 17:54:56,203 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=128, Invalid=432, Unknown=8, NotChecked=188, Total=756 [2022-03-18 17:54:56,203 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 50 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 17:54:56,203 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 60 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 104 Invalid, 0 Unknown, 123 Unchecked, 0.1s Time] [2022-03-18 17:54:56,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-03-18 17:54:56,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2022-03-18 17:54:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.68) internal successors, (84), 50 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:54:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 88 transitions. [2022-03-18 17:54:56,205 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 88 transitions. Word has length 20 [2022-03-18 17:54:56,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:54:56,205 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 88 transitions. [2022-03-18 17:54:56,205 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:54:56,205 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 88 transitions. [2022-03-18 17:54:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 17:54:56,206 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:54:56,206 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:54:56,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-18 17:54:56,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-18 17:54:56,417 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:54:56,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:54:56,418 INFO L85 PathProgramCache]: Analyzing trace with hash -392821618, now seen corresponding path program 2 times [2022-03-18 17:54:56,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:54:56,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021704532] [2022-03-18 17:54:56,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:54:56,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:54:56,425 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-18 17:54:56,428 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:54:56,429 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_12 .cse0 (* (- 4294967296) (div (+ main_~z~0_12 .cse0) 4294967296)))) 0)) [2022-03-18 17:54:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:54:56,435 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.6))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-18 17:54:56,437 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.7))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:54:56,438 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.8))) (+ main_~z~0_12 .cse0 (* (- 4294967296) (div (+ main_~z~0_12 .cse0) 4294967296)))) 0)) [2022-03-18 17:54:56,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:54:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:54:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 17:54:56,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:54:56,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021704532] [2022-03-18 17:54:56,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021704532] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 17:54:56,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117920251] [2022-03-18 17:54:56,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 17:54:56,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:54:56,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 17:54:56,517 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 17:54:56,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-18 17:54:56,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 17:54:56,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 17:54:56,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-18 17:54:56,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 17:54:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 17:54:56,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 17:56:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 17:56:40,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117920251] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 17:56:40,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 17:56:40,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 9] total 16 [2022-03-18 17:56:40,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913808977] [2022-03-18 17:56:40,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 17:56:40,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-18 17:56:40,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 17:56:40,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-18 17:56:40,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=168, Unknown=25, NotChecked=0, Total=240 [2022-03-18 17:56:40,354 INFO L87 Difference]: Start difference. First operand 55 states and 88 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:56:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 17:56:43,947 INFO L93 Difference]: Finished difference Result 73 states and 113 transitions. [2022-03-18 17:56:43,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-18 17:56:43,948 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-18 17:56:43,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 17:56:43,948 INFO L225 Difference]: With dead ends: 73 [2022-03-18 17:56:43,948 INFO L226 Difference]: Without dead ends: 69 [2022-03-18 17:56:43,949 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 61.0s TimeCoverageRelationStatistics Valid=117, Invalid=409, Unknown=26, NotChecked=0, Total=552 [2022-03-18 17:56:43,949 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 53 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 17:56:43,949 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 58 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2022-03-18 17:56:43,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-03-18 17:56:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-03-18 17:56:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:56:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 93 transitions. [2022-03-18 17:56:43,951 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 93 transitions. Word has length 20 [2022-03-18 17:56:43,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 17:56:43,951 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 93 transitions. [2022-03-18 17:56:43,951 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 17:56:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-03-18 17:56:43,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 17:56:43,953 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 17:56:43,953 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 17:56:43,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-03-18 17:56:44,159 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:56:44,160 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 17:56:44,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 17:56:44,160 INFO L85 PathProgramCache]: Analyzing trace with hash -127189554, now seen corresponding path program 1 times [2022-03-18 17:56:44,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 17:56:44,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907152500] [2022-03-18 17:56:44,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:56:44,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 17:56:44,163 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:56:44,163 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:56:44,164 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_10 .cse0 (* (- 4294967296) (div (+ main_~z~0_10 .cse0) 4294967296)))) 0)) [2022-03-18 17:56:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:56:44,172 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.4))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-18 17:56:44,174 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.5))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-18 17:56:44,178 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.6))) (+ main_~z~0_10 .cse0 (* (- 4294967296) (div (+ main_~z~0_10 .cse0) 4294967296)))) 0)) [2022-03-18 17:56:44,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 17:56:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 17:56:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-18 17:56:44,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 17:56:44,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907152500] [2022-03-18 17:56:44,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907152500] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 17:56:44,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675382707] [2022-03-18 17:56:44,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 17:56:44,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 17:56:44,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 17:56:44,358 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 17:56:44,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process