/usr/bin/java -ea -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/sum_by_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:58:05,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:58:05,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:58:05,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:58:05,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:58:05,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:58:05,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:58:05,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:58:05,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:58:05,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:58:05,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:58:05,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:58:05,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:58:05,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:58:05,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:58:05,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:58:05,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:58:05,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:58:05,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:58:05,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:58:05,842 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:58:05,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:58:05,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:58:05,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:58:05,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:58:05,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:58:05,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:58:05,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:58:05,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:58:05,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:58:05,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:58:05,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:58:05,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:58:05,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:58:05,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:58:05,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:58:05,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:58:05,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:58:05,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:58:05,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:58:05,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:58:05,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:58:05,855 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:58:05,863 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:58:05,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:58:05,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:58:05,864 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:58:05,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:58:05,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:58:05,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:58:05,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:58:05,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:58:05,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:58:05,865 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:58:05,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:58:05,865 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:58:05,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:58:05,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:58:05,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:58:05,865 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:58:05,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:58:05,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:58:05,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:58:05,866 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:58:05,866 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:58:05,866 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-04-27 16:58:06,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:58:06,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:58:06,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:58:06,067 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:58:06,068 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:58:06,069 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-04-27 16:58:06,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9571af35/29efe95c14f144f5a37c86412ee3365b/FLAG68e43f346 [2022-04-27 16:58:06,454 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:58:06,454 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-04-27 16:58:06,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9571af35/29efe95c14f144f5a37c86412ee3365b/FLAG68e43f346 [2022-04-27 16:58:06,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9571af35/29efe95c14f144f5a37c86412ee3365b [2022-04-27 16:58:06,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:58:06,905 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:58:06,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:58:06,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:58:06,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:58:06,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:58:06" (1/1) ... [2022-04-27 16:58:06,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5078dec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:06, skipping insertion in model container [2022-04-27 16:58:06,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:58:06" (1/1) ... [2022-04-27 16:58:06,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:58:06,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:58:07,034 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/sum_by_3.c[406,419] [2022-04-27 16:58:07,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:58:07,048 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:58:07,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_by_3.c[406,419] [2022-04-27 16:58:07,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:58:07,067 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:58:07,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:07 WrapperNode [2022-04-27 16:58:07,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:58:07,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:58:07,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:58:07,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:58:07,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:07" (1/1) ... [2022-04-27 16:58:07,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:07" (1/1) ... [2022-04-27 16:58:07,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:07" (1/1) ... [2022-04-27 16:58:07,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:07" (1/1) ... [2022-04-27 16:58:07,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:07" (1/1) ... [2022-04-27 16:58:07,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:07" (1/1) ... [2022-04-27 16:58:07,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:07" (1/1) ... [2022-04-27 16:58:07,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:58:07,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:58:07,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:58:07,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:58:07,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:07" (1/1) ... [2022-04-27 16:58:07,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:58:07,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:58:07,116 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-04-27 16:58:07,120 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-04-27 16:58:07,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:58:07,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:58:07,141 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:58:07,141 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:58:07,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:58:07,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:58:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:58:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 16:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:58:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:58:07,180 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:58:07,181 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:58:07,307 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:58:07,313 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:58:07,313 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 16:58:07,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:58:07 BoogieIcfgContainer [2022-04-27 16:58:07,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:58:07,315 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:58:07,315 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:58:07,316 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:58:07,318 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:58:07" (1/1) ... [2022-04-27 16:58:07,319 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:58:11,671 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-27 16:58:14,453 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-27 16:58:14,625 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 16:58:14,626 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_11 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[main_~i~0] to Formula: (let ((.cse1 (mod v_main_~i~0_6 4294967296)) (.cse0 (mod v_main_~n~0_11 4294967296))) (or (and (= v_main_~i~0_6 v_main_~i~0_5) (<= .cse0 .cse1)) (and (< v_main_~i~0_6 v_main_~i~0_5) (<= (div (+ .cse0 (* (- 1) v_main_~i~0_5)) (- 4294967296)) (+ (div (+ v_main_~i~0_6 (- 4294967295)) 4294967296) 1)) (< .cse1 .cse0)))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[main_~i~0] [2022-04-27 16:58:18,835 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-27 16:58:20,156 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-27 16:58:20,672 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 16:58:20,673 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (< (mod v_main_~j~0_3 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~j~0] to Formula: (let ((.cse0 (mod v_main_~n~0_2 4294967296)) (.cse1 (mod v_main_~j~0_3 4294967296))) (or (and (<= (div (+ .cse0 (* (- 1) v_main_~j~0_2)) (- 4294967296)) (+ (div (+ v_main_~j~0_3 (- 4294967295)) 4294967296) 1)) (< .cse1 .cse0) (< v_main_~j~0_3 v_main_~j~0_2)) (and (= v_main_~j~0_3 v_main_~j~0_2) (<= .cse0 .cse1)))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~j~0] [2022-04-27 16:58:24,830 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-27 16:58:25,995 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-27 16:58:26,155 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 16:58:26,155 INFO L91 elerationTransformer]: Accelerated Formula: (and (< (mod v_main_~k~0_5 4294967296) (mod v_main_~n~0_9 4294967296)) (= v_main_~k~0_4 (+ v_main_~k~0_5 1))) InVars {main_~k~0=v_main_~k~0_5, main_~n~0=v_main_~n~0_9} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~k~0] to Formula: (let ((.cse1 (mod v_main_~n~0_9 4294967296)) (.cse0 (mod v_main_~k~0_5 4294967296))) (or (and (< .cse0 .cse1) (< v_main_~k~0_5 v_main_~k~0_4) (<= (div (+ .cse1 (* (- 1) v_main_~k~0_4)) (- 4294967296)) (+ (div (+ v_main_~k~0_5 (- 4294967295)) 4294967296) 1))) (and (<= .cse1 .cse0) (= v_main_~k~0_5 v_main_~k~0_4)))) InVars {main_~k~0=v_main_~k~0_5, main_~n~0=v_main_~n~0_9} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~k~0] [2022-04-27 16:58:26,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:58:26 BasicIcfg [2022-04-27 16:58:26,161 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:58:26,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:58:26,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:58:26,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:58:26,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:58:06" (1/4) ... [2022-04-27 16:58:26,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a355336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:58:26, skipping insertion in model container [2022-04-27 16:58:26,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:07" (2/4) ... [2022-04-27 16:58:26,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a355336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:58:26, skipping insertion in model container [2022-04-27 16:58:26,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:58:07" (3/4) ... [2022-04-27 16:58:26,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a355336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:58:26, skipping insertion in model container [2022-04-27 16:58:26,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:58:26" (4/4) ... [2022-04-27 16:58:26,169 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_by_3.cJordan [2022-04-27 16:58:26,179 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:58:26,180 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:58:26,223 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:58:26,229 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ba15be6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6b35b4d7 [2022-04-27 16:58:26,229 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:58:26,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:58:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 16:58:26,239 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:58:26,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:58:26,240 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:58:26,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:58:26,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1502834522, now seen corresponding path program 1 times [2022-04-27 16:58:26,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:58:26,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879426847] [2022-04-27 16:58:26,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:58:26,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:58:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:58:26,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:58:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:58:26,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {27#true} is VALID [2022-04-27 16:58:26,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 16:58:26,379 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 16:58:26,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:58:26,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {27#true} is VALID [2022-04-27 16:58:26,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 16:58:26,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 16:58:26,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 16:58:26,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} [82] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {27#true} is VALID [2022-04-27 16:58:26,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} [85] L19-->L21-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~i~0] {27#true} is VALID [2022-04-27 16:58:26,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} [87] L21-2-->L21-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 16:58:26,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} [90] L21-3-->L25-2: Formula: (= v_main_~j~0_6 (let ((.cse0 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {28#false} is VALID [2022-04-27 16:58:26,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} [91] L25-2-->L25-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 16:58:26,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} [94] L25-3-->L29-2: Formula: (= v_main_~j~0_4 v_main_~k~0_1) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {28#false} is VALID [2022-04-27 16:58:26,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} [96] L29-2-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 16:58:26,383 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} [98] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod (+ v_main_~i~0_8 v_main_~j~0_7 v_main_~k~0_7) 4294967296) 3) 4294967296) (mod v_~SIZE~0_7 4294967296)) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {28#false} is VALID [2022-04-27 16:58:26,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} [100] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {28#false} is VALID [2022-04-27 16:58:26,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} [101] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 16:58:26,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 16:58:26,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:58:26,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:58:26,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879426847] [2022-04-27 16:58:26,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879426847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:58:26,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:58:26,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:58:26,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776555790] [2022-04-27 16:58:26,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:58:26,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 16:58:26,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:58:26,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:26,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:58:26,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:58:26,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:58:26,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:58:26,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:58:26,432 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:58:26,483 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 16:58:26,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:58:26,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 16:58:26,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:58:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-04-27 16:58:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-04-27 16:58:26,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2022-04-27 16:58:26,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:58:26,532 INFO L225 Difference]: With dead ends: 24 [2022-04-27 16:58:26,532 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 16:58:26,533 INFO L412 NwaCegarLoop]: 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-04-27 16:58:26,536 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:58:26,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:58:26,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 16:58:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 16:58:26,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:58:26,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:26,556 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:26,556 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:26,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:58:26,561 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 16:58:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 16:58:26,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:58:26,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:58:26,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 16:58:26,563 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 16:58:26,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:58:26,567 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 16:58:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 16:58:26,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:58:26,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:58:26,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:58:26,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:58:26,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 16:58:26,574 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2022-04-27 16:58:26,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:58:26,574 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 16:58:26,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:26,575 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 16:58:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 16:58:26,575 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:58:26,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:58:26,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:58:26,575 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:58:26,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:58:26,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1872181992, now seen corresponding path program 1 times [2022-04-27 16:58:26,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:58:26,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479308074] [2022-04-27 16:58:26,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:58:26,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:58:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:58:26,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:58:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:58:26,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {121#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {115#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:58:26,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:58:26,931 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {110#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:58:26,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {110#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:58:26,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {115#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:58:26,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {115#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:58:26,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {110#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:58:26,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {115#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:58:26,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {115#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [82] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {115#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:58:26,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {115#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [85] L19-->L21-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~i~0] {116#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 16:58:26,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {116#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} [88] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {116#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 16:58:26,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {116#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} [90] L21-3-->L25-2: Formula: (= v_main_~j~0_6 (let ((.cse0 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {117#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 16:58:26,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {117#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} [92] L25-2-->L25-3: Formula: (not (< (mod v_main_~j~0_1 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {117#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 16:58:26,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {117#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} [94] L25-3-->L29-2: Formula: (= v_main_~j~0_4 v_main_~k~0_1) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {118#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} is VALID [2022-04-27 16:58:26,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {118#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} [96] L29-2-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {118#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} is VALID [2022-04-27 16:58:26,940 INFO L272 TraceCheckUtils]: 12: Hoare triple {118#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} [98] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod (+ v_main_~i~0_8 v_main_~j~0_7 v_main_~k~0_7) 4294967296) 3) 4294967296) (mod v_~SIZE~0_7 4294967296)) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {119#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:58:26,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {119#(not (= |__VERIFIER_assert_#in~cond| 0))} [100] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {120#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:58:26,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {120#(not (= __VERIFIER_assert_~cond 0))} [101] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {111#false} is VALID [2022-04-27 16:58:26,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {111#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#false} is VALID [2022-04-27 16:58:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:58:26,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:58:26,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479308074] [2022-04-27 16:58:26,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479308074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:58:26,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:58:26,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 16:58:26,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828127999] [2022-04-27 16:58:26,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:58:26,945 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 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) Word has length 16 [2022-04-27 16:58:26,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:58:26,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 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-04-27 16:58:26,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:58:26,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 16:58:26,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:58:26,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 16:58:26,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-27 16:58:26,976 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 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-04-27 16:58:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:58:27,318 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-27 16:58:27,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 16:58:27,319 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 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) Word has length 16 [2022-04-27 16:58:27,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:58:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 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-04-27 16:58:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2022-04-27 16:58:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 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-04-27 16:58:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2022-04-27 16:58:27,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2022-04-27 16:58:27,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:58:27,379 INFO L225 Difference]: With dead ends: 31 [2022-04-27 16:58:27,379 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 16:58:27,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-04-27 16:58:27,380 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 67 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:58:27,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 23 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:58:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 16:58:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-04-27 16:58:27,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:58:27,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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-04-27 16:58:27,383 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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-04-27 16:58:27,384 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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-04-27 16:58:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:58:27,385 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-27 16:58:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-27 16:58:27,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:58:27,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:58:27,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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) Second operand 28 states. [2022-04-27 16:58:27,386 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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) Second operand 28 states. [2022-04-27 16:58:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:58:27,387 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-27 16:58:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-27 16:58:27,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:58:27,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:58:27,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:58:27,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:58:27,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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-04-27 16:58:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-27 16:58:27,388 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2022-04-27 16:58:27,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:58:27,388 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-27 16:58:27,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 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-04-27 16:58:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-27 16:58:27,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 16:58:27,389 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:58:27,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:58:27,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:58:27,389 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:58:27,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:58:27,390 INFO L85 PathProgramCache]: Analyzing trace with hash -2065178785, now seen corresponding path program 1 times [2022-04-27 16:58:27,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:58:27,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030427336] [2022-04-27 16:58:27,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:58:27,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:58:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:58:27,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:58:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:58:27,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {258#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {250#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:58:27,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {250#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:58:27,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {250#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {245#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:58:27,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {245#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:58:27,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {250#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:58:27,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:58:27,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {245#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:58:27,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:58:27,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {250#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [82] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {250#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:58:27,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {250#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [85] L19-->L21-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~i~0] {251#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 16:58:27,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {251#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} [88] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {252#(and (<= 20000001 ~SIZE~0) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 16:58:27,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {252#(and (<= 20000001 ~SIZE~0) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} [90] L21-3-->L25-2: Formula: (= v_main_~j~0_6 (let ((.cse0 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {253#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 16:58:27,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {253#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} [92] L25-2-->L25-3: Formula: (not (< (mod v_main_~j~0_1 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {253#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 16:58:27,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {253#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} [94] L25-3-->L29-2: Formula: (= v_main_~j~0_4 v_main_~k~0_1) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {254#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0) (= (+ (* (- 1) main_~k~0) main_~j~0) 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 16:58:27,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {254#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0) (= (+ (* (- 1) main_~k~0) main_~j~0) 0) (<= (div ~SIZE~0 4294967296) 0))} [97] L29-2-->L29-2: Formula: (let ((.cse1 (mod v_main_~n~0_9 4294967296)) (.cse0 (mod v_main_~k~0_5 4294967296))) (or (and (< .cse0 .cse1) (< v_main_~k~0_5 v_main_~k~0_4) (<= (div (+ .cse1 (* (- 1) v_main_~k~0_4)) (- 4294967296)) (+ (div (+ v_main_~k~0_5 (- 4294967295)) 4294967296) 1))) (and (<= .cse1 .cse0) (= v_main_~k~0_5 v_main_~k~0_4)))) InVars {main_~k~0=v_main_~k~0_5, main_~n~0=v_main_~n~0_9} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~k~0] {255#(and (<= (+ main_~k~0 60000003) (+ main_~j~0 (* ~SIZE~0 3))) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 16:58:27,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {255#(and (<= (+ main_~k~0 60000003) (+ main_~j~0 (* ~SIZE~0 3))) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} [96] L29-2-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {255#(and (<= (+ main_~k~0 60000003) (+ main_~j~0 (* ~SIZE~0 3))) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 16:58:27,748 INFO L272 TraceCheckUtils]: 13: Hoare triple {255#(and (<= (+ main_~k~0 60000003) (+ main_~j~0 (* ~SIZE~0 3))) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} [98] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod (+ v_main_~i~0_8 v_main_~j~0_7 v_main_~k~0_7) 4294967296) 3) 4294967296) (mod v_~SIZE~0_7 4294967296)) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {256#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:58:27,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {256#(not (= |__VERIFIER_assert_#in~cond| 0))} [100] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {257#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:58:27,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {257#(not (= __VERIFIER_assert_~cond 0))} [101] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {246#false} is VALID [2022-04-27 16:58:27,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#false} is VALID [2022-04-27 16:58:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:58:27,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:58:27,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030427336] [2022-04-27 16:58:27,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030427336] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:58:27,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016579176] [2022-04-27 16:58:27,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:58:27,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:58:27,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:58:27,754 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-04-27 16:58:27,756 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-04-27 16:58:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:58:27,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 16:58:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:58:27,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:58:28,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {245#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 16:58:28,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#true} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {245#true} is VALID [2022-04-27 16:58:28,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {245#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 16:58:28,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {245#true} {245#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 16:58:28,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {245#true} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 16:58:28,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {245#true} [82] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {245#true} is VALID [2022-04-27 16:58:28,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {245#true} [85] L19-->L21-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~i~0] {280#(= main_~i~0 0)} is VALID [2022-04-27 16:58:28,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {280#(= main_~i~0 0)} [88] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {280#(= main_~i~0 0)} is VALID [2022-04-27 16:58:28,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {280#(= main_~i~0 0)} [90] L21-3-->L25-2: Formula: (= v_main_~j~0_6 (let ((.cse0 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {287#(and (= main_~i~0 0) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-27 16:58:28,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {287#(and (= main_~i~0 0) (= (mod main_~i~0 4294967296) main_~j~0))} [92] L25-2-->L25-3: Formula: (not (< (mod v_main_~j~0_1 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {291#(and (= main_~i~0 0) (= (mod main_~i~0 4294967296) main_~j~0) (not (< (mod main_~j~0 4294967296) (mod main_~n~0 4294967296))))} is VALID [2022-04-27 16:58:28,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {291#(and (= main_~i~0 0) (= (mod main_~i~0 4294967296) main_~j~0) (not (< (mod main_~j~0 4294967296) (mod main_~n~0 4294967296))))} [94] L25-3-->L29-2: Formula: (= v_main_~j~0_4 v_main_~k~0_1) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {295#(and (= main_~i~0 0) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0) (not (< (mod main_~j~0 4294967296) (mod main_~n~0 4294967296))))} is VALID [2022-04-27 16:58:28,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {295#(and (= main_~i~0 0) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0) (not (< (mod main_~j~0 4294967296) (mod main_~n~0 4294967296))))} [97] L29-2-->L29-2: Formula: (let ((.cse1 (mod v_main_~n~0_9 4294967296)) (.cse0 (mod v_main_~k~0_5 4294967296))) (or (and (< .cse0 .cse1) (< v_main_~k~0_5 v_main_~k~0_4) (<= (div (+ .cse1 (* (- 1) v_main_~k~0_4)) (- 4294967296)) (+ (div (+ v_main_~k~0_5 (- 4294967295)) 4294967296) 1))) (and (<= .cse1 .cse0) (= v_main_~k~0_5 v_main_~k~0_4)))) InVars {main_~k~0=v_main_~k~0_5, main_~n~0=v_main_~n~0_9} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~k~0] {299#(and (= main_~i~0 0) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-27 16:58:28,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {299#(and (= main_~i~0 0) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} [96] L29-2-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {299#(and (= main_~i~0 0) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-27 16:58:28,070 INFO L272 TraceCheckUtils]: 13: Hoare triple {299#(and (= main_~i~0 0) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} [98] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod (+ v_main_~i~0_8 v_main_~j~0_7 v_main_~k~0_7) 4294967296) 3) 4294967296) (mod v_~SIZE~0_7 4294967296)) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:58:28,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} [100] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:58:28,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} [101] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {246#false} is VALID [2022-04-27 16:58:28,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#false} is VALID [2022-04-27 16:58:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:58:28,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:59:09,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#false} is VALID [2022-04-27 16:59:09,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} [101] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {246#false} is VALID [2022-04-27 16:59:09,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} [100] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:59:09,079 INFO L272 TraceCheckUtils]: 13: Hoare triple {326#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) 0)} [98] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod (+ v_main_~i~0_8 v_main_~j~0_7 v_main_~k~0_7) 4294967296) 3) 4294967296) (mod v_~SIZE~0_7 4294967296)) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:59:09,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {326#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) 0)} [96] L29-2-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {326#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) 0)} is VALID [2022-04-27 16:59:09,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {333#(forall ((aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int)) (or (and (or (forall ((aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int) (aux_div_aux_mod_aux_mod_v_main_~k~0_12_55_33_289 Int)) (or (< (+ (* aux_div_aux_mod_aux_mod_v_main_~k~0_12_55_33_289 4294967296) (mod main_~n~0 4294967296) main_~i~0 main_~j~0) (+ (* aux_div_v_main_~k~0_12_55 4294967296) (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 4294967295) (+ main_~i~0 main_~k~0 main_~j~0)) (<= 4294967296 (+ (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 2 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ main_~i~0 main_~k~0 main_~j~0)) (< (+ (div (+ main_~k~0 (- 4294967295)) 4294967296) 1) aux_div_aux_mod_aux_mod_v_main_~k~0_12_55_33_289) (<= (+ 3 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) 0) (<= (+ (* aux_div_aux_mod_aux_mod_v_main_~k~0_12_55_33_289 4294967296) (mod main_~n~0 4294967296)) main_~k~0))) (not (< (mod main_~k~0 4294967296) (mod main_~n~0 4294967296)))) (or (not (<= (mod main_~n~0 4294967296) (mod main_~k~0 4294967296))) (forall ((aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int)) (or (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 3 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ main_~i~0 main_~k~0 main_~j~0)) (< (+ main_~i~0 main_~k~0 main_~j~0) (* aux_div_v_main_~k~0_12_55 4294967296)) (< (+ main_~i~0 main_~k~0 main_~j~0) (+ (* aux_div_v_main_~k~0_12_55 4294967296) (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 4294967296) (+ main_~i~0 main_~k~0 main_~j~0)))))) (<= aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 0) (<= 4294967296 aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53)))} [97] L29-2-->L29-2: Formula: (let ((.cse1 (mod v_main_~n~0_9 4294967296)) (.cse0 (mod v_main_~k~0_5 4294967296))) (or (and (< .cse0 .cse1) (< v_main_~k~0_5 v_main_~k~0_4) (<= (div (+ .cse1 (* (- 1) v_main_~k~0_4)) (- 4294967296)) (+ (div (+ v_main_~k~0_5 (- 4294967295)) 4294967296) 1))) (and (<= .cse1 .cse0) (= v_main_~k~0_5 v_main_~k~0_4)))) InVars {main_~k~0=v_main_~k~0_5, main_~n~0=v_main_~n~0_9} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~k~0] {326#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) 0)} is VALID [2022-04-27 16:59:09,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {337#(forall ((aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int)) (or (<= aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 0) (<= 4294967296 aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53) (and (or (forall ((aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int) (aux_div_aux_mod_aux_mod_v_main_~k~0_12_55_33_289 Int)) (or (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 2 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ (* main_~j~0 2) main_~i~0)) (< (+ (div (+ main_~j~0 (- 4294967295)) 4294967296) 1) aux_div_aux_mod_aux_mod_v_main_~k~0_12_55_33_289) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 4294967295) (+ (* main_~j~0 2) main_~i~0)) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~k~0_12_55_33_289 4294967296) (mod main_~n~0 4294967296) main_~i~0 main_~j~0) (+ (* aux_div_v_main_~k~0_12_55 4294967296) (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= 4294967296 (+ (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= (+ (* aux_div_aux_mod_aux_mod_v_main_~k~0_12_55_33_289 4294967296) (mod main_~n~0 4294967296)) main_~j~0) (<= (+ 3 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) 0))) (not (< (mod main_~j~0 4294967296) (mod main_~n~0 4294967296)))) (or (not (<= (mod main_~n~0 4294967296) (mod main_~j~0 4294967296))) (forall ((aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int)) (or (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 4294967296) (+ (* main_~j~0 2) main_~i~0)) (< (+ (* main_~j~0 2) main_~i~0) (+ (* aux_div_v_main_~k~0_12_55 4294967296) (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (< (+ (* main_~j~0 2) main_~i~0) (* aux_div_v_main_~k~0_12_55 4294967296)) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 3 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ (* main_~j~0 2) main_~i~0))))))))} [94] L25-3-->L29-2: Formula: (= v_main_~j~0_4 v_main_~k~0_1) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {333#(forall ((aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int)) (or (and (or (forall ((aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int) (aux_div_aux_mod_aux_mod_v_main_~k~0_12_55_33_289 Int)) (or (< (+ (* aux_div_aux_mod_aux_mod_v_main_~k~0_12_55_33_289 4294967296) (mod main_~n~0 4294967296) main_~i~0 main_~j~0) (+ (* aux_div_v_main_~k~0_12_55 4294967296) (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 4294967295) (+ main_~i~0 main_~k~0 main_~j~0)) (<= 4294967296 (+ (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 2 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ main_~i~0 main_~k~0 main_~j~0)) (< (+ (div (+ main_~k~0 (- 4294967295)) 4294967296) 1) aux_div_aux_mod_aux_mod_v_main_~k~0_12_55_33_289) (<= (+ 3 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) 0) (<= (+ (* aux_div_aux_mod_aux_mod_v_main_~k~0_12_55_33_289 4294967296) (mod main_~n~0 4294967296)) main_~k~0))) (not (< (mod main_~k~0 4294967296) (mod main_~n~0 4294967296)))) (or (not (<= (mod main_~n~0 4294967296) (mod main_~k~0 4294967296))) (forall ((aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int)) (or (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 3 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ main_~i~0 main_~k~0 main_~j~0)) (< (+ main_~i~0 main_~k~0 main_~j~0) (* aux_div_v_main_~k~0_12_55 4294967296)) (< (+ main_~i~0 main_~k~0 main_~j~0) (+ (* aux_div_v_main_~k~0_12_55 4294967296) (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 4294967296) (+ main_~i~0 main_~k~0 main_~j~0)))))) (<= aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 0) (<= 4294967296 aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53)))} is VALID [2022-04-27 16:59:09,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {341#(forall ((aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int)) (or (<= aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 0) (<= 4294967296 aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 4294967296) (+ (* main_~j~0 2) main_~i~0)) (< (+ (* main_~j~0 2) main_~i~0) (+ (* aux_div_v_main_~k~0_12_55 4294967296) (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (< (+ (* main_~j~0 2) main_~i~0) (* aux_div_v_main_~k~0_12_55 4294967296)) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 3 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ (* main_~j~0 2) main_~i~0))))} [92] L25-2-->L25-3: Formula: (not (< (mod v_main_~j~0_1 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {337#(forall ((aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int)) (or (<= aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 0) (<= 4294967296 aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53) (and (or (forall ((aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int) (aux_div_aux_mod_aux_mod_v_main_~k~0_12_55_33_289 Int)) (or (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 2 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ (* main_~j~0 2) main_~i~0)) (< (+ (div (+ main_~j~0 (- 4294967295)) 4294967296) 1) aux_div_aux_mod_aux_mod_v_main_~k~0_12_55_33_289) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 4294967295) (+ (* main_~j~0 2) main_~i~0)) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~k~0_12_55_33_289 4294967296) (mod main_~n~0 4294967296) main_~i~0 main_~j~0) (+ (* aux_div_v_main_~k~0_12_55 4294967296) (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= 4294967296 (+ (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= (+ (* aux_div_aux_mod_aux_mod_v_main_~k~0_12_55_33_289 4294967296) (mod main_~n~0 4294967296)) main_~j~0) (<= (+ 3 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) 0))) (not (< (mod main_~j~0 4294967296) (mod main_~n~0 4294967296)))) (or (not (<= (mod main_~n~0 4294967296) (mod main_~j~0 4294967296))) (forall ((aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int)) (or (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 4294967296) (+ (* main_~j~0 2) main_~i~0)) (< (+ (* main_~j~0 2) main_~i~0) (+ (* aux_div_v_main_~k~0_12_55 4294967296) (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (< (+ (* main_~j~0 2) main_~i~0) (* aux_div_v_main_~k~0_12_55 4294967296)) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 3 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ (* main_~j~0 2) main_~i~0))))))))} is VALID [2022-04-27 16:59:09,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {345#(forall ((aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int)) (or (<= aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 0) (<= 4294967296 aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53) (and (or (forall ((aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int)) (or (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 8589934595 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ main_~i~0 (* (mod main_~i~0 4294967296) 2))) (< (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) (+ (* aux_div_v_main_~k~0_12_55 4294967296) 8589934592)) (< (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) (+ (* aux_div_v_main_~k~0_12_55 4294967296) 8589934592 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 12884901888) (+ main_~i~0 (* (mod main_~i~0 4294967296) 2))))) (<= (mod main_~i~0 4294967296) 2147483647)) (or (not (<= (mod main_~i~0 4294967296) 2147483647)) (forall ((aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int)) (or (< (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) (* aux_div_v_main_~k~0_12_55 4294967296)) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 3 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ main_~i~0 (* (mod main_~i~0 4294967296) 2))) (< (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) (+ (* aux_div_v_main_~k~0_12_55 4294967296) (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 4294967296) (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)))))))))} [90] L21-3-->L25-2: Formula: (= v_main_~j~0_6 (let ((.cse0 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {341#(forall ((aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int)) (or (<= aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 0) (<= 4294967296 aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 4294967296) (+ (* main_~j~0 2) main_~i~0)) (< (+ (* main_~j~0 2) main_~i~0) (+ (* aux_div_v_main_~k~0_12_55 4294967296) (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (< (+ (* main_~j~0 2) main_~i~0) (* aux_div_v_main_~k~0_12_55 4294967296)) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 3 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ (* main_~j~0 2) main_~i~0))))} is VALID [2022-04-27 16:59:09,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {345#(forall ((aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int)) (or (<= aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 0) (<= 4294967296 aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53) (and (or (forall ((aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int)) (or (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 8589934595 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ main_~i~0 (* (mod main_~i~0 4294967296) 2))) (< (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) (+ (* aux_div_v_main_~k~0_12_55 4294967296) 8589934592)) (< (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) (+ (* aux_div_v_main_~k~0_12_55 4294967296) 8589934592 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 12884901888) (+ main_~i~0 (* (mod main_~i~0 4294967296) 2))))) (<= (mod main_~i~0 4294967296) 2147483647)) (or (not (<= (mod main_~i~0 4294967296) 2147483647)) (forall ((aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int)) (or (< (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) (* aux_div_v_main_~k~0_12_55 4294967296)) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 3 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ main_~i~0 (* (mod main_~i~0 4294967296) 2))) (< (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) (+ (* aux_div_v_main_~k~0_12_55 4294967296) (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 4294967296) (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)))))))))} [88] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {345#(forall ((aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int)) (or (<= aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 0) (<= 4294967296 aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53) (and (or (forall ((aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int)) (or (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 8589934595 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ main_~i~0 (* (mod main_~i~0 4294967296) 2))) (< (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) (+ (* aux_div_v_main_~k~0_12_55 4294967296) 8589934592)) (< (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) (+ (* aux_div_v_main_~k~0_12_55 4294967296) 8589934592 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 12884901888) (+ main_~i~0 (* (mod main_~i~0 4294967296) 2))))) (<= (mod main_~i~0 4294967296) 2147483647)) (or (not (<= (mod main_~i~0 4294967296) 2147483647)) (forall ((aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int)) (or (< (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) (* aux_div_v_main_~k~0_12_55 4294967296)) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 3 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ main_~i~0 (* (mod main_~i~0 4294967296) 2))) (< (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) (+ (* aux_div_v_main_~k~0_12_55 4294967296) (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 4294967296) (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)))))))))} is VALID [2022-04-27 16:59:09,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {245#true} [85] L19-->L21-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~i~0] {345#(forall ((aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int)) (or (<= aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 0) (<= 4294967296 aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53) (and (or (forall ((aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int)) (or (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 8589934595 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ main_~i~0 (* (mod main_~i~0 4294967296) 2))) (< (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) (+ (* aux_div_v_main_~k~0_12_55 4294967296) 8589934592)) (< (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) (+ (* aux_div_v_main_~k~0_12_55 4294967296) 8589934592 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 12884901888) (+ main_~i~0 (* (mod main_~i~0 4294967296) 2))))) (<= (mod main_~i~0 4294967296) 2147483647)) (or (not (<= (mod main_~i~0 4294967296) 2147483647)) (forall ((aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 Int) (aux_div_v_main_~k~0_12_55 Int)) (or (< (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) (* aux_div_v_main_~k~0_12_55 4294967296)) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 3 (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888)) (+ main_~i~0 (* (mod main_~i~0 4294967296) 2))) (< (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) (+ (* aux_div_v_main_~k~0_12_55 4294967296) (* aux_mod_aux_div_aux_mod_v_main_~k~0_12_55_33_53 3) (* aux_div_aux_div_aux_mod_v_main_~k~0_12_55_33_53 12884901888))) (<= (+ (* aux_div_v_main_~k~0_12_55 4294967296) 4294967296) (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)))))))))} is VALID [2022-04-27 16:59:09,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {245#true} [82] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {245#true} is VALID [2022-04-27 16:59:09,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {245#true} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 16:59:09,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {245#true} {245#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 16:59:09,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {245#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 16:59:09,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#true} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {245#true} is VALID [2022-04-27 16:59:09,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {245#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 16:59:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:59:09,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016579176] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:59:09,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:59:09,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2022-04-27 16:59:09,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216202031] [2022-04-27 16:59:09,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:59:09,645 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 20 states have internal predecessors, (32), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 16:59:09,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:59:09,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 20 states have internal predecessors, (32), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:59:12,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 16:59:12,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 16:59:12,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:59:12,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 16:59:12,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=400, Unknown=7, NotChecked=0, Total=506 [2022-04-27 16:59:12,684 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 20 states have internal predecessors, (32), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:59:15,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:59:15,467 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-27 16:59:15,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 16:59:15,467 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 20 states have internal predecessors, (32), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 16:59:15,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:59:15,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 20 states have internal predecessors, (32), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:59:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-27 16:59:15,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 20 states have internal predecessors, (32), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:59:15,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-27 16:59:15,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 36 transitions. [2022-04-27 16:59:15,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:59:15,512 INFO L225 Difference]: With dead ends: 30 [2022-04-27 16:59:15,512 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 16:59:15,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=177, Invalid=686, Unknown=7, NotChecked=0, Total=870 [2022-04-27 16:59:15,513 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 70 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:59:15,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 58 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 112 Invalid, 0 Unknown, 68 Unchecked, 0.2s Time] [2022-04-27 16:59:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 16:59:15,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-04-27 16:59:15,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:59:15,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-04-27 16:59:15,515 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-04-27 16:59:15,515 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-04-27 16:59:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:59:15,516 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-04-27 16:59:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-04-27 16:59:15,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:59:15,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:59:15,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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) Second operand 24 states. [2022-04-27 16:59:15,516 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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) Second operand 24 states. [2022-04-27 16:59:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:59:15,518 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-04-27 16:59:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-04-27 16:59:15,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:59:15,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:59:15,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:59:15,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:59:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-04-27 16:59:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-27 16:59:15,520 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2022-04-27 16:59:15,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:59:15,520 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-27 16:59:15,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 20 states have internal predecessors, (32), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:59:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 16:59:15,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 16:59:15,520 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:59:15,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:59:15,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 16:59:15,736 WARN L477 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-04-27 16:59:15,739 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:59:15,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:59:15,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2111704031, now seen corresponding path program 1 times [2022-04-27 16:59:15,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:59:15,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510327774] [2022-04-27 16:59:15,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:59:15,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:59:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:59:16,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:59:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:59:16,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {499#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:59:16,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:59:16,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {486#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:59:16,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {486#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:59:16,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {499#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:59:16,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:59:16,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {486#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:59:16,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:59:16,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [82] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 16:59:16,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {491#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [85] L19-->L21-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~i~0] {492#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (+ (* (div ~SIZE~0 4294967296) 6442450944) (* (div main_~n~0 4294967296) 4294967296)) (+ 30000001 main_~n~0)))} is VALID [2022-04-27 16:59:16,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {492#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (+ (* (div ~SIZE~0 4294967296) 6442450944) (* (div main_~n~0 4294967296) 4294967296)) (+ 30000001 main_~n~0)))} [88] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {493#(and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 (div main_~i~0 4294967296))) (+ (* (div main_~n~0 4294967296) 8589934592) (* main_~i~0 2) (* ~SIZE~0 3))) (<= (+ (* (div ~SIZE~0 4294967296) 6442450944) (* (div main_~i~0 4294967296) 4294967296)) (+ 30000001 main_~i~0)) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} is VALID [2022-04-27 16:59:16,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {493#(and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 (div main_~i~0 4294967296))) (+ (* (div main_~n~0 4294967296) 8589934592) (* main_~i~0 2) (* ~SIZE~0 3))) (<= (+ (* (div ~SIZE~0 4294967296) 6442450944) (* (div main_~i~0 4294967296) 4294967296)) (+ 30000001 main_~i~0)) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} [90] L21-3-->L25-2: Formula: (= v_main_~j~0_6 (let ((.cse0 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {494#(and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 (div main_~i~0 4294967296))) (+ (* (div main_~n~0 4294967296) 8589934592) (* main_~i~0 2) (* ~SIZE~0 3))) (<= (+ (* (div ~SIZE~0 4294967296) 6442450944) (* (div main_~i~0 4294967296) 4294967296)) (+ 30000001 main_~i~0)) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0))} is VALID [2022-04-27 16:59:16,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {494#(and (<= (+ (* main_~n~0 2) 60000003 (* 8589934592 (div main_~i~0 4294967296))) (+ (* (div main_~n~0 4294967296) 8589934592) (* main_~i~0 2) (* ~SIZE~0 3))) (<= (+ (* (div ~SIZE~0 4294967296) 6442450944) (* (div main_~i~0 4294967296) 4294967296)) (+ 30000001 main_~i~0)) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0))} [93] L25-2-->L25-2: Formula: (let ((.cse0 (mod v_main_~n~0_2 4294967296)) (.cse1 (mod v_main_~j~0_3 4294967296))) (or (and (<= (div (+ .cse0 (* (- 1) v_main_~j~0_2)) (- 4294967296)) (+ (div (+ v_main_~j~0_3 (- 4294967295)) 4294967296) 1)) (< .cse1 .cse0) (< v_main_~j~0_3 v_main_~j~0_2)) (and (= v_main_~j~0_3 v_main_~j~0_2) (<= .cse0 .cse1)))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~j~0] {495#(and (= main_~i~0 0) (<= (+ (* (div ~SIZE~0 4294967296) 6442450944) (* (div (+ 2 (* 3 (div (+ 2147483647 (* (- 1) main_~j~0)) 2147483648))) 3) 2147483648) (* (div (+ (* ~SIZE~0 (- 3)) (* main_~j~0 2) (* (- 2) main_~i~0) 4354967298 (* 8589934592 (div main_~i~0 4294967296))) 4294967296) 2147483648) (* (div main_~i~0 4294967296) 4294967296)) (+ 30000001 main_~i~0)))} is VALID [2022-04-27 16:59:16,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {495#(and (= main_~i~0 0) (<= (+ (* (div ~SIZE~0 4294967296) 6442450944) (* (div (+ 2 (* 3 (div (+ 2147483647 (* (- 1) main_~j~0)) 2147483648))) 3) 2147483648) (* (div (+ (* ~SIZE~0 (- 3)) (* main_~j~0 2) (* (- 2) main_~i~0) 4354967298 (* 8589934592 (div main_~i~0 4294967296))) 4294967296) 2147483648) (* (div main_~i~0 4294967296) 4294967296)) (+ 30000001 main_~i~0)))} [92] L25-2-->L25-3: Formula: (not (< (mod v_main_~j~0_1 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {495#(and (= main_~i~0 0) (<= (+ (* (div ~SIZE~0 4294967296) 6442450944) (* (div (+ 2 (* 3 (div (+ 2147483647 (* (- 1) main_~j~0)) 2147483648))) 3) 2147483648) (* (div (+ (* ~SIZE~0 (- 3)) (* main_~j~0 2) (* (- 2) main_~i~0) 4354967298 (* 8589934592 (div main_~i~0 4294967296))) 4294967296) 2147483648) (* (div main_~i~0 4294967296) 4294967296)) (+ 30000001 main_~i~0)))} is VALID [2022-04-27 16:59:16,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {495#(and (= main_~i~0 0) (<= (+ (* (div ~SIZE~0 4294967296) 6442450944) (* (div (+ 2 (* 3 (div (+ 2147483647 (* (- 1) main_~j~0)) 2147483648))) 3) 2147483648) (* (div (+ (* ~SIZE~0 (- 3)) (* main_~j~0 2) (* (- 2) main_~i~0) 4354967298 (* 8589934592 (div main_~i~0 4294967296))) 4294967296) 2147483648) (* (div main_~i~0 4294967296) 4294967296)) (+ 30000001 main_~i~0)))} [94] L25-3-->L29-2: Formula: (= v_main_~j~0_4 v_main_~k~0_1) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {496#(and (<= (+ main_~k~0 main_~j~0 60000003 (* 8589934592 (div main_~i~0 4294967296)) (* (div ~SIZE~0 4294967296) 12884901888)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 12884901888) (* main_~i~0 2) (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) (* ~SIZE~0 3))) (= main_~i~0 0))} is VALID [2022-04-27 16:59:16,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {496#(and (<= (+ main_~k~0 main_~j~0 60000003 (* 8589934592 (div main_~i~0 4294967296)) (* (div ~SIZE~0 4294967296) 12884901888)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 12884901888) (* main_~i~0 2) (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) (* ~SIZE~0 3))) (= main_~i~0 0))} [96] L29-2-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {496#(and (<= (+ main_~k~0 main_~j~0 60000003 (* 8589934592 (div main_~i~0 4294967296)) (* (div ~SIZE~0 4294967296) 12884901888)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 12884901888) (* main_~i~0 2) (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) (* ~SIZE~0 3))) (= main_~i~0 0))} is VALID [2022-04-27 16:59:16,358 INFO L272 TraceCheckUtils]: 13: Hoare triple {496#(and (<= (+ main_~k~0 main_~j~0 60000003 (* 8589934592 (div main_~i~0 4294967296)) (* (div ~SIZE~0 4294967296) 12884901888)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 12884901888) (* main_~i~0 2) (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) (* ~SIZE~0 3))) (= main_~i~0 0))} [98] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod (+ v_main_~i~0_8 v_main_~j~0_7 v_main_~k~0_7) 4294967296) 3) 4294967296) (mod v_~SIZE~0_7 4294967296)) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {497#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:59:16,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {497#(not (= |__VERIFIER_assert_#in~cond| 0))} [100] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {498#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:59:16,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {498#(not (= __VERIFIER_assert_~cond 0))} [101] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {487#false} is VALID [2022-04-27 16:59:16,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {487#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#false} is VALID [2022-04-27 16:59:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:59:16,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:59:16,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510327774] [2022-04-27 16:59:16,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510327774] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:59:16,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083713120] [2022-04-27 16:59:16,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:59:16,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:59:16,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:59:16,361 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-04-27 16:59:16,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process