/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/vnew2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 23:23:04,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 23:23:04,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 23:23:04,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 23:23:04,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 23:23:04,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 23:23:04,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 23:23:05,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 23:23:05,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 23:23:05,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 23:23:05,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 23:23:05,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 23:23:05,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 23:23:05,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 23:23:05,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 23:23:05,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 23:23:05,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 23:23:05,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 23:23:05,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 23:23:05,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 23:23:05,024 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 23:23:05,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 23:23:05,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 23:23:05,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 23:23:05,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 23:23:05,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 23:23:05,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 23:23:05,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 23:23:05,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 23:23:05,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 23:23:05,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 23:23:05,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 23:23:05,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 23:23:05,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 23:23:05,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 23:23:05,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 23:23:05,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 23:23:05,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 23:23:05,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 23:23:05,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 23:23:05,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 23:23:05,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 23:23:05,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 23:23:05,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 23:23:05,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 23:23:05,063 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 23:23:05,063 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 23:23:05,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 23:23:05,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 23:23:05,064 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 23:23:05,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 23:23:05,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 23:23:05,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 23:23:05,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 23:23:05,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 23:23:05,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 23:23:05,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 23:23:05,066 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 23:23:05,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 23:23:05,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 23:23:05,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 23:23:05,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 23:23:05,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:23:05,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 23:23:05,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 23:23:05,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 23:23:05,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 23:23:05,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 23:23:05,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 23:23:05,067 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 23:23:05,068 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 23:23:05,068 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 23:23:05,069 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-07 23:23:05,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 23:23:05,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 23:23:05,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 23:23:05,346 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 23:23:05,346 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 23:23:05,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/vnew2.c [2022-04-07 23:23:05,401 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f45e72fd/f1c3a1a3a5184136ab5815a0842fe931/FLAGc49ed4550 [2022-04-07 23:23:05,749 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 23:23:05,750 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/vnew2.c [2022-04-07 23:23:05,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f45e72fd/f1c3a1a3a5184136ab5815a0842fe931/FLAGc49ed4550 [2022-04-07 23:23:05,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f45e72fd/f1c3a1a3a5184136ab5815a0842fe931 [2022-04-07 23:23:05,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 23:23:05,775 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 23:23:05,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 23:23:05,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 23:23:05,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 23:23:05,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:23:05" (1/1) ... [2022-04-07 23:23:05,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f4f9e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:23:05, skipping insertion in model container [2022-04-07 23:23:05,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:23:05" (1/1) ... [2022-04-07 23:23:05,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 23:23:05,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 23:23:05,994 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/vnew2.c[403,416] [2022-04-07 23:23:06,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:23:06,022 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 23:23:06,032 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/vnew2.c[403,416] [2022-04-07 23:23:06,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:23:06,047 INFO L208 MainTranslator]: Completed translation [2022-04-07 23:23:06,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:23:06 WrapperNode [2022-04-07 23:23:06,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 23:23:06,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 23:23:06,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 23:23:06,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 23:23:06,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:23:06" (1/1) ... [2022-04-07 23:23:06,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:23:06" (1/1) ... [2022-04-07 23:23:06,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:23:06" (1/1) ... [2022-04-07 23:23:06,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:23:06" (1/1) ... [2022-04-07 23:23:06,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:23:06" (1/1) ... [2022-04-07 23:23:06,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:23:06" (1/1) ... [2022-04-07 23:23:06,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:23:06" (1/1) ... [2022-04-07 23:23:06,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 23:23:06,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 23:23:06,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 23:23:06,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 23:23:06,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:23:06" (1/1) ... [2022-04-07 23:23:06,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:23:06,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:23:06,103 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-07 23:23:06,105 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-07 23:23:06,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 23:23:06,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 23:23:06,141 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 23:23:06,141 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 23:23:06,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 23:23:06,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 23:23:06,141 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 23:23:06,141 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 23:23:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 23:23:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 23:23:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 23:23:06,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 23:23:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 23:23:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 23:23:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 23:23:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 23:23:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 23:23:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 23:23:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 23:23:06,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 23:23:06,193 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 23:23:06,195 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 23:23:06,350 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 23:23:06,355 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 23:23:06,356 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 23:23:06,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:23:06 BoogieIcfgContainer [2022-04-07 23:23:06,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 23:23:06,358 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 23:23:06,358 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 23:23:06,359 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 23:23:06,362 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:23:06" (1/1) ... [2022-04-07 23:23:06,363 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 23:23:06,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:23:06 BasicIcfg [2022-04-07 23:23:06,412 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 23:23:06,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 23:23:06,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 23:23:06,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 23:23:06,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:23:05" (1/4) ... [2022-04-07 23:23:06,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fdb7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:23:06, skipping insertion in model container [2022-04-07 23:23:06,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:23:06" (2/4) ... [2022-04-07 23:23:06,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fdb7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:23:06, skipping insertion in model container [2022-04-07 23:23:06,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:23:06" (3/4) ... [2022-04-07 23:23:06,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fdb7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:23:06, skipping insertion in model container [2022-04-07 23:23:06,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:23:06" (4/4) ... [2022-04-07 23:23:06,418 INFO L111 eAbstractionObserver]: Analyzing ICFG vnew2.cqvasr [2022-04-07 23:23:06,422 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 23:23:06,422 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 23:23:06,483 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 23:23:06,492 INFO L340 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 [2022-04-07 23:23:06,492 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 23:23:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 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-07 23:23:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 23:23:06,513 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:23:06,513 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:23:06,514 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:23:06,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:23:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash -310389807, now seen corresponding path program 1 times [2022-04-07 23:23:06,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:23:06,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026839483] [2022-04-07 23:23:06,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:23:06,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:23:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:23:06,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:23:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:23:06,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [60] 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) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {24#true} is VALID [2022-04-07 23:23:06,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 23:23:06,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 23:23:06,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:23:06,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [60] 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) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {24#true} is VALID [2022-04-07 23:23:06,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 23:23:06,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 23:23:06,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 23:23:06,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [62] mainENTRY-->L19: Formula: (= v_main_~n~0_4 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {24#true} is VALID [2022-04-07 23:23:06,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [65] L19-->L21-2: Formula: (and (= v_main_~k~0_4 0) (<= (mod v_main_~n~0_9 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~i~0_5 v_main_~j~0_4) (= v_main_~j~0_4 v_main_~k~0_4)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_9} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {24#true} is VALID [2022-04-07 23:23:06,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} [67] L21-2-->L21-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-07 23:23:06,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} [70] L21-3-->L27: Formula: (< 0 (mod v_main_~n~0_8 4294967296)) InVars {main_~n~0=v_main_~n~0_8} OutVars{main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-07 23:23:06,764 INFO L272 TraceCheckUtils]: 9: Hoare triple {25#false} [72] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~j~0_6 4294967296)) (.cse1 (mod v_main_~i~0_7 4294967296))) (and (= .cse0 (mod v_main_~k~0_6 4294967296)) (= .cse1 .cse0) (not (= (mod (mod .cse1 (mod (+ v_~SIZE~0_7 2) 4294967296)) 4294967296) 0)))) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_7, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {25#false} is VALID [2022-04-07 23:23:06,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [74] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-07 23:23:06,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [75] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-07 23:23:06,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} [77] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-07 23:23:06,767 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-07 23:23:06,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:23:06,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026839483] [2022-04-07 23:23:06,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026839483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:23:06,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:23:06,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 23:23:06,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546102901] [2022-04-07 23:23:06,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:23:06,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-07 23:23:06,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:23:06,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-07 23:23:06,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:23:06,813 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 23:23:06,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:23:06,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 23:23:06,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 23:23:06,839 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 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 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-07 23:23:06,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:23:06,934 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-07 23:23:06,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 23:23:06,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-07 23:23:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:23:06,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-07 23:23:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-07 23:23:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-07 23:23:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-07 23:23:06,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2022-04-07 23:23:07,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:23:07,026 INFO L225 Difference]: With dead ends: 34 [2022-04-07 23:23:07,027 INFO L226 Difference]: Without dead ends: 14 [2022-04-07 23:23:07,030 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 23:23:07,034 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 23 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-07 23:23:07,035 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 23 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:23:07,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-07 23:23:07,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-07 23:23:07,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:23:07,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07 23:23:07,067 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07 23:23:07,067 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07 23:23:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:23:07,073 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 23:23:07,073 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 23:23:07,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:23:07,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:23:07,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 14 states. [2022-04-07 23:23:07,074 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 14 states. [2022-04-07 23:23:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:23:07,078 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 23:23:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 23:23:07,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:23:07,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:23:07,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:23:07,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:23:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07 23:23:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-07 23:23:07,084 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 13 [2022-04-07 23:23:07,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:23:07,089 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-07 23:23:07,089 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-07 23:23:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 23:23:07,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 23:23:07,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:23:07,090 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:23:07,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 23:23:07,091 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:23:07,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:23:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash -281760656, now seen corresponding path program 1 times [2022-04-07 23:23:07,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:23:07,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735349080] [2022-04-07 23:23:07,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:23:07,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:23:07,129 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:23:07,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53978116] [2022-04-07 23:23:07,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:23:07,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:23:07,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:23:07,135 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-07 23:23:07,159 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-07 23:23:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:23:07,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-07 23:23:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:23:07,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:23:07,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {124#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-07 23:23:07,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {124#true} [60] 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) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {124#true} is VALID [2022-04-07 23:23:07,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {124#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-07 23:23:07,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124#true} {124#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-07 23:23:07,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {124#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-07 23:23:07,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {124#true} [62] mainENTRY-->L19: Formula: (= v_main_~n~0_4 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {124#true} is VALID [2022-04-07 23:23:07,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {124#true} [65] L19-->L21-2: Formula: (and (= v_main_~k~0_4 0) (<= (mod v_main_~n~0_9 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~i~0_5 v_main_~j~0_4) (= v_main_~j~0_4 v_main_~k~0_4)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_9} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {147#(= main_~i~0 0)} is VALID [2022-04-07 23:23:07,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {147#(= main_~i~0 0)} [68] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_1 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {151#(not (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-07 23:23:07,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {151#(not (< 0 (mod main_~n~0 4294967296)))} [70] L21-3-->L27: Formula: (< 0 (mod v_main_~n~0_8 4294967296)) InVars {main_~n~0=v_main_~n~0_8} OutVars{main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {125#false} is VALID [2022-04-07 23:23:07,269 INFO L272 TraceCheckUtils]: 9: Hoare triple {125#false} [72] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~j~0_6 4294967296)) (.cse1 (mod v_main_~i~0_7 4294967296))) (and (= .cse0 (mod v_main_~k~0_6 4294967296)) (= .cse1 .cse0) (not (= (mod (mod .cse1 (mod (+ v_~SIZE~0_7 2) 4294967296)) 4294967296) 0)))) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_7, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {125#false} is VALID [2022-04-07 23:23:07,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {125#false} [74] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {125#false} is VALID [2022-04-07 23:23:07,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {125#false} [75] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {125#false} is VALID [2022-04-07 23:23:07,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {125#false} [77] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#false} is VALID [2022-04-07 23:23:07,270 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-07 23:23:07,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 23:23:07,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:23:07,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735349080] [2022-04-07 23:23:07,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:23:07,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53978116] [2022-04-07 23:23:07,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53978116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:23:07,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:23:07,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 23:23:07,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792811292] [2022-04-07 23:23:07,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:23:07,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-07 23:23:07,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:23:07,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-07 23:23:07,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:23:07,286 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 23:23:07,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:23:07,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 23:23:07,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 23:23:07,287 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-07 23:23:07,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:23:07,333 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-07 23:23:07,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 23:23:07,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-07 23:23:07,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:23:07,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-07 23:23:07,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-04-07 23:23:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-07 23:23:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-04-07 23:23:07,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2022-04-07 23:23:07,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:23:07,356 INFO L225 Difference]: With dead ends: 21 [2022-04-07 23:23:07,356 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 23:23:07,357 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 23:23:07,358 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:23:07,358 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:23:07,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 23:23:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-07 23:23:07,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:23:07,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-07 23:23:07,362 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-07 23:23:07,362 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-07 23:23:07,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:23:07,363 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 23:23:07,363 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 23:23:07,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:23:07,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:23:07,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 15 states. [2022-04-07 23:23:07,364 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 15 states. [2022-04-07 23:23:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:23:07,365 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 23:23:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 23:23:07,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:23:07,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:23:07,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:23:07,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:23:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-07 23:23:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-07 23:23:07,367 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-07 23:23:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:23:07,367 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-07 23:23:07,368 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-07 23:23:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 23:23:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 23:23:07,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:23:07,368 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:23:07,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 23:23:07,583 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:23:07,583 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:23:07,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:23:07,584 INFO L85 PathProgramCache]: Analyzing trace with hash 683692065, now seen corresponding path program 1 times [2022-04-07 23:23:07,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:23:07,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878477282] [2022-04-07 23:23:07,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:23:07,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:23:07,610 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:23:07,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [718295872] [2022-04-07 23:23:07,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:23:07,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:23:07,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:23:07,612 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-07 23:23:07,615 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-07 23:23:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:23:07,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 23:23:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:23:07,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:23:08,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {252#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {252#true} is VALID [2022-04-07 23:23:08,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {252#true} [60] 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) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {260#(= ~SIZE~0 20000001)} is VALID [2022-04-07 23:23:08,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#(= ~SIZE~0 20000001)} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#(= ~SIZE~0 20000001)} is VALID [2022-04-07 23:23:08,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {260#(= ~SIZE~0 20000001)} {252#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#(= ~SIZE~0 20000001)} is VALID [2022-04-07 23:23:08,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {260#(= ~SIZE~0 20000001)} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#(= ~SIZE~0 20000001)} is VALID [2022-04-07 23:23:08,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#(= ~SIZE~0 20000001)} [62] mainENTRY-->L19: Formula: (= v_main_~n~0_4 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {260#(= ~SIZE~0 20000001)} is VALID [2022-04-07 23:23:08,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {260#(= ~SIZE~0 20000001)} [65] L19-->L21-2: Formula: (and (= v_main_~k~0_4 0) (<= (mod v_main_~n~0_9 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~i~0_5 v_main_~j~0_4) (= v_main_~j~0_4 v_main_~k~0_4)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_9} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {276#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-07 23:23:08,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {280#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-07 23:23:08,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {280#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} [68] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_1 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {284#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-07 23:23:08,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} [70] L21-3-->L27: Formula: (< 0 (mod v_main_~n~0_8 4294967296)) InVars {main_~n~0=v_main_~n~0_8} OutVars{main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {280#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-07 23:23:08,159 INFO L272 TraceCheckUtils]: 10: Hoare triple {280#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} [72] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~j~0_6 4294967296)) (.cse1 (mod v_main_~i~0_7 4294967296))) (and (= .cse0 (mod v_main_~k~0_6 4294967296)) (= .cse1 .cse0) (not (= (mod (mod .cse1 (mod (+ v_~SIZE~0_7 2) 4294967296)) 4294967296) 0)))) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_7, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {291#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:23:08,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {291#(<= 1 |__VERIFIER_assert_#in~cond|)} [74] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {295#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:23:08,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {295#(<= 1 __VERIFIER_assert_~cond)} [75] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {253#false} is VALID [2022-04-07 23:23:08,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {253#false} [77] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {253#false} is VALID [2022-04-07 23:23:08,161 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-07 23:23:08,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:23:08,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {253#false} [77] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {253#false} is VALID [2022-04-07 23:23:08,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {295#(<= 1 __VERIFIER_assert_~cond)} [75] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {253#false} is VALID [2022-04-07 23:23:08,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {291#(<= 1 |__VERIFIER_assert_#in~cond|)} [74] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {295#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:23:08,888 INFO L272 TraceCheckUtils]: 10: Hoare triple {311#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} [72] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~j~0_6 4294967296)) (.cse1 (mod v_main_~i~0_7 4294967296))) (and (= .cse0 (mod v_main_~k~0_6 4294967296)) (= .cse1 .cse0) (not (= (mod (mod .cse1 (mod (+ v_~SIZE~0_7 2) 4294967296)) 4294967296) 0)))) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_7, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {291#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:23:08,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} [70] L21-3-->L27: Formula: (< 0 (mod v_main_~n~0_8 4294967296)) InVars {main_~n~0=v_main_~n~0_8} OutVars{main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {311#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-07 23:23:08,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {319#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} [68] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_1 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {315#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-07 23:23:08,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {323#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {319#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-07 23:23:08,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [65] L19-->L21-2: Formula: (and (= v_main_~k~0_4 0) (<= (mod v_main_~n~0_9 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~i~0_5 v_main_~j~0_4) (= v_main_~j~0_4 v_main_~k~0_4)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_9} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {323#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-07 23:23:08,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [62] mainENTRY-->L19: Formula: (= v_main_~n~0_4 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 23:23:08,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 23:23:08,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {252#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 23:23:08,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 23:23:08,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {252#true} [60] 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) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 23:23:08,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {252#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {252#true} is VALID [2022-04-07 23:23:08,898 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-07 23:23:08,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:23:08,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878477282] [2022-04-07 23:23:08,898 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:23:08,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718295872] [2022-04-07 23:23:08,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718295872] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:23:08,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:23:08,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2022-04-07 23:23:08,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898591865] [2022-04-07 23:23:08,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 23:23:08,900 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-04-07 23:23:08,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:23:08,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:23:08,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:23:08,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-07 23:23:08,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:23:08,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-07 23:23:08,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-07 23:23:08,933 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:23:14,691 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:23:16,703 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:23:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:23:20,186 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-07 23:23:20,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 23:23:20,186 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-04-07 23:23:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:23:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:23:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-04-07 23:23:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:23:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-04-07 23:23:20,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 30 transitions. [2022-04-07 23:23:21,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:23:21,830 INFO L225 Difference]: With dead ends: 28 [2022-04-07 23:23:21,830 INFO L226 Difference]: Without dead ends: 18 [2022-04-07 23:23:21,831 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-04-07 23:23:21,832 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-07 23:23:21,832 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 40 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 57 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-04-07 23:23:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-07 23:23:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-07 23:23:21,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:23:21,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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-07 23:23:21,844 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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-07 23:23:21,844 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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-07 23:23:21,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:23:21,845 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-07 23:23:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-07 23:23:21,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:23:21,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:23:21,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 18 states. [2022-04-07 23:23:21,846 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 18 states. [2022-04-07 23:23:21,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:23:21,847 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-07 23:23:21,847 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-07 23:23:21,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:23:21,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:23:21,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:23:21,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:23:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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-07 23:23:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-07 23:23:21,849 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2022-04-07 23:23:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:23:21,849 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-07 23:23:21,849 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:23:21,849 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-07 23:23:21,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 23:23:21,850 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:23:21,850 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:23:21,866 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-07 23:23:22,050 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 23:23:22,051 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:23:22,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:23:22,051 INFO L85 PathProgramCache]: Analyzing trace with hash -958885712, now seen corresponding path program 2 times [2022-04-07 23:23:22,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:23:22,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087343984] [2022-04-07 23:23:22,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:23:22,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:23:22,072 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:23:22,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894183631] [2022-04-07 23:23:22,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 23:23:22,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:23:22,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:23:22,073 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-07 23:23:22,081 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-07 23:23:22,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 23:23:22,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 23:23:22,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-07 23:23:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:23:22,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:23:22,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {468#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-07 23:23:22,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#true} [60] 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) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {476#(= ~SIZE~0 20000001)} is VALID [2022-04-07 23:23:22,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {476#(= ~SIZE~0 20000001)} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {476#(= ~SIZE~0 20000001)} is VALID [2022-04-07 23:23:22,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {476#(= ~SIZE~0 20000001)} {468#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {476#(= ~SIZE~0 20000001)} is VALID [2022-04-07 23:23:22,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {476#(= ~SIZE~0 20000001)} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {476#(= ~SIZE~0 20000001)} is VALID [2022-04-07 23:23:22,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {476#(= ~SIZE~0 20000001)} [62] mainENTRY-->L19: Formula: (= v_main_~n~0_4 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {476#(= ~SIZE~0 20000001)} is VALID [2022-04-07 23:23:22,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {476#(= ~SIZE~0 20000001)} [65] L19-->L21-2: Formula: (and (= v_main_~k~0_4 0) (<= (mod v_main_~n~0_9 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~i~0_5 v_main_~j~0_4) (= v_main_~j~0_4 v_main_~k~0_4)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_9} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {492#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-07 23:23:22,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {492#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {496#(and (= (+ main_~j~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} is VALID [2022-04-07 23:23:22,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {496#(and (= (+ main_~j~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {500#(and (= 3 (+ main_~k~0 (- 3))) (= main_~i~0 6) (= ~SIZE~0 20000001) (= main_~j~0 6))} is VALID [2022-04-07 23:23:22,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {500#(and (= 3 (+ main_~k~0 (- 3))) (= main_~i~0 6) (= ~SIZE~0 20000001) (= main_~j~0 6))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {504#(and (= 3 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 3)) 6) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} is VALID [2022-04-07 23:23:22,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {504#(and (= 3 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 3)) 6) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {508#(and (= (+ main_~i~0 (- 6)) 6) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (= 3 (+ (- 9) main_~k~0)) (= (+ main_~j~0 (- 6)) 6))} is VALID [2022-04-07 23:23:22,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#(and (= (+ main_~i~0 (- 6)) 6) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (= 3 (+ (- 9) main_~k~0)) (= (+ main_~j~0 (- 6)) 6))} [68] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_1 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {512#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} is VALID [2022-04-07 23:23:22,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} [70] L21-3-->L27: Formula: (< 0 (mod v_main_~n~0_8 4294967296)) InVars {main_~n~0=v_main_~n~0_8} OutVars{main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {512#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} is VALID [2022-04-07 23:23:22,796 INFO L272 TraceCheckUtils]: 13: Hoare triple {512#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} [72] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~j~0_6 4294967296)) (.cse1 (mod v_main_~i~0_7 4294967296))) (and (= .cse0 (mod v_main_~k~0_6 4294967296)) (= .cse1 .cse0) (not (= (mod (mod .cse1 (mod (+ v_~SIZE~0_7 2) 4294967296)) 4294967296) 0)))) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_7, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:23:22,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} [74] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:23:22,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} [75] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {469#false} is VALID [2022-04-07 23:23:22,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {469#false} [77] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#false} is VALID [2022-04-07 23:23:22,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:23:22,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:23:25,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {469#false} [77] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#false} is VALID [2022-04-07 23:23:25,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} [75] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {469#false} is VALID [2022-04-07 23:23:25,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} [74] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:23:25,353 INFO L272 TraceCheckUtils]: 13: Hoare triple {539#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} [72] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~j~0_6 4294967296)) (.cse1 (mod v_main_~i~0_7 4294967296))) (and (= .cse0 (mod v_main_~k~0_6 4294967296)) (= .cse1 .cse0) (not (= (mod (mod .cse1 (mod (+ v_~SIZE~0_7 2) 4294967296)) 4294967296) 0)))) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_7, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:23:25,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} [70] L21-3-->L27: Formula: (< 0 (mod v_main_~n~0_8 4294967296)) InVars {main_~n~0=v_main_~n~0_8} OutVars{main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {539#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-07 23:23:25,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {546#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} [68] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_1 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {539#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-07 23:23:25,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {550#(or (<= (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 3) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {546#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-07 23:23:25,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(or (<= (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 6) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {550#(or (<= (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 3) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))))} is VALID [2022-04-07 23:23:25,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {558#(or (<= (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {554#(or (<= (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 6) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-07 23:23:25,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {562#(or (<= (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {558#(or (<= (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-07 23:23:25,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [65] L19-->L21-2: Formula: (and (= v_main_~k~0_4 0) (<= (mod v_main_~n~0_9 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~i~0_5 v_main_~j~0_4) (= v_main_~j~0_4 v_main_~k~0_4)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_9} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {562#(or (<= (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-07 23:23:25,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [62] mainENTRY-->L19: Formula: (= v_main_~n~0_4 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 23:23:25,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 23:23:25,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {468#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 23:23:25,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 23:23:25,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#true} [60] 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) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 23:23:25,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {468#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-07 23:23:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:23:25,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:23:25,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087343984] [2022-04-07 23:23:25,389 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:23:25,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894183631] [2022-04-07 23:23:25,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894183631] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:23:25,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:23:25,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-04-07 23:23:25,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606793706] [2022-04-07 23:23:25,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 23:23:25,390 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 23:23:25,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:23:25,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:23:25,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:23:25,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-07 23:23:25,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:23:25,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-07 23:23:25,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-04-07 23:23:25,444 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:25:11,368 WARN L232 SmtUtils]: Spent 1.64m on a formula simplification that was a NOOP. DAG size: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 23:25:13,395 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:25:56,168 WARN L232 SmtUtils]: Spent 36.56s on a formula simplification. DAG size of input: 64 DAG size of output: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 23:25:58,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:26:00,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:28:30,007 WARN L232 SmtUtils]: Spent 2.24m on a formula simplification. DAG size of input: 85 DAG size of output: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 23:28:32,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:28:45,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:30:53,713 WARN L232 SmtUtils]: Spent 1.95m on a formula simplification. DAG size of input: 80 DAG size of output: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 23:30:55,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:30:57,750 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:30:59,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:31:33,883 WARN L232 SmtUtils]: Spent 21.24s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 23:31:40,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:31:43,524 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:31:46,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:32:36,270 WARN L232 SmtUtils]: Spent 32.82s on a formula simplification. DAG size of input: 61 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 23:32:39,931 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:32:41,934 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:32:44,855 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:32:55,543 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:32:57,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:33:00,475 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:33:02,479 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:33:04,506 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:33:26,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:33:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:34,104 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-07 23:33:34,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-07 23:33:34,105 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 23:33:34,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:33:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:33:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 45 transitions. [2022-04-07 23:33:34,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:33:34,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 45 transitions. [2022-04-07 23:33:34,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 45 transitions. [2022-04-07 23:33:47,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 41 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-07 23:33:47,516 INFO L225 Difference]: With dead ends: 40 [2022-04-07 23:33:47,516 INFO L226 Difference]: Without dead ends: 24 [2022-04-07 23:33:47,517 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 542.6s TimeCoverageRelationStatistics Valid=246, Invalid=593, Unknown=31, NotChecked=0, Total=870 [2022-04-07 23:33:47,518 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 66 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 43 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.9s IncrementalHoareTripleChecker+Time [2022-04-07 23:33:47,518 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 61 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 135 Invalid, 17 Unknown, 0 Unchecked, 43.9s Time] [2022-04-07 23:33:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-07 23:33:47,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-07 23:33:47,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:33:47,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-07 23:33:47,543 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-07 23:33:47,543 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-07 23:33:47,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:47,544 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-07 23:33:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-07 23:33:47,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:33:47,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:33:47,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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 24 states. [2022-04-07 23:33:47,545 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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 24 states. [2022-04-07 23:33:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:33:47,554 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-07 23:33:47,554 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-07 23:33:47,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:33:47,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:33:47,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:33:47,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:33:47,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-07 23:33:47,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-07 23:33:47,556 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 17 [2022-04-07 23:33:47,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:33:47,557 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-07 23:33:47,557 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:33:47,557 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-07 23:33:47,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 23:33:47,557 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:33:47,557 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:33:47,587 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-07 23:33:47,774 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:33:47,775 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:33:47,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:33:47,775 INFO L85 PathProgramCache]: Analyzing trace with hash 916237072, now seen corresponding path program 3 times [2022-04-07 23:33:47,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:33:47,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620164051] [2022-04-07 23:33:47,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:33:47,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:33:47,810 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 23:33:47,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [997475967] [2022-04-07 23:33:47,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 23:33:47,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:33:47,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:33:47,811 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-07 23:33:47,819 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-07 23:33:48,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-07 23:33:48,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 23:33:48,042 WARN L261 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-07 23:33:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:33:48,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:33:48,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {764#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {764#true} is VALID [2022-04-07 23:33:48,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {764#true} [60] 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) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {772#(= ~SIZE~0 20000001)} is VALID [2022-04-07 23:33:48,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#(= ~SIZE~0 20000001)} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {772#(= ~SIZE~0 20000001)} is VALID [2022-04-07 23:33:48,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {772#(= ~SIZE~0 20000001)} {764#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {772#(= ~SIZE~0 20000001)} is VALID [2022-04-07 23:33:48,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {772#(= ~SIZE~0 20000001)} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {772#(= ~SIZE~0 20000001)} is VALID [2022-04-07 23:33:48,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#(= ~SIZE~0 20000001)} [62] mainENTRY-->L19: Formula: (= v_main_~n~0_4 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {772#(= ~SIZE~0 20000001)} is VALID [2022-04-07 23:33:48,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {772#(= ~SIZE~0 20000001)} [65] L19-->L21-2: Formula: (and (= v_main_~k~0_4 0) (<= (mod v_main_~n~0_9 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~i~0_5 v_main_~j~0_4) (= v_main_~j~0_4 v_main_~k~0_4)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_9} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {788#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-07 23:33:48,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {788#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {792#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-07 23:33:48,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {792#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {796#(and (= main_~i~0 main_~k~0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 0))} is VALID [2022-04-07 23:33:48,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {796#(and (= main_~i~0 main_~k~0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 0))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {800#(and (= (+ main_~j~0 (- 3)) 6) (= main_~k~0 9) (= ~SIZE~0 20000001) (= main_~i~0 9))} is VALID [2022-04-07 23:33:48,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {800#(and (= (+ main_~j~0 (- 3)) 6) (= main_~k~0 9) (= ~SIZE~0 20000001) (= main_~i~0 9))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {804#(and (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 6))} is VALID [2022-04-07 23:33:48,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {804#(and (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 6))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {808#(and (= 6 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 12) (= (+ main_~i~0 (- 3)) 12))} is VALID [2022-04-07 23:33:48,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {808#(and (= 6 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 12) (= (+ main_~i~0 (- 3)) 12))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {812#(and (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18) (= 12 (+ main_~k~0 (- 6))))} is VALID [2022-04-07 23:33:48,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {812#(and (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18) (= 12 (+ main_~k~0 (- 6))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {816#(and (= main_~i~0 21) (= ~SIZE~0 20000001) (= 12 (+ (- 9) main_~k~0)) (= main_~j~0 21))} is VALID [2022-04-07 23:33:48,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {816#(and (= main_~i~0 21) (= ~SIZE~0 20000001) (= 12 (+ (- 9) main_~k~0)) (= main_~j~0 21))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {820#(and (= ~SIZE~0 20000001) (= main_~j~0 24) (= (+ main_~i~0 (- 3)) 21) (= main_~k~0 24))} is VALID [2022-04-07 23:33:48,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {820#(and (= ~SIZE~0 20000001) (= main_~j~0 24) (= (+ main_~i~0 (- 3)) 21) (= main_~k~0 24))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {824#(and (= (+ main_~k~0 (- 3)) 24) (= (+ main_~j~0 (- 3)) 24) (= main_~i~0 27) (= ~SIZE~0 20000001))} is VALID [2022-04-07 23:33:48,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {824#(and (= (+ main_~k~0 (- 3)) 24) (= (+ main_~j~0 (- 3)) 24) (= main_~i~0 27) (= ~SIZE~0 20000001))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {828#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} is VALID [2022-04-07 23:33:48,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {828#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} [68] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_1 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {832#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} is VALID [2022-04-07 23:33:48,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {832#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} [70] L21-3-->L27: Formula: (< 0 (mod v_main_~n~0_8 4294967296)) InVars {main_~n~0=v_main_~n~0_8} OutVars{main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {828#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} is VALID [2022-04-07 23:33:48,839 INFO L272 TraceCheckUtils]: 19: Hoare triple {828#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} [72] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~j~0_6 4294967296)) (.cse1 (mod v_main_~i~0_7 4294967296))) (and (= .cse0 (mod v_main_~k~0_6 4294967296)) (= .cse1 .cse0) (not (= (mod (mod .cse1 (mod (+ v_~SIZE~0_7 2) 4294967296)) 4294967296) 0)))) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_7, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {839#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:33:48,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {839#(<= 1 |__VERIFIER_assert_#in~cond|)} [74] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {843#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:33:48,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {843#(<= 1 __VERIFIER_assert_~cond)} [75] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {765#false} is VALID [2022-04-07 23:33:48,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {765#false} [77] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {765#false} is VALID [2022-04-07 23:33:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:33:48,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:33:56,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {765#false} [77] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {765#false} is VALID [2022-04-07 23:33:56,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {843#(<= 1 __VERIFIER_assert_~cond)} [75] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {765#false} is VALID [2022-04-07 23:33:56,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {839#(<= 1 |__VERIFIER_assert_#in~cond|)} [74] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {843#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:33:56,988 INFO L272 TraceCheckUtils]: 19: Hoare triple {859#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} [72] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~j~0_6 4294967296)) (.cse1 (mod v_main_~i~0_7 4294967296))) (and (= .cse0 (mod v_main_~k~0_6 4294967296)) (= .cse1 .cse0) (not (= (mod (mod .cse1 (mod (+ v_~SIZE~0_7 2) 4294967296)) 4294967296) 0)))) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_7, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {839#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:33:56,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {863#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} [70] L21-3-->L27: Formula: (< 0 (mod v_main_~n~0_8 4294967296)) InVars {main_~n~0=v_main_~n~0_8} OutVars{main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {859#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-07 23:33:56,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {867#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} [68] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_1 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {863#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-07 23:33:56,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {871#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {867#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-07 23:33:56,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {875#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {871#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-07 23:33:57,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {879#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {875#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-07 23:33:57,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {883#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {879#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-07 23:33:57,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {887#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {883#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-07 23:33:57,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {891#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {887#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-07 23:33:57,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {895#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {891#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-07 23:33:57,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {899#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {895#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} is VALID [2022-04-07 23:33:57,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {903#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {899#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} is VALID [2022-04-07 23:33:57,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {903#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} is VALID [2022-04-07 23:33:57,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {911#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [65] L19-->L21-2: Formula: (and (= v_main_~k~0_4 0) (<= (mod v_main_~n~0_9 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~i~0_5 v_main_~j~0_4) (= v_main_~j~0_4 v_main_~k~0_4)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_9} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {907#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} is VALID [2022-04-07 23:33:57,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {911#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [62] mainENTRY-->L19: Formula: (= v_main_~n~0_4 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {911#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 23:33:57,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {911#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {911#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 23:33:57,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {911#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {764#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {911#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 23:33:57,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {911#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {911#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 23:33:57,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {764#true} [60] 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) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {911#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-07 23:33:57,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {764#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {764#true} is VALID [2022-04-07 23:33:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:33:57,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:33:57,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620164051] [2022-04-07 23:33:57,029 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 23:33:57,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997475967] [2022-04-07 23:33:57,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997475967] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:33:57,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:33:57,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 31 [2022-04-07 23:33:57,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730983682] [2022-04-07 23:33:57,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 23:33:57,030 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-04-07 23:33:57,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:33:57,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:33:57,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:33:57,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-07 23:33:57,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:33:57,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-07 23:33:57,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2022-04-07 23:33:57,115 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 23:34:00,112 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (mod c_main_~j~0 4294967296)) (.cse22 (mod c_main_~i~0 4294967296)) (.cse1 (mod (+ 2 c_~SIZE~0) 4294967296))) (and (let ((.cse0 (mod (+ c_main_~i~0 18) 4294967296))) (or (<= 0 (div (* (- 1) .cse0) 4294967296)) (let ((.cse2 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (= .cse0 .cse2) (= .cse2 (mod (+ 18 c_main_~k~0) 4294967296)))))) (let ((.cse4 (mod (+ c_main_~i~0 27) 4294967296))) (or (let ((.cse3 (mod (+ c_main_~j~0 27) 4294967296))) (and (= .cse3 .cse4) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse3) (not (= (mod (mod .cse4 .cse1) 4294967296) 0)))) (<= 0 (div (* (- 1) .cse4) 4294967296)))) (let ((.cse5 (mod (+ c_main_~i~0 6) 4294967296))) (or (<= 0 (div (* (- 1) .cse5) 4294967296)) (let ((.cse6 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse6 .cse5) (= .cse6 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse5 .cse1) 4294967296) 0)))))) (let ((.cse7 (mod (+ c_main_~i~0 3) 4294967296))) (or (let ((.cse8 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse7 .cse1) 4294967296) 0)) (= .cse8 .cse7) (= .cse8 (mod (+ 3 c_main_~k~0) 4294967296)))) (<= 0 (div (* (- 1) .cse7) 4294967296)))) (let ((.cse9 (mod (+ c_main_~i~0 21) 4294967296))) (or (<= 0 (div (* (- 1) .cse9) 4294967296)) (let ((.cse10 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse10 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse9 .cse1) 4294967296) 0)) (= .cse10 .cse9))))) (let ((.cse11 (mod (+ c_main_~i~0 24) 4294967296))) (or (<= 0 (div (* (- 1) .cse11) 4294967296)) (let ((.cse12 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse12 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse11 .cse1) 4294967296) 0)) (= .cse12 .cse11))))) (let ((.cse14 (mod (+ c_main_~i~0 9) 4294967296))) (or (let ((.cse13 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse13 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse14 .cse1) 4294967296) 0)) (= .cse13 .cse14))) (<= 0 (div (* (- 1) .cse14) 4294967296)))) (= .cse15 (mod c_main_~k~0 4294967296)) (let ((.cse16 (mod (+ c_main_~i~0 30) 4294967296))) (or (<= 0 (div (* (- 1) .cse16) 4294967296)) (let ((.cse17 (mod (+ 30 c_main_~j~0) 4294967296))) (and (= .cse17 (mod (+ 30 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse16 .cse1) 4294967296) 0)) (= .cse16 .cse17))))) (= 20000001 c_~SIZE~0) (let ((.cse18 (mod (+ c_main_~i~0 15) 4294967296))) (or (<= 0 (div (* (- 1) .cse18) 4294967296)) (let ((.cse19 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse18 .cse19) (= .cse19 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse18 .cse1) 4294967296) 0)))))) (let ((.cse21 (mod (+ c_main_~i~0 12) 4294967296))) (or (let ((.cse20 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse20 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse20 .cse21) (not (= (mod (mod .cse21 .cse1) 4294967296) 0)))) (<= 0 (div (* (- 1) .cse21) 4294967296)))) (= .cse15 .cse22) (not (= 0 (mod (mod .cse22 .cse1) 4294967296))))) is different from false [2022-04-07 23:36:54,831 WARN L232 SmtUtils]: Spent 2.47m on a formula simplification that was a NOOP. DAG size: 187 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 23:36:58,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:37:03,819 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 23:37:05,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []