/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/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:22:10,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:22:10,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:22:10,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:22:10,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:22:10,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:22:10,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:22:10,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:22:10,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:22:10,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:22:10,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:22:10,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:22:10,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:22:10,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:22:10,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:22:10,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:22:10,864 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:22:10,865 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:22:10,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:22:10,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:22:10,871 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:22:10,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:22:10,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:22:10,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:22:10,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:22:10,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:22:10,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:22:10,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:22:10,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:22:10,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:22:10,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:22:10,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:22:10,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:22:10,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:22:10,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:22:10,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:22:10,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:22:10,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:22:10,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:22:10,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:22:10,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:22:10,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:22:10,886 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 22:22:10,908 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:22:10,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:22:10,909 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:22:10,909 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:22:10,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:22:10,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:22:10,910 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:22:10,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:22:10,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:22:10,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:22:10,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:22:10,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:22:10,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:22:10,911 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:22:10,911 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:22:10,911 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:22:10,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:22:10,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:22:10,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:22:10,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:22:10,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:22:10,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:22:10,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:22:10,912 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:22:10,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:22:10,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:22:10,912 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:22:10,913 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:22:10,913 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:22:10,913 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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 22:22:11,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:22:11,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:22:11,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:22:11,113 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:22:11,114 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:22:11,115 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-27 22:22:11,162 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/295156f8b/59ac1d1fa84d4d23b3d847df9da03fa9/FLAG9282e6fa5 [2022-04-27 22:22:11,515 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:22:11,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-27 22:22:11,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/295156f8b/59ac1d1fa84d4d23b3d847df9da03fa9/FLAG9282e6fa5 [2022-04-27 22:22:11,949 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/295156f8b/59ac1d1fa84d4d23b3d847df9da03fa9 [2022-04-27 22:22:11,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:22:11,952 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:22:11,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:22:11,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:22:11,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:22:11,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:22:11" (1/1) ... [2022-04-27 22:22:11,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe1490c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:22:11, skipping insertion in model container [2022-04-27 22:22:11,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:22:11" (1/1) ... [2022-04-27 22:22:11,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:22:11,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:22:12,071 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/sumt6.c[403,416] [2022-04-27 22:22:12,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:22:12,101 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:22:12,111 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/sumt6.c[403,416] [2022-04-27 22:22:12,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:22:12,138 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:22:12,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:22:12 WrapperNode [2022-04-27 22:22:12,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:22:12,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:22:12,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:22:12,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:22:12,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:22:12" (1/1) ... [2022-04-27 22:22:12,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:22:12" (1/1) ... [2022-04-27 22:22:12,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:22:12" (1/1) ... [2022-04-27 22:22:12,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:22:12" (1/1) ... [2022-04-27 22:22:12,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:22:12" (1/1) ... [2022-04-27 22:22:12,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:22:12" (1/1) ... [2022-04-27 22:22:12,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:22:12" (1/1) ... [2022-04-27 22:22:12,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:22:12,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:22:12,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:22:12,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:22:12,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:22:12" (1/1) ... [2022-04-27 22:22:12,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:22:12,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:22:12,196 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 22:22:12,202 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 22:22:12,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:22:12,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:22:12,228 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:22:12,228 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 22:22:12,228 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 22:22:12,228 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:22:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 22:22:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:22:12,229 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:22:12,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:22:12,229 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 22:22:12,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 22:22:12,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 22:22:12,229 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:22:12,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:22:12,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:22:12,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:22:12,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:22:12,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:22:12,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:22:12,279 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:22:12,280 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:22:18,939 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:22:18,945 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:22:18,945 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 22:22:18,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:22:18 BoogieIcfgContainer [2022-04-27 22:22:18,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:22:18,947 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:22:18,947 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:22:18,950 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:22:18,952 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:22:18" (1/1) ... [2022-04-27 22:22:18,954 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:22:18,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:22:18 BasicIcfg [2022-04-27 22:22:18,975 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:22:18,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:22:18,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:22:18,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:22:18,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:22:11" (1/4) ... [2022-04-27 22:22:18,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e887f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:22:18, skipping insertion in model container [2022-04-27 22:22:18,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:22:12" (2/4) ... [2022-04-27 22:22:18,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e887f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:22:18, skipping insertion in model container [2022-04-27 22:22:18,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:22:18" (3/4) ... [2022-04-27 22:22:18,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e887f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:22:18, skipping insertion in model container [2022-04-27 22:22:18,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:22:18" (4/4) ... [2022-04-27 22:22:18,981 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt6.cqvasr [2022-04-27 22:22:18,991 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:22:18,991 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:22:19,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:22:19,027 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@41f8c0c3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3a256d7a [2022-04-27 22:22:19,028 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:22:19,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 22:22:19,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 22:22:19,039 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:22:19,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:22:19,040 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:22:19,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:22:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2096714442, now seen corresponding path program 1 times [2022-04-27 22:22:19,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:22:19,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134703618] [2022-04-27 22:22:19,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:22:19,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:22:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:22:19,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:22:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:22:19,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {29#true} is VALID [2022-04-27 22:22:19,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-27 22:22:19,222 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-27 22:22:19,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:22:19,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {29#true} is VALID [2022-04-27 22:22:19,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-27 22:22:19,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-27 22:22:19,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-27 22:22:19,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {29#true} is VALID [2022-04-27 22:22:19,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-27 22:22:19,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#true} [88] L21-2-->L21-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-27 22:22:19,227 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {30#false} is VALID [2022-04-27 22:22:19,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} [95] __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] {30#false} is VALID [2022-04-27 22:22:19,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} [99] 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[] {30#false} is VALID [2022-04-27 22:22:19,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-27 22:22:19,228 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 22:22:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:22:19,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134703618] [2022-04-27 22:22:19,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134703618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:22:19,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:22:19,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:22:19,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070140284] [2022-04-27 22:22:19,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:22:19,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-27 22:22:19,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:22:19,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 22:22:19,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:22:19,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:22:19,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:22:19,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:22:19,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:22:19,269 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 22:22:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:22:25,898 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 22:22:25,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:22:25,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-27 22:22:25,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:22:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 22:22:25,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-27 22:22:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 22:22:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-27 22:22:25,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-27 22:22:25,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:22:25,965 INFO L225 Difference]: With dead ends: 38 [2022-04-27 22:22:25,965 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 22:22:25,967 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 22:22:25,970 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 32 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 22:22:25,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 32 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:22:25,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 22:22:25,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-27 22:22:25,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:22:25,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 22:22:25,996 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 22:22:25,996 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 22:22:26,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:22:26,004 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-27 22:22:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-27 22:22:26,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:22:26,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:22:26,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 19 states. [2022-04-27 22:22:26,005 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 19 states. [2022-04-27 22:22:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:22:26,007 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-27 22:22:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-27 22:22:26,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:22:26,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:22:26,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:22:26,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:22:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 22:22:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-27 22:22:26,013 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2022-04-27 22:22:26,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:22:26,013 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-27 22:22:26,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 22:22:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-27 22:22:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 22:22:26,014 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:22:26,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:22:26,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 22:22:26,014 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:22:26,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:22:26,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2097637963, now seen corresponding path program 1 times [2022-04-27 22:22:26,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:22:26,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939082672] [2022-04-27 22:22:26,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:22:26,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:22:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:22:26,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:22:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:22:26,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {156#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {148#true} is VALID [2022-04-27 22:22:26,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {148#true} is VALID [2022-04-27 22:22:26,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {148#true} {148#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {148#true} is VALID [2022-04-27 22:22:26,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {148#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {156#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:22:26,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {148#true} is VALID [2022-04-27 22:22:26,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {148#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {148#true} is VALID [2022-04-27 22:22:26,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148#true} {148#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {148#true} is VALID [2022-04-27 22:22:26,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {148#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {148#true} is VALID [2022-04-27 22:22:26,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {148#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:22:26,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:22:26,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:22:26,282 INFO L272 TraceCheckUtils]: 8: Hoare triple {153#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {154#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:22:26,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {154#(not (= |__VERIFIER_assert_#in~cond| 0))} [95] __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] {155#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:22:26,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#(not (= __VERIFIER_assert_~cond 0))} [99] 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[] {149#false} is VALID [2022-04-27 22:22:26,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {149#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#false} is VALID [2022-04-27 22:22:26,283 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 22:22:26,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:22:26,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939082672] [2022-04-27 22:22:26,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939082672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:22:26,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:22:26,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 22:22:26,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203212077] [2022-04-27 22:22:26,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:22:26,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-27 22:22:26,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:22:26,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 22:22:26,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:22:26,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:22:26,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:22:26,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:22:26,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 22:22:26,296 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 22:22:28,402 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:22:34,955 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:22:41,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:22:43,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:22:45,848 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:22:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:22:46,028 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-27 22:22:46,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:22:46,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-27 22:22:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:22:46,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 22:22:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-27 22:22:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 22:22:46,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-27 22:22:46,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-27 22:22:46,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:22:46,063 INFO L225 Difference]: With dead ends: 26 [2022-04-27 22:22:46,063 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 22:22:46,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 22:22:46,064 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-04-27 22:22:46,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 10.6s Time] [2022-04-27 22:22:46,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 22:22:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-27 22:22:46,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:22:46,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 22:22:46,067 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 22:22:46,068 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 22:22:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:22:46,069 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-27 22:22:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-27 22:22:46,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:22:46,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:22:46,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 21 states. [2022-04-27 22:22:46,069 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 21 states. [2022-04-27 22:22:46,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:22:46,070 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-27 22:22:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-27 22:22:46,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:22:46,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:22:46,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:22:46,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:22:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 22:22:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-04-27 22:22:46,072 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2022-04-27 22:22:46,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:22:46,072 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-04-27 22:22:46,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 22:22:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-27 22:22:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 22:22:46,073 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:22:46,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:22:46,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 22:22:46,073 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:22:46,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:22:46,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1607843865, now seen corresponding path program 1 times [2022-04-27 22:22:46,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:22:46,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820790888] [2022-04-27 22:22:46,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:22:46,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:22:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:22:46,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:22:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:22:46,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {283#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {271#true} is VALID [2022-04-27 22:22:46,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-27 22:22:46,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {271#true} {271#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-27 22:22:46,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {271#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {283#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:22:46,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {271#true} is VALID [2022-04-27 22:22:46,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {271#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-27 22:22:46,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {271#true} {271#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-27 22:22:46,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {271#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-27 22:22:46,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:22:46,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:22:46,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {277#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} is VALID [2022-04-27 22:22:46,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {277#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {278#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v2~0)) (<= 1 main_~v2~0) (<= main_~v2~0 1) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:22:46,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {278#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v2~0)) (<= 1 main_~v2~0) (<= main_~v2~0 1) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {279#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= main_~v2~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v2~0)))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:22:46,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {279#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= main_~v2~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v2~0)))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {280#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v2~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~v3~0 0))} is VALID [2022-04-27 22:22:46,690 INFO L272 TraceCheckUtils]: 11: Hoare triple {280#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v2~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {281#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:22:46,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {281#(not (= |__VERIFIER_assert_#in~cond| 0))} [95] __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] {282#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:22:46,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {282#(not (= __VERIFIER_assert_~cond 0))} [99] 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[] {272#false} is VALID [2022-04-27 22:22:46,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {272#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {272#false} is VALID [2022-04-27 22:22:46,701 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 22:22:46,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:22:46,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820790888] [2022-04-27 22:22:46,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820790888] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:22:46,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57374529] [2022-04-27 22:22:46,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:22:46,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:22:46,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:22:46,706 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 22:22:46,707 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 22:22:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:22:46,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 22:22:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:22:46,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:22:47,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {271#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-27 22:22:47,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {271#true} is VALID [2022-04-27 22:22:47,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {271#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-27 22:22:47,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {271#true} {271#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-27 22:22:47,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {271#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-27 22:22:47,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:22:47,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:22:47,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:22:47,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:22:47,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {315#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:22:47,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {315#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {315#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:22:47,178 INFO L272 TraceCheckUtils]: 11: Hoare triple {315#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:22:47,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {322#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:22:47,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {272#false} is VALID [2022-04-27 22:22:47,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {272#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {272#false} is VALID [2022-04-27 22:22:47,180 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 22:22:47,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:22:47,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {272#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {272#false} is VALID [2022-04-27 22:22:47,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {272#false} is VALID [2022-04-27 22:22:47,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {322#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:22:47,441 INFO L272 TraceCheckUtils]: 11: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:22:47,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:22:47,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:22:49,549 WARN L290 TraceCheckUtils]: 8: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {349#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:22:49,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:22:49,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:22:49,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {342#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:22:49,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {271#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-27 22:22:49,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {271#true} {271#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-27 22:22:49,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {271#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-27 22:22:49,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {271#true} is VALID [2022-04-27 22:22:49,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {271#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#true} is VALID [2022-04-27 22:22:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 22:22:49,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57374529] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:22:49,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:22:49,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-27 22:22:49,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530042224] [2022-04-27 22:22:49,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:22:49,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 22:22:49,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:22:49,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:22:51,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 22:22:51,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:22:51,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:22:51,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:22:51,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 22:22:51,702 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:22:53,763 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:22:55,890 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:22:58,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:23:06,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:23:08,855 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:23:17,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:23:19,799 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:23:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:23:20,012 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-27 22:23:20,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:23:20,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 22:23:20,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:23:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:23:20,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-27 22:23:20,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:23:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-27 22:23:20,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-27 22:23:22,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 22:23:22,157 INFO L225 Difference]: With dead ends: 28 [2022-04-27 22:23:22,157 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 22:23:22,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-27 22:23:22,158 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:23:22,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 7 Unknown, 0 Unchecked, 15.0s Time] [2022-04-27 22:23:22,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 22:23:22,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-27 22:23:22,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:23:22,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:23:22,162 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:23:22,162 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:23:22,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:23:22,163 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-27 22:23:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-27 22:23:22,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:23:22,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:23:22,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 22:23:22,164 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 22:23:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:23:22,165 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-27 22:23:22,165 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-27 22:23:22,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:23:22,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:23:22,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:23:22,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:23:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:23:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-27 22:23:22,167 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2022-04-27 22:23:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:23:22,167 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-27 22:23:22,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:23:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-27 22:23:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 22:23:22,167 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:23:22,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:23:22,186 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 22:23:22,381 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 22:23:22,382 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:23:22,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:23:22,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1132300265, now seen corresponding path program 1 times [2022-04-27 22:23:22,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:23:22,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140372716] [2022-04-27 22:23:22,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:23:22,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:23:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:23:22,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:23:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:23:22,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {504#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:23:22,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:23:22,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {496#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:23:22,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {496#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {504#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:23:22,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {504#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:23:22,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:23:22,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {505#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {496#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:23:22,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:23:22,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {501#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {502#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:23:22,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {502#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {503#(= main_~l~0 0)} is VALID [2022-04-27 22:23:22,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {503#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {503#(= main_~l~0 0)} is VALID [2022-04-27 22:23:22,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {503#(= main_~l~0 0)} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {497#false} is VALID [2022-04-27 22:23:22,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#false} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {497#false} is VALID [2022-04-27 22:23:22,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {497#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {497#false} is VALID [2022-04-27 22:23:22,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {497#false} is VALID [2022-04-27 22:23:22,685 INFO L272 TraceCheckUtils]: 12: Hoare triple {497#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {497#false} is VALID [2022-04-27 22:23:22,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {497#false} [95] __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] {497#false} is VALID [2022-04-27 22:23:22,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {497#false} [99] 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[] {497#false} is VALID [2022-04-27 22:23:22,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {497#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#false} is VALID [2022-04-27 22:23:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:23:22,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:23:22,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140372716] [2022-04-27 22:23:22,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140372716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:23:22,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:23:22,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 22:23:22,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815612343] [2022-04-27 22:23:22,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:23:22,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 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 22:23:22,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:23:22,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 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 22:23:24,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 22:23:24,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 22:23:24,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:23:24,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 22:23:24,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-27 22:23:24,892 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 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 22:23:26,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:23:31,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:23:35,595 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:23:39,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:23:40,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:23:40,240 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-04-27 22:23:40,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:23:40,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 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 22:23:40,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:23:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 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 22:23:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-27 22:23:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 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 22:23:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-27 22:23:40,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-27 22:23:42,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 22:23:42,429 INFO L225 Difference]: With dead ends: 37 [2022-04-27 22:23:42,429 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 22:23:42,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 22:23:42,430 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 9 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-27 22:23:42,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 27 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 19 Invalid, 4 Unknown, 0 Unchecked, 8.1s Time] [2022-04-27 22:23:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 22:23:42,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-27 22:23:42,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:23:42,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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 22:23:42,445 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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 22:23:42,446 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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 22:23:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:23:42,447 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-27 22:23:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-27 22:23:42,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:23:42,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:23:42,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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 25 states. [2022-04-27 22:23:42,448 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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 25 states. [2022-04-27 22:23:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:23:42,449 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-27 22:23:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-27 22:23:42,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:23:42,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:23:42,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:23:42,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:23:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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 22:23:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-27 22:23:42,451 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2022-04-27 22:23:42,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:23:42,451 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-27 22:23:42,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 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 22:23:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-27 22:23:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 22:23:42,452 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:23:42,452 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:23:42,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 22:23:42,452 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:23:42,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:23:42,453 INFO L85 PathProgramCache]: Analyzing trace with hash -932165961, now seen corresponding path program 1 times [2022-04-27 22:23:42,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:23:42,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386867594] [2022-04-27 22:23:42,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:23:42,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:23:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:23:42,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:23:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:23:42,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {653#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:23:42,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:23:42,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {644#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:23:42,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {644#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {653#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:23:42,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {653#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:23:42,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:23:42,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {654#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {644#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:23:42,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:23:42,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {650#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:23:42,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {650#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {651#(= main_~l~0 0)} is VALID [2022-04-27 22:23:42,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {651#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {651#(= main_~l~0 0)} is VALID [2022-04-27 22:23:42,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {651#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {651#(= main_~l~0 0)} is VALID [2022-04-27 22:23:42,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {651#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-27 22:23:42,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-27 22:23:42,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-27 22:23:42,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {652#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {645#false} is VALID [2022-04-27 22:23:42,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {645#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {645#false} is VALID [2022-04-27 22:23:42,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {645#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {645#false} is VALID [2022-04-27 22:23:42,716 INFO L272 TraceCheckUtils]: 15: Hoare triple {645#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {645#false} is VALID [2022-04-27 22:23:42,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {645#false} [95] __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] {645#false} is VALID [2022-04-27 22:23:42,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {645#false} [99] 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[] {645#false} is VALID [2022-04-27 22:23:42,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {645#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {645#false} is VALID [2022-04-27 22:23:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:23:42,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:23:42,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386867594] [2022-04-27 22:23:42,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386867594] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:23:42,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694065172] [2022-04-27 22:23:42,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:23:42,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:23:42,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:23:42,719 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 22:23:42,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 22:23:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:23:42,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 22:23:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:23:42,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:23:43,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {644#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-27 22:23:43,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {644#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {644#true} is VALID [2022-04-27 22:23:43,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {644#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-27 22:23:43,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-27 22:23:43,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {644#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-27 22:23:43,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {644#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:23:43,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:23:43,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:23:43,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {673#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {683#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:23:43,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:23:43,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:23:43,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:23:43,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {687#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {697#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 22:23:43,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {697#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {701#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-27 22:23:43,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {701#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {701#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-27 22:23:43,153 INFO L272 TraceCheckUtils]: 15: Hoare triple {701#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {708#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:23:43,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {708#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {712#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:23:43,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {645#false} is VALID [2022-04-27 22:23:43,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {645#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {645#false} is VALID [2022-04-27 22:23:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:23:43,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:23:43,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {645#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {645#false} is VALID [2022-04-27 22:23:43,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {645#false} is VALID [2022-04-27 22:23:43,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {708#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {712#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:23:43,369 INFO L272 TraceCheckUtils]: 15: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {708#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:23:43,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:23:43,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {735#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:23:45,490 WARN L290 TraceCheckUtils]: 12: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {735#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:23:45,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:23:45,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:23:45,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {735#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:23:47,608 WARN L290 TraceCheckUtils]: 8: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {735#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:23:47,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:23:47,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:23:47,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {644#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {728#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:23:47,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {644#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-27 22:23:47,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-27 22:23:47,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {644#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-27 22:23:47,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {644#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {644#true} is VALID [2022-04-27 22:23:47,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {644#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#true} is VALID [2022-04-27 22:23:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 22:23:47,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694065172] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:23:47,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:23:47,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 9] total 17 [2022-04-27 22:23:47,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009135726] [2022-04-27 22:23:47,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:23:47,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 22:23:47,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:23:47,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:23:51,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 15 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 22:23:51,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:23:51,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:23:51,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:23:51,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-27 22:23:51,844 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:23:53,899 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:23:56,098 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:24:00,527 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:24:07,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:24:07,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:24:07,252 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-27 22:24:07,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:24:07,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 22:24:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:24:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:24:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-27 22:24:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:24:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-27 22:24:07,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-27 22:24:11,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 33 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 22:24:11,506 INFO L225 Difference]: With dead ends: 33 [2022-04-27 22:24:11,506 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 22:24:11,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-27 22:24:11,507 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-27 22:24:11,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 4 Unknown, 0 Unchecked, 8.3s Time] [2022-04-27 22:24:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 22:24:11,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-04-27 22:24:11,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:24:11,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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 22:24:11,516 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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 22:24:11,516 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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 22:24:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:24:11,517 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-27 22:24:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-27 22:24:11,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:24:11,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:24:11,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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 22:24:11,518 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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 22:24:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:24:11,519 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-27 22:24:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-27 22:24:11,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:24:11,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:24:11,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:24:11,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:24:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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 22:24:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-27 22:24:11,520 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-04-27 22:24:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:24:11,520 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-27 22:24:11,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:24:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-27 22:24:11,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 22:24:11,521 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:24:11,521 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:24:11,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 22:24:11,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:24:11,728 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:24:11,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:24:11,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1043545585, now seen corresponding path program 1 times [2022-04-27 22:24:11,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:24:11,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837596575] [2022-04-27 22:24:11,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:24:11,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:24:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:24:11,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:24:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:24:11,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {921#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {914#true} is VALID [2022-04-27 22:24:11,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 22:24:11,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {914#true} {914#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 22:24:11,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {914#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {921#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:24:11,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {921#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {914#true} is VALID [2022-04-27 22:24:11,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 22:24:11,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {914#true} {914#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 22:24:11,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {914#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 22:24:11,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {919#(= main_~l~0 0)} is VALID [2022-04-27 22:24:11,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {919#(= main_~l~0 0)} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {919#(= main_~l~0 0)} is VALID [2022-04-27 22:24:11,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {919#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {919#(= main_~l~0 0)} is VALID [2022-04-27 22:24:11,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {919#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {919#(= main_~l~0 0)} is VALID [2022-04-27 22:24:11,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {919#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-27 22:24:11,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-27 22:24:11,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-27 22:24:11,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-27 22:24:11,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {920#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {915#false} is VALID [2022-04-27 22:24:11,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {915#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {915#false} is VALID [2022-04-27 22:24:11,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {915#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {915#false} is VALID [2022-04-27 22:24:11,806 INFO L272 TraceCheckUtils]: 16: Hoare triple {915#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {915#false} is VALID [2022-04-27 22:24:11,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {915#false} [95] __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] {915#false} is VALID [2022-04-27 22:24:11,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {915#false} [99] 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[] {915#false} is VALID [2022-04-27 22:24:11,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {915#false} is VALID [2022-04-27 22:24:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:24:11,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:24:11,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837596575] [2022-04-27 22:24:11,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837596575] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:24:11,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040425643] [2022-04-27 22:24:11,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:24:11,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:24:11,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:24:11,808 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:24:11,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 22:24:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:24:11,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 22:24:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:24:11,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:24:12,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {914#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 22:24:12,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {914#true} is VALID [2022-04-27 22:24:12,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 22:24:12,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {914#true} {914#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 22:24:12,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {914#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 22:24:12,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:12,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:12,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:12,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {940#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {950#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:12,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {950#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:12,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:12,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:12,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:12,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {954#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {967#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:12,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {967#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {971#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:12,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {971#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {971#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:12,241 INFO L272 TraceCheckUtils]: 16: Hoare triple {971#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {978#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:24:12,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {978#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {982#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:24:12,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {982#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {915#false} is VALID [2022-04-27 22:24:12,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {915#false} is VALID [2022-04-27 22:24:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:24:12,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:24:12,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {915#false} is VALID [2022-04-27 22:24:12,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {982#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {915#false} is VALID [2022-04-27 22:24:12,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {978#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {982#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:24:12,483 INFO L272 TraceCheckUtils]: 16: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {978#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:24:12,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:12,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {1005#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:12,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {1005#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-27 22:24:12,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:12,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:12,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:12,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {1005#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:14,601 WARN L290 TraceCheckUtils]: 8: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1005#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:24:14,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:14,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:14,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {914#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {998#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:14,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {914#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 22:24:14,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {914#true} {914#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 22:24:14,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {914#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 22:24:14,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {914#true} is VALID [2022-04-27 22:24:14,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {914#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#true} is VALID [2022-04-27 22:24:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 22:24:14,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040425643] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:24:14,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:24:14,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-27 22:24:14,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461512007] [2022-04-27 22:24:14,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:24:14,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 22:24:14,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:24:14,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:24:16,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 17 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 22:24:16,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:24:16,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:24:16,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:24:16,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-27 22:24:16,759 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:24:18,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:24:20,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:24:23,102 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:24:25,221 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:24:27,426 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:24:29,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:24:31,680 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:24:36,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:24:36,171 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-27 22:24:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:24:36,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 22:24:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:24:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:24:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-27 22:24:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:24:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-27 22:24:36,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-27 22:24:38,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 22:24:38,360 INFO L225 Difference]: With dead ends: 40 [2022-04-27 22:24:38,360 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 22:24:38,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 22:24:38,360 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:24:38,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 7 Unknown, 0 Unchecked, 15.0s Time] [2022-04-27 22:24:38,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 22:24:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-27 22:24:38,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:24:38,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 22:24:38,380 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 22:24:38,380 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 22:24:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:24:38,381 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-27 22:24:38,381 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-27 22:24:38,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:24:38,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:24:38,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 35 states. [2022-04-27 22:24:38,382 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 35 states. [2022-04-27 22:24:38,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:24:38,383 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-27 22:24:38,383 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-27 22:24:38,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:24:38,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:24:38,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:24:38,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:24:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 22:24:38,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-27 22:24:38,384 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 20 [2022-04-27 22:24:38,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:24:38,384 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-27 22:24:38,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:24:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-27 22:24:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 22:24:38,385 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:24:38,385 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:24:38,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 22:24:38,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:24:38,589 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:24:38,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:24:38,589 INFO L85 PathProgramCache]: Analyzing trace with hash -58795524, now seen corresponding path program 1 times [2022-04-27 22:24:38,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:24:38,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994697726] [2022-04-27 22:24:38,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:24:38,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:24:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:24:38,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:24:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:24:38,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {1232#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:24:38,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:24:38,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1220#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:24:38,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {1220#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1232#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:24:38,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {1232#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:24:38,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:24:38,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1233#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1220#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:24:38,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:24:38,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {1225#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1226#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:24:38,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {1226#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1227#(= main_~l~0 0)} is VALID [2022-04-27 22:24:38,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {1227#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1227#(= main_~l~0 0)} is VALID [2022-04-27 22:24:38,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1227#(= main_~l~0 0)} is VALID [2022-04-27 22:24:38,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1228#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} is VALID [2022-04-27 22:24:38,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {1228#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-27 22:24:38,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-27 22:24:38,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-27 22:24:38,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-27 22:24:38,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {1230#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-27 22:24:38,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {1230#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1231#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-27 22:24:38,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {1231#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1221#false} is VALID [2022-04-27 22:24:38,915 INFO L272 TraceCheckUtils]: 17: Hoare triple {1221#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1221#false} is VALID [2022-04-27 22:24:38,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {1221#false} [95] __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] {1221#false} is VALID [2022-04-27 22:24:38,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {1221#false} [99] 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[] {1221#false} is VALID [2022-04-27 22:24:38,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {1221#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1221#false} is VALID [2022-04-27 22:24:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:24:38,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:24:38,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994697726] [2022-04-27 22:24:38,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994697726] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:24:38,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938051999] [2022-04-27 22:24:38,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:24:38,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:24:38,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:24:38,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:24:38,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 22:24:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:24:38,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 22:24:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:24:38,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:24:39,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {1220#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-27 22:24:39,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {1220#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {1220#true} is VALID [2022-04-27 22:24:39,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {1220#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-27 22:24:39,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1220#true} {1220#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-27 22:24:39,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {1220#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-27 22:24:39,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {1220#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:39,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:39,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:39,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {1252#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1262#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:39,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:39,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:39,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:39,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:39,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:39,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {1266#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {1282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:39,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {1282#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1286#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:39,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {1286#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1286#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:24:39,491 INFO L272 TraceCheckUtils]: 17: Hoare triple {1286#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1293#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:24:39,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {1293#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {1297#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:24:39,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {1297#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {1221#false} is VALID [2022-04-27 22:24:39,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {1221#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1221#false} is VALID [2022-04-27 22:24:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:24:39,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:24:39,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {1221#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1221#false} is VALID [2022-04-27 22:24:39,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {1297#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {1221#false} is VALID [2022-04-27 22:24:39,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {1293#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {1297#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:24:39,828 INFO L272 TraceCheckUtils]: 17: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1293#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:24:39,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:39,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {1320#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:41,936 WARN L290 TraceCheckUtils]: 14: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {1320#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:24:41,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:41,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:41,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:41,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:41,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {1320#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:44,057 WARN L290 TraceCheckUtils]: 8: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1320#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:24:44,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:44,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:44,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {1220#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1313#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:24:44,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {1220#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-27 22:24:44,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1220#true} {1220#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-27 22:24:44,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {1220#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-27 22:24:44,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {1220#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {1220#true} is VALID [2022-04-27 22:24:44,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {1220#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-04-27 22:24:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 22:24:44,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938051999] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:24:44,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:24:44,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 20 [2022-04-27 22:24:44,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987796683] [2022-04-27 22:24:44,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:24:44,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 22:24:44,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:24:44,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:24:48,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 17 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 22:24:48,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:24:48,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:24:48,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:24:48,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-27 22:24:48,311 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:24:50,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:24:52,543 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:24:54,667 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:24:56,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:24:59,157 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:24:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:24:59,368 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2022-04-27 22:24:59,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:24:59,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 22:24:59,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:24:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:24:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-27 22:24:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:24:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-27 22:24:59,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-27 22:25:03,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 37 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 22:25:03,630 INFO L225 Difference]: With dead ends: 45 [2022-04-27 22:25:03,630 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 22:25:03,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-27 22:25:03,631 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-04-27 22:25:03,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 10.8s Time] [2022-04-27 22:25:03,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 22:25:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-04-27 22:25:03,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:25:03,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 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 22:25:03,645 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 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 22:25:03,645 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 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 22:25:03,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:25:03,646 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-27 22:25:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-04-27 22:25:03,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:25:03,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:25:03,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 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 40 states. [2022-04-27 22:25:03,647 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 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 40 states. [2022-04-27 22:25:03,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:25:03,648 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-27 22:25:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-04-27 22:25:03,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:25:03,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:25:03,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:25:03,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:25:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 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 22:25:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2022-04-27 22:25:03,649 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 21 [2022-04-27 22:25:03,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:25:03,649 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2022-04-27 22:25:03,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-27 22:25:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 22:25:03,650 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:25:03,650 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:25:03,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 22:25:03,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:25:03,852 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:25:03,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:25:03,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2116274639, now seen corresponding path program 1 times [2022-04-27 22:25:03,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:25:03,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140633565] [2022-04-27 22:25:03,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:25:03,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:25:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:25:03,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:25:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:25:03,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {1562#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {1555#true} is VALID [2022-04-27 22:25:03,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {1555#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-27 22:25:03,920 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1555#true} {1555#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-27 22:25:03,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {1555#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1562#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:25:03,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {1562#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {1555#true} is VALID [2022-04-27 22:25:03,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {1555#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-27 22:25:03,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1555#true} {1555#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-27 22:25:03,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {1555#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-27 22:25:03,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {1555#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1560#(= main_~l~0 0)} is VALID [2022-04-27 22:25:03,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {1560#(= main_~l~0 0)} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1560#(= main_~l~0 0)} is VALID [2022-04-27 22:25:03,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1560#(= main_~l~0 0)} is VALID [2022-04-27 22:25:03,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {1560#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1560#(= main_~l~0 0)} is VALID [2022-04-27 22:25:03,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {1560#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:25:03,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:25:03,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:25:03,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:25:03,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:25:03,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:25:03,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {1561#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1556#false} is VALID [2022-04-27 22:25:03,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {1556#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1556#false} is VALID [2022-04-27 22:25:03,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {1556#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1556#false} is VALID [2022-04-27 22:25:03,925 INFO L272 TraceCheckUtils]: 18: Hoare triple {1556#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1556#false} is VALID [2022-04-27 22:25:03,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {1556#false} [95] __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] {1556#false} is VALID [2022-04-27 22:25:03,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {1556#false} [99] 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[] {1556#false} is VALID [2022-04-27 22:25:03,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {1556#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1556#false} is VALID [2022-04-27 22:25:03,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:25:03,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:25:03,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140633565] [2022-04-27 22:25:03,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140633565] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:25:03,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471880388] [2022-04-27 22:25:03,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:25:03,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:25:03,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:25:03,927 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:25:03,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 22:25:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:25:03,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 22:25:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:25:03,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:25:04,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {1555#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-27 22:25:04,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {1555#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {1555#true} is VALID [2022-04-27 22:25:04,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {1555#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-27 22:25:04,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1555#true} {1555#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-27 22:25:04,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {1555#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-27 22:25:04,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {1555#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1581#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:04,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {1581#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1581#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:04,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {1581#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1581#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:04,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {1581#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1591#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:04,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {1591#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:04,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:04,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:04,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:04,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:04,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:04,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {1595#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1614#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:04,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {1614#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1618#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:04,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {1618#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1618#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:04,378 INFO L272 TraceCheckUtils]: 18: Hoare triple {1618#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1625#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:25:04,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {1625#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {1629#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:25:04,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {1629#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {1556#false} is VALID [2022-04-27 22:25:04,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {1556#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1556#false} is VALID [2022-04-27 22:25:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:25:04,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:25:04,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {1556#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1556#false} is VALID [2022-04-27 22:25:04,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {1629#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {1556#false} is VALID [2022-04-27 22:25:04,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {1625#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {1629#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:25:04,619 INFO L272 TraceCheckUtils]: 18: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1625#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:25:04,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:04,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:04,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-27 22:25:04,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:04,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:04,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:04,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:04,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:04,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:06,744 WARN L290 TraceCheckUtils]: 8: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1652#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:25:06,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:06,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:06,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {1555#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1645#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:06,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {1555#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-27 22:25:06,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1555#true} {1555#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-27 22:25:06,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {1555#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-27 22:25:06,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {1555#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {1555#true} is VALID [2022-04-27 22:25:06,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {1555#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1555#true} is VALID [2022-04-27 22:25:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 22:25:06,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471880388] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:25:06,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:25:06,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-27 22:25:06,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299054014] [2022-04-27 22:25:06,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:25:06,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 22:25:06,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:25:06,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:08,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 22:25:08,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:25:08,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:25:08,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:25:08,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-27 22:25:08,949 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:11,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:25:13,178 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:25:15,303 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:25:17,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:25:21,763 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:25:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:25:22,034 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2022-04-27 22:25:22,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:25:22,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 22:25:22,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:25:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 22:25:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 22:25:22,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-27 22:25:24,332 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 22:25:24,334 INFO L225 Difference]: With dead ends: 53 [2022-04-27 22:25:24,334 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 22:25:24,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-27 22:25:24,335 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-04-27 22:25:24,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 5 Unknown, 0 Unchecked, 10.8s Time] [2022-04-27 22:25:24,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 22:25:24,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-27 22:25:24,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:25:24,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:24,358 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:24,358 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:24,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:25:24,359 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-27 22:25:24,359 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-27 22:25:24,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:25:24,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:25:24,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-27 22:25:24,360 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-27 22:25:24,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:25:24,361 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-27 22:25:24,362 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-27 22:25:24,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:25:24,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:25:24,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:25:24,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:25:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2022-04-27 22:25:24,363 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 22 [2022-04-27 22:25:24,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:25:24,364 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2022-04-27 22:25:24,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:24,364 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-27 22:25:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 22:25:24,364 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:25:24,364 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:25:24,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 22:25:24,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:25:24,579 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:25:24,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:25:24,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1618193969, now seen corresponding path program 1 times [2022-04-27 22:25:24,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:25:24,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471771448] [2022-04-27 22:25:24,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:25:24,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:25:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:25:24,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:25:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:25:24,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {1938#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {1930#true} is VALID [2022-04-27 22:25:24,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {1930#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-27 22:25:24,667 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1930#true} {1930#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-27 22:25:24,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {1930#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1938#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:25:24,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {1938#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {1930#true} is VALID [2022-04-27 22:25:24,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {1930#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-27 22:25:24,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1930#true} {1930#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-27 22:25:24,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {1930#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-27 22:25:24,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {1930#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1935#(= main_~l~0 0)} is VALID [2022-04-27 22:25:24,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {1935#(= main_~l~0 0)} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1935#(= main_~l~0 0)} is VALID [2022-04-27 22:25:24,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {1935#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1935#(= main_~l~0 0)} is VALID [2022-04-27 22:25:24,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {1935#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1935#(= main_~l~0 0)} is VALID [2022-04-27 22:25:24,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {1935#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1936#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:25:24,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {1936#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1936#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:25:24,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {1936#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1936#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:25:24,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1936#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:25:24,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1937#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-27 22:25:24,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {1937#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1937#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-27 22:25:24,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {1937#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1937#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-27 22:25:24,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {1937#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1937#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-27 22:25:24,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {1937#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {1931#false} is VALID [2022-04-27 22:25:24,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {1931#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1931#false} is VALID [2022-04-27 22:25:24,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {1931#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1931#false} is VALID [2022-04-27 22:25:24,673 INFO L272 TraceCheckUtils]: 20: Hoare triple {1931#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1931#false} is VALID [2022-04-27 22:25:24,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {1931#false} [95] __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] {1931#false} is VALID [2022-04-27 22:25:24,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {1931#false} [99] 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[] {1931#false} is VALID [2022-04-27 22:25:24,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {1931#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1931#false} is VALID [2022-04-27 22:25:24,674 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:25:24,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:25:24,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471771448] [2022-04-27 22:25:24,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471771448] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:25:24,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131041402] [2022-04-27 22:25:24,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:25:24,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:25:24,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:25:24,675 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:25:24,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 22:25:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:25:24,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 22:25:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:25:24,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:25:25,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {1930#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-27 22:25:25,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {1930#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {1930#true} is VALID [2022-04-27 22:25:25,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {1930#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-27 22:25:25,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1930#true} {1930#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-27 22:25:25,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {1930#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-27 22:25:25,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {1930#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1957#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:25,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {1957#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1957#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:25,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {1957#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1957#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:25,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {1957#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1967#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:25,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {1967#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1971#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:25,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {1971#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1971#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:25,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {1971#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1971#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:25,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {1971#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1981#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:25:25,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {1981#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1985#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:25:25,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {1985#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1985#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:25:25,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {1985#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1985#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:25:25,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {1985#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1985#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:25:25,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {1985#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {1998#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-27 22:25:25,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {1998#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2002#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-27 22:25:25,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {2002#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2002#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-27 22:25:25,202 INFO L272 TraceCheckUtils]: 20: Hoare triple {2002#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2009#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:25:25,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {2009#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {2013#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:25:25,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {2013#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {1931#false} is VALID [2022-04-27 22:25:25,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {1931#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1931#false} is VALID [2022-04-27 22:25:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:25:25,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:25:25,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {1931#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1931#false} is VALID [2022-04-27 22:25:25,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {2013#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {1931#false} is VALID [2022-04-27 22:25:25,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {2009#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {2013#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:25:25,594 INFO L272 TraceCheckUtils]: 20: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2009#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:25:25,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:25,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {2036#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:25,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {2036#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-27 22:25:25,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:25,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:25,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:25,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {2036#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:25,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2036#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-27 22:25:25,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:25,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:25,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {2036#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:25,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2036#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-27 22:25:25,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:25,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:25,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {1930#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2029#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:25,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {1930#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-27 22:25:25,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1930#true} {1930#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-27 22:25:25,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {1930#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-27 22:25:25,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {1930#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {1930#true} is VALID [2022-04-27 22:25:25,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {1930#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1930#true} is VALID [2022-04-27 22:25:25,681 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-27 22:25:25,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131041402] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:25:25,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:25:25,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 11] total 17 [2022-04-27 22:25:25,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219627840] [2022-04-27 22:25:25,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:25:25,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 22:25:25,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:25:25,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:29,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 17 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 22:25:29,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:25:29,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:25:29,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:25:29,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 22:25:29,946 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:31,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:25:34,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:25:36,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:25:38,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:25:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:25:40,839 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2022-04-27 22:25:40,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:25:40,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 22:25:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:25:40,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:40,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-27 22:25:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:40,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-27 22:25:40,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-27 22:25:45,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 37 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 22:25:45,293 INFO L225 Difference]: With dead ends: 59 [2022-04-27 22:25:45,293 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 22:25:45,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-04-27 22:25:45,294 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-04-27 22:25:45,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 4 Unknown, 0 Unchecked, 8.5s Time] [2022-04-27 22:25:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 22:25:45,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-04-27 22:25:45,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:25:45,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:45,311 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:45,311 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:25:45,313 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-04-27 22:25:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2022-04-27 22:25:45,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:25:45,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:25:45,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-27 22:25:45,313 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-27 22:25:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:25:45,315 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-04-27 22:25:45,315 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2022-04-27 22:25:45,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:25:45,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:25:45,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:25:45,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:25:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2022-04-27 22:25:45,317 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 24 [2022-04-27 22:25:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:25:45,317 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2022-04-27 22:25:45,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2022-04-27 22:25:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 22:25:45,318 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:25:45,318 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:25:45,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 22:25:45,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:25:45,532 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:25:45,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:25:45,532 INFO L85 PathProgramCache]: Analyzing trace with hash 850752026, now seen corresponding path program 1 times [2022-04-27 22:25:45,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:25:45,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524746141] [2022-04-27 22:25:45,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:25:45,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:25:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:25:45,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:25:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:25:45,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {2346#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {2347#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:25:45,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {2347#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2347#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:25:45,909 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2347#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2335#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2340#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:25:45,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {2335#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2346#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:25:45,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {2346#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {2347#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:25:45,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {2347#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2347#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:25:45,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2347#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2335#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2340#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:25:45,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {2340#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2340#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:25:45,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {2340#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2341#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:25:45,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {2341#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2342#(= main_~l~0 0)} is VALID [2022-04-27 22:25:45,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {2342#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2342#(= main_~l~0 0)} is VALID [2022-04-27 22:25:45,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {2342#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2342#(= main_~l~0 0)} is VALID [2022-04-27 22:25:45,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {2342#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2343#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:25:45,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {2343#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2343#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:25:45,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {2343#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2343#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:25:45,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {2343#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2343#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:25:45,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {2343#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2344#(<= (+ 2 (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 3 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296)) main_~l~0)} is VALID [2022-04-27 22:25:45,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {2344#(<= (+ 2 (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 3 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296)) main_~l~0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2345#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-27 22:25:45,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {2345#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2345#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-27 22:25:45,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {2345#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2345#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-27 22:25:45,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {2345#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2345#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-27 22:25:45,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {2345#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {2336#false} is VALID [2022-04-27 22:25:45,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {2336#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2336#false} is VALID [2022-04-27 22:25:45,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {2336#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2336#false} is VALID [2022-04-27 22:25:45,929 INFO L272 TraceCheckUtils]: 21: Hoare triple {2336#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2336#false} is VALID [2022-04-27 22:25:45,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {2336#false} [95] __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] {2336#false} is VALID [2022-04-27 22:25:45,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {2336#false} [99] 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[] {2336#false} is VALID [2022-04-27 22:25:45,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {2336#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2336#false} is VALID [2022-04-27 22:25:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:25:45,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:25:45,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524746141] [2022-04-27 22:25:45,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524746141] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:25:45,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047961354] [2022-04-27 22:25:45,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:25:45,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:25:45,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:25:45,931 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:25:45,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 22:25:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:25:45,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 22:25:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:25:45,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:25:46,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {2335#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-27 22:25:46,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {2335#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {2335#true} is VALID [2022-04-27 22:25:46,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {2335#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-27 22:25:46,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2335#true} {2335#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-27 22:25:46,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {2335#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-27 22:25:46,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {2335#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2366#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:46,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {2366#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2366#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:46,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {2366#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2366#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:46,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {2366#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2376#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:46,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {2376#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2380#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:46,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {2380#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2380#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:46,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {2380#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2380#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:25:46,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {2380#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2390#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:25:46,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {2390#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:25:46,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:25:46,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:25:46,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:25:46,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:25:46,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {2394#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {2410#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:25:46,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {2410#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2414#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:25:46,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {2414#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2414#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:25:46,659 INFO L272 TraceCheckUtils]: 21: Hoare triple {2414#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:25:46,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {2425#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:25:46,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {2425#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {2336#false} is VALID [2022-04-27 22:25:46,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {2336#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2336#false} is VALID [2022-04-27 22:25:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:25:46,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:25:47,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {2336#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2336#false} is VALID [2022-04-27 22:25:47,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {2425#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {2336#false} is VALID [2022-04-27 22:25:47,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {2425#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:25:47,077 INFO L272 TraceCheckUtils]: 21: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:25:47,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:47,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:49,192 WARN L290 TraceCheckUtils]: 18: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {2448#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:25:49,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:49,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:49,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:49,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:49,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {2448#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:51,313 WARN L290 TraceCheckUtils]: 12: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2448#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:25:51,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:51,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:51,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {2448#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:53,429 WARN L290 TraceCheckUtils]: 8: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2448#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:25:53,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:53,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:53,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {2335#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2441#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:25:53,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {2335#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-27 22:25:53,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2335#true} {2335#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-27 22:25:53,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {2335#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-27 22:25:53,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {2335#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {2335#true} is VALID [2022-04-27 22:25:53,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {2335#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2335#true} is VALID [2022-04-27 22:25:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-27 22:25:53,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047961354] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:25:53,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:25:53,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 21 [2022-04-27 22:25:53,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464948564] [2022-04-27 22:25:53,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:25:53,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 22:25:53,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:25:53,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:25:59,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 17 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 22:25:59,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:25:59,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:25:59,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:25:59,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-04-27 22:25:59,819 INFO L87 Difference]: Start difference. First operand 45 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:03,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:26:06,167 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:26:08,284 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:26:10,398 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:26:12,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:26:12,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:26:12,909 INFO L93 Difference]: Finished difference Result 56 states and 81 transitions. [2022-04-27 22:26:12,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:26:12,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 22:26:12,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:26:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-27 22:26:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-27 22:26:12,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-27 22:26:19,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 36 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 22:26:19,357 INFO L225 Difference]: With dead ends: 56 [2022-04-27 22:26:19,358 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 22:26:19,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-04-27 22:26:19,358 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-04-27 22:26:19,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 10.5s Time] [2022-04-27 22:26:19,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 22:26:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-04-27 22:26:19,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:26:19,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:19,370 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:19,370 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:19,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:26:19,371 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2022-04-27 22:26:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2022-04-27 22:26:19,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:26:19,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:26:19,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-27 22:26:19,372 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-27 22:26:19,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:26:19,373 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2022-04-27 22:26:19,373 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2022-04-27 22:26:19,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:26:19,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:26:19,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:26:19,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:26:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2022-04-27 22:26:19,374 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 25 [2022-04-27 22:26:19,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:26:19,374 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2022-04-27 22:26:19,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2022-04-27 22:26:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 22:26:19,374 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:26:19,374 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:26:19,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 22:26:19,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:26:19,589 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:26:19,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:26:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash 309895635, now seen corresponding path program 1 times [2022-04-27 22:26:19,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:26:19,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439577511] [2022-04-27 22:26:19,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:26:19,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:26:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:26:19,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:26:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:26:19,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {2743#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {2744#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:26:19,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {2744#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2744#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:26:19,809 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2744#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2734#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2739#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:26:19,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {2734#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2743#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:26:19,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {2743#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {2744#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:26:19,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {2744#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2744#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:26:19,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2744#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2734#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2739#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:26:19,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {2739#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2739#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:26:19,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {2739#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2740#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:26:19,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {2740#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2741#(= main_~l~0 0)} is VALID [2022-04-27 22:26:19,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {2741#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2741#(= main_~l~0 0)} is VALID [2022-04-27 22:26:19,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {2741#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2741#(= main_~l~0 0)} is VALID [2022-04-27 22:26:19,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {2741#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2742#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-27 22:26:19,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {2742#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2742#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-27 22:26:19,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {2742#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2742#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-27 22:26:19,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {2742#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2735#false} is VALID [2022-04-27 22:26:19,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {2735#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2735#false} is VALID [2022-04-27 22:26:19,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {2735#false} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-27 22:26:19,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {2735#false} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-27 22:26:19,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {2735#false} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-27 22:26:19,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {2735#false} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-27 22:26:19,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {2735#false} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-27 22:26:19,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {2735#false} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {2735#false} is VALID [2022-04-27 22:26:19,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {2735#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2735#false} is VALID [2022-04-27 22:26:19,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {2735#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-27 22:26:19,817 INFO L272 TraceCheckUtils]: 22: Hoare triple {2735#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2735#false} is VALID [2022-04-27 22:26:19,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {2735#false} [95] __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] {2735#false} is VALID [2022-04-27 22:26:19,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {2735#false} [99] 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[] {2735#false} is VALID [2022-04-27 22:26:19,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {2735#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-27 22:26:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 22:26:19,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:26:19,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439577511] [2022-04-27 22:26:19,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439577511] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:26:19,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898451640] [2022-04-27 22:26:19,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:26:19,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:26:19,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:26:19,821 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:26:19,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 22:26:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:26:19,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 22:26:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:26:19,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:26:20,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {2734#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-27 22:26:20,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {2734#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {2734#true} is VALID [2022-04-27 22:26:20,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {2734#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-27 22:26:20,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2734#true} {2734#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-27 22:26:20,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {2734#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-27 22:26:20,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {2734#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2763#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:20,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {2763#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2763#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:20,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {2763#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2763#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:20,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {2763#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2773#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:20,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {2773#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:20,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {2777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:20,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {2777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:20,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {2777#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2787#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 22:26:20,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {2787#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 22:26:20,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 22:26:20,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 22:26:20,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 22:26:20,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 22:26:20,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 22:26:20,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {2791#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {2810#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-27 22:26:20,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {2810#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-27 22:26:20,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {2814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-27 22:26:20,492 INFO L272 TraceCheckUtils]: 22: Hoare triple {2814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2821#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:26:20,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {2821#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {2825#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:26:20,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {2825#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {2735#false} is VALID [2022-04-27 22:26:20,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {2735#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-27 22:26:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:26:20,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:26:20,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {2735#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2735#false} is VALID [2022-04-27 22:26:20,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {2825#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {2735#false} is VALID [2022-04-27 22:26:20,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {2821#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {2825#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:26:20,805 INFO L272 TraceCheckUtils]: 22: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2821#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:26:20,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:20,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {2848#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:20,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {2848#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-27 22:26:20,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:20,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:20,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:20,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:20,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:20,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {2848#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:22,931 WARN L290 TraceCheckUtils]: 12: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2848#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:26:22,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:22,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:22,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {2848#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:25,044 WARN L290 TraceCheckUtils]: 8: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2848#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:26:25,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:25,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:25,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {2734#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2841#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:25,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {2734#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-27 22:26:25,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2734#true} {2734#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-27 22:26:25,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {2734#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-27 22:26:25,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {2734#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {2734#true} is VALID [2022-04-27 22:26:25,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {2734#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2734#true} is VALID [2022-04-27 22:26:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-27 22:26:25,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898451640] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:26:25,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:26:25,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 11] total 19 [2022-04-27 22:26:25,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445551625] [2022-04-27 22:26:25,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:26:25,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 22:26:25,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:26:25,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:29,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 19 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 22:26:29,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:26:29,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:26:29,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:26:29,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-04-27 22:26:29,338 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:31,377 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:26:33,503 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:26:35,671 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:26:37,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:26:40,013 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:26:42,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:26:44,453 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:26:44,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:26:44,614 INFO L93 Difference]: Finished difference Result 58 states and 85 transitions. [2022-04-27 22:26:44,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:26:44,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 22:26:44,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:26:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 22:26:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 22:26:44,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-27 22:26:46,809 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 22:26:46,811 INFO L225 Difference]: With dead ends: 58 [2022-04-27 22:26:46,811 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 22:26:46,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-04-27 22:26:46,812 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2022-04-27 22:26:46,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 7 Unknown, 0 Unchecked, 14.9s Time] [2022-04-27 22:26:46,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 22:26:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2022-04-27 22:26:46,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:26:46,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:46,825 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:46,825 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:46,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:26:46,826 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2022-04-27 22:26:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2022-04-27 22:26:46,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:26:46,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:26:46,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-27 22:26:46,826 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-27 22:26:46,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:26:46,827 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2022-04-27 22:26:46,827 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2022-04-27 22:26:46,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:26:46,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:26:46,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:26:46,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:26:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2022-04-27 22:26:46,828 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 26 [2022-04-27 22:26:46,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:26:46,828 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2022-04-27 22:26:46,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2022-04-27 22:26:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 22:26:46,828 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:26:46,828 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:26:46,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 22:26:47,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 22:26:47,044 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:26:47,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:26:47,044 INFO L85 PathProgramCache]: Analyzing trace with hash 522176238, now seen corresponding path program 1 times [2022-04-27 22:26:47,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:26:47,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595093882] [2022-04-27 22:26:47,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:26:47,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:26:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:26:47,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:26:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:26:47,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {3156#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {3157#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:26:47,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {3157#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3157#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:26:47,343 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3157#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {3143#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3148#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:26:47,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {3143#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3156#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:26:47,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {3156#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {3157#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:26:47,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {3157#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3157#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:26:47,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3157#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {3143#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3148#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:26:47,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {3148#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3148#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:26:47,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {3148#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {3149#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:26:47,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {3149#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3150#(= main_~l~0 0)} is VALID [2022-04-27 22:26:47,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {3150#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3150#(= main_~l~0 0)} is VALID [2022-04-27 22:26:47,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {3150#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {3150#(= main_~l~0 0)} is VALID [2022-04-27 22:26:47,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {3150#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3151#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} is VALID [2022-04-27 22:26:47,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {3151#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3152#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-27 22:26:47,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {3152#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3152#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-27 22:26:47,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {3152#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3152#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-27 22:26:47,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {3152#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3152#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-27 22:26:47,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {3152#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {3153#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-27 22:26:47,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {3153#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-27 22:26:47,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-27 22:26:47,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-27 22:26:47,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-27 22:26:47,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-27 22:26:47,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-27 22:26:47,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-27 22:26:47,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {3154#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3155#(<= (+ 2147483647 main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-27 22:26:47,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {3155#(<= (+ 2147483647 main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3144#false} is VALID [2022-04-27 22:26:47,364 INFO L272 TraceCheckUtils]: 24: Hoare triple {3144#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {3144#false} is VALID [2022-04-27 22:26:47,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {3144#false} [95] __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] {3144#false} is VALID [2022-04-27 22:26:47,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {3144#false} [99] 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[] {3144#false} is VALID [2022-04-27 22:26:47,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {3144#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3144#false} is VALID [2022-04-27 22:26:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:26:47,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:26:47,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595093882] [2022-04-27 22:26:47,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595093882] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:26:47,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122559861] [2022-04-27 22:26:47,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:26:47,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:26:47,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:26:47,366 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:26:47,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 22:26:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:26:47,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 22:26:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:26:47,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:26:48,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {3143#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-27 22:26:48,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {3143#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {3143#true} is VALID [2022-04-27 22:26:48,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {3143#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-27 22:26:48,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3143#true} {3143#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-27 22:26:48,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {3143#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-27 22:26:48,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {3143#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {3176#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {3176#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3176#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {3176#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3176#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {3176#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {3186#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {3186#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {3190#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {3206#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {3206#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {3210#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {3229#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {3229#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3233#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {3233#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3233#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-27 22:26:48,113 INFO L272 TraceCheckUtils]: 24: Hoare triple {3233#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {3240#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:26:48,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {3240#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {3244#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:26:48,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {3244#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {3144#false} is VALID [2022-04-27 22:26:48,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {3144#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3144#false} is VALID [2022-04-27 22:26:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:26:48,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:26:48,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {3144#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3144#false} is VALID [2022-04-27 22:26:48,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {3244#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {3144#false} is VALID [2022-04-27 22:26:48,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {3240#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {3244#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:26:48,525 INFO L272 TraceCheckUtils]: 24: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {3240#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:26:48,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:48,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {3267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:48,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {3267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-27 22:26:48,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:48,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:48,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:48,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:48,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:48,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {3267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:50,665 WARN L290 TraceCheckUtils]: 14: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {3267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:26:50,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:50,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:50,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:50,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:50,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {3267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:52,788 WARN L290 TraceCheckUtils]: 8: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {3267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:26:52,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:52,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:52,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {3143#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {3260#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:26:52,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {3143#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-27 22:26:52,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3143#true} {3143#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-27 22:26:52,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {3143#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-27 22:26:52,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {3143#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {3143#true} is VALID [2022-04-27 22:26:52,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {3143#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3143#true} is VALID [2022-04-27 22:26:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 22:26:52,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122559861] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:26:52,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:26:52,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 11] total 23 [2022-04-27 22:26:52,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900770872] [2022-04-27 22:26:52,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:26:52,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 22:26:52,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:26:52,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:57,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 19 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 22:26:57,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:26:57,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:26:57,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:26:57,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-04-27 22:26:57,084 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:26:59,144 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:27:01,307 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:27:03,423 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:27:05,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:27:07,743 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:27:09,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:27:10,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:27:10,156 INFO L93 Difference]: Finished difference Result 71 states and 107 transitions. [2022-04-27 22:27:10,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:27:10,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 22:27:10,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:27:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:27:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 22:27:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:27:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 22:27:10,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-27 22:27:14,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 39 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 22:27:14,546 INFO L225 Difference]: With dead ends: 71 [2022-04-27 22:27:14,546 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 22:27:14,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-04-27 22:27:14,547 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2022-04-27 22:27:14,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 6 Unknown, 0 Unchecked, 12.8s Time] [2022-04-27 22:27:14,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 22:27:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-27 22:27:14,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:27:14,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 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 22:27:14,566 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 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 22:27:14,567 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 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 22:27:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:27:14,567 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-27 22:27:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-27 22:27:14,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:27:14,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:27:14,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 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 66 states. [2022-04-27 22:27:14,568 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 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 66 states. [2022-04-27 22:27:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:27:14,569 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-27 22:27:14,569 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-27 22:27:14,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:27:14,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:27:14,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:27:14,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:27:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 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 22:27:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2022-04-27 22:27:14,570 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 28 [2022-04-27 22:27:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:27:14,570 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2022-04-27 22:27:14,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:27:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-27 22:27:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 22:27:14,571 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:27:14,571 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:27:14,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 22:27:14,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:27:14,785 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:27:14,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:27:14,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2133946640, now seen corresponding path program 1 times [2022-04-27 22:27:14,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:27:14,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448781801] [2022-04-27 22:27:14,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:27:14,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:27:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:27:14,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:27:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:27:14,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {3648#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {3639#true} is VALID [2022-04-27 22:27:14,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {3639#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-27 22:27:14,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3639#true} {3639#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-27 22:27:14,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {3639#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3648#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:27:14,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {3648#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {3639#true} is VALID [2022-04-27 22:27:14,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {3639#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-27 22:27:14,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3639#true} {3639#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-27 22:27:14,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {3639#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-27 22:27:14,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {3639#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {3644#(= main_~l~0 0)} is VALID [2022-04-27 22:27:14,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {3644#(= main_~l~0 0)} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3644#(= main_~l~0 0)} is VALID [2022-04-27 22:27:14,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {3644#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3644#(= main_~l~0 0)} is VALID [2022-04-27 22:27:14,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {3644#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {3644#(= main_~l~0 0)} is VALID [2022-04-27 22:27:14,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {3644#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3645#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:27:14,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {3645#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3645#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:27:14,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {3645#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3645#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:27:14,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {3645#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {3645#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-27 22:27:14,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {3645#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-27 22:27:14,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-27 22:27:14,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-27 22:27:14,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-27 22:27:14,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-27 22:27:14,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-27 22:27:14,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {3646#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-27 22:27:14,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-27 22:27:14,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-27 22:27:14,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-27 22:27:14,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-27 22:27:14,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-27 22:27:14,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {3647#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {3640#false} is VALID [2022-04-27 22:27:14,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {3640#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3640#false} is VALID [2022-04-27 22:27:14,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {3640#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3640#false} is VALID [2022-04-27 22:27:14,876 INFO L272 TraceCheckUtils]: 28: Hoare triple {3640#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {3640#false} is VALID [2022-04-27 22:27:14,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {3640#false} [95] __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] {3640#false} is VALID [2022-04-27 22:27:14,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {3640#false} [99] 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[] {3640#false} is VALID [2022-04-27 22:27:14,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {3640#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3640#false} is VALID [2022-04-27 22:27:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:27:14,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:27:14,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448781801] [2022-04-27 22:27:14,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448781801] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:27:14,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351747961] [2022-04-27 22:27:14,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:27:14,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:27:14,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:27:14,878 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:27:14,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 22:27:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:27:14,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 22:27:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:27:14,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:27:15,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {3639#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-27 22:27:15,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {3639#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {3639#true} is VALID [2022-04-27 22:27:15,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {3639#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-27 22:27:15,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3639#true} {3639#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-27 22:27:15,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {3639#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-27 22:27:15,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {3639#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {3667#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:27:15,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {3667#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3667#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:27:15,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {3667#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3667#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:27:15,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {3667#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {3677#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:27:15,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {3677#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3681#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:27:15,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {3681#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3681#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:27:15,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {3681#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3681#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-27 22:27:15,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {3681#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {3691#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:27:15,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {3691#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:27:15,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:27:15,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:27:15,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:27:15,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:27:15,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {3695#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {3711#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:27:15,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {3711#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:27:15,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:27:15,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:27:15,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:27:15,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:27:15,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:27:15,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {3715#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {3734#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:27:15,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {3734#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3738#(and (= 3 (+ (- 1) main_~l~0)) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:27:15,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {3738#(and (= 3 (+ (- 1) main_~l~0)) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3738#(and (= 3 (+ (- 1) main_~l~0)) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-27 22:27:15,587 INFO L272 TraceCheckUtils]: 28: Hoare triple {3738#(and (= 3 (+ (- 1) main_~l~0)) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {3745#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:27:15,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {3745#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {3749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:27:15,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {3749#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {3640#false} is VALID [2022-04-27 22:27:15,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {3640#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3640#false} is VALID [2022-04-27 22:27:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:27:15,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:27:15,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {3640#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3640#false} is VALID [2022-04-27 22:27:15,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {3749#(<= 1 __VERIFIER_assert_~cond)} [99] 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[] {3640#false} is VALID [2022-04-27 22:27:15,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {3745#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __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] {3749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:27:15,937 INFO L272 TraceCheckUtils]: 28: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {3745#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:27:15,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:15,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {3772#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:15,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {3772#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-27 22:27:15,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:15,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:15,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:15,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:15,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:15,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {3772#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:18,050 WARN L290 TraceCheckUtils]: 18: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {3772#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:27:18,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:18,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:18,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:18,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:18,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {3772#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:20,185 WARN L290 TraceCheckUtils]: 12: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {3772#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:27:20,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:20,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:20,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {3772#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:22,309 WARN L290 TraceCheckUtils]: 8: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {3772#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-27 22:27:22,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:22,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:22,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {3639#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {3765#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:27:22,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {3639#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-27 22:27:22,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3639#true} {3639#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-27 22:27:22,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {3639#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-27 22:27:22,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {3639#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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_3, #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] {3639#true} is VALID [2022-04-27 22:27:22,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {3639#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3639#true} is VALID [2022-04-27 22:27:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-27 22:27:22,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351747961] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:27:22,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:27:22,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 13] total 20 [2022-04-27 22:27:22,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672337578] [2022-04-27 22:27:22,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:27:22,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 22:27:22,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:27:22,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:27:28,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 19 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 22:27:28,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:27:28,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:27:28,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:27:28,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-27 22:27:28,676 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:27:30,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:27:32,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:27:35,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:27:35,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:27:35,505 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-27 22:27:35,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:27:35,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 22:27:35,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:27:35,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:27:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 22:27:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:27:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 22:27:35,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-27 22:27:41,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 21 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 22:27:41,942 INFO L225 Difference]: With dead ends: 66 [2022-04-27 22:27:41,942 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 22:27:41,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-04-27 22:27:41,942 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-27 22:27:41,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 3 Unknown, 0 Unchecked, 6.4s Time] [2022-04-27 22:27:41,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 22:27:41,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 22:27:41,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:27:41,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:27:41,943 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:27:41,943 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:27:41,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:27:41,943 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:27:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:27:41,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:27:41,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:27:41,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 22:27:41,944 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 22:27:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:27:41,944 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:27:41,944 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:27:41,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:27:41,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:27:41,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:27:41,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:27:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:27:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 22:27:41,944 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2022-04-27 22:27:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:27:41,944 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 22:27:41,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:27:41,944 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:27:41,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:27:41,946 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 22:27:41,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 22:27:42,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 22:27:42,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 22:27:42,312 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 22:27:42,312 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:27:42,312 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:27:42,312 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 22:27:42,312 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-27 22:27:42,312 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:27:42,312 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:27:42,312 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 16 39) the Hoare annotation is: true [2022-04-27 22:27:42,312 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-04-27 22:27:42,312 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 16 39) no Hoare annotation was computed. [2022-04-27 22:27:42,313 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 36) the Hoare annotation is: (or (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-27 22:27:42,313 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 16 39) no Hoare annotation was computed. [2022-04-27 22:27:42,313 INFO L895 garLoopResultBuilder]: At program point L21-3(lines 21 36) the Hoare annotation is: (or (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-27 22:27:42,313 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 34) no Hoare annotation was computed. [2022-04-27 22:27:42,317 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-04-27 22:27:42,317 INFO L899 garLoopResultBuilder]: For program point L31-2(lines 23 34) no Hoare annotation was computed. [2022-04-27 22:27:42,317 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 34) no Hoare annotation was computed. [2022-04-27 22:27:42,317 INFO L899 garLoopResultBuilder]: For program point L27(lines 27 34) no Hoare annotation was computed. [2022-04-27 22:27:42,317 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2022-04-27 22:27:42,317 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 34) no Hoare annotation was computed. [2022-04-27 22:27:42,317 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-27 22:27:42,317 INFO L899 garLoopResultBuilder]: For program point L9(lines 9 11) no Hoare annotation was computed. [2022-04-27 22:27:42,317 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-27 22:27:42,317 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2022-04-27 22:27:42,317 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2022-04-27 22:27:42,317 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2022-04-27 22:27:42,320 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:27:42,321 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 22:27:42,326 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:27:42,326 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 22:27:42,326 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 22:27:42,326 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:27:42,326 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 22:27:42,326 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 22:27:42,326 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 22:27:42,326 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 22:27:42,326 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 22:27:42,326 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 22:27:42,328 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 22:27:42,328 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 22:27:42,328 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 22:27:42,328 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 22:27:42,328 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 22:27:42,328 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 22:27:42,328 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 22:27:42,328 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:27:42,328 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 22:27:42,328 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-04-27 22:27:42,329 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 22:27:42,329 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 22:27:42,329 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 22:27:42,329 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 22:27:42,329 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 22:27:42,329 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 22:27:42,329 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 22:27:42,329 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 22:27:42,329 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 22:27:42,329 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 22:27:42,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:27:42 BasicIcfg [2022-04-27 22:27:42,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 22:27:42,346 INFO L158 Benchmark]: Toolchain (without parser) took 330393.19ms. Allocated memory was 180.4MB in the beginning and 233.8MB in the end (delta: 53.5MB). Free memory was 123.7MB in the beginning and 144.6MB in the end (delta: -20.9MB). Peak memory consumption was 33.3MB. Max. memory is 8.0GB. [2022-04-27 22:27:42,346 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 180.4MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:27:42,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.36ms. Allocated memory was 180.4MB in the beginning and 233.8MB in the end (delta: 53.5MB). Free memory was 123.5MB in the beginning and 207.2MB in the end (delta: -83.7MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. [2022-04-27 22:27:42,346 INFO L158 Benchmark]: Boogie Preprocessor took 21.73ms. Allocated memory is still 233.8MB. Free memory was 207.2MB in the beginning and 205.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 22:27:42,346 INFO L158 Benchmark]: RCFGBuilder took 6779.86ms. Allocated memory is still 233.8MB. Free memory was 205.6MB in the beginning and 192.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 22:27:42,346 INFO L158 Benchmark]: IcfgTransformer took 27.85ms. Allocated memory is still 233.8MB. Free memory was 192.5MB in the beginning and 190.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 22:27:42,347 INFO L158 Benchmark]: TraceAbstraction took 323367.89ms. Allocated memory is still 233.8MB. Free memory was 190.4MB in the beginning and 144.6MB in the end (delta: 45.8MB). Peak memory consumption was 46.3MB. Max. memory is 8.0GB. [2022-04-27 22:27:42,347 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 180.4MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.36ms. Allocated memory was 180.4MB in the beginning and 233.8MB in the end (delta: 53.5MB). Free memory was 123.5MB in the beginning and 207.2MB in the end (delta: -83.7MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.73ms. Allocated memory is still 233.8MB. Free memory was 207.2MB in the beginning and 205.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 6779.86ms. Allocated memory is still 233.8MB. Free memory was 205.6MB in the beginning and 192.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 27.85ms. Allocated memory is still 233.8MB. Free memory was 192.5MB in the beginning and 190.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 323367.89ms. Allocated memory is still 233.8MB. Free memory was 190.4MB in the beginning and 144.6MB in the end (delta: 45.8MB). Peak memory consumption was 46.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 323.3s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 229.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 62 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 131.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 576 SdHoareTripleChecker+Invalid, 125.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 389 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 600 IncrementalHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 187 mSDtfsCounter, 600 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 586 GetRequests, 364 SyntacticMatches, 36 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=12, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 45 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 19 PreInvPairs, 26 NumberOfFragments, 64 HoareAnnotationTreeSize, 19 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 660 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 47.6s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 703 ConstructedInterpolants, 0 QuantifiedInterpolants, 8294 SizeOfPredicates, 10 NumberOfNonLiveVariables, 952 ConjunctsInSsa, 270 ConjunctsInUnsatCore, 33 InterpolantComputations, 13 PerfectInterpolantSequences, 140/307 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((i + k + j + v3 + v2 + v4) % 4294967296 == l % 4294967296 || !(20000001 <= SIZE)) || !(SIZE <= 20000001) RESULT: Ultimate proved your program to be correct! [2022-04-27 22:27:42,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...