/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/sumt2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:20:55,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:20:55,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:20:55,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:20:55,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:20:55,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:20:55,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:20:55,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:20:55,943 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:20:55,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:20:55,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:20:55,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:20:55,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:20:55,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:20:55,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:20:55,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:20:55,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:20:55,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:20:55,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:20:55,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:20:55,954 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:20:55,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:20:55,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:20:55,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:20:55,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:20:55,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:20:55,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:20:55,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:20:55,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:20:55,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:20:55,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:20:55,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:20:55,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:20:55,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:20:55,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:20:55,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:20:55,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:20:55,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:20:55,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:20:55,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:20:55,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:20:55,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:20:55,968 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 22:20:55,987 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:20:55,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:20:55,988 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:20:55,989 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:20:55,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:20:55,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:20:55,989 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:20:55,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:20:55,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:20:55,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:20:55,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:20:55,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:20:55,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:20:55,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:20:55,991 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:20:55,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:20:55,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:20:55,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:20:55,991 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:20:55,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:20:55,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:20:55,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:20:55,992 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:20:55,992 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:20:55,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:20:55,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:20:55,993 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:20:55,993 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:20:55,994 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:20:55,994 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 22:20:56,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:20:56,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:20:56,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:20:56,191 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:20:56,193 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:20:56,194 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt2.c [2022-04-27 22:20:56,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2ba84310/3b756f1a9feb4d68ad534189713f8ec1/FLAG5b57e6d33 [2022-04-27 22:20:56,672 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:20:56,672 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt2.c [2022-04-27 22:20:56,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2ba84310/3b756f1a9feb4d68ad534189713f8ec1/FLAG5b57e6d33 [2022-04-27 22:20:56,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2ba84310/3b756f1a9feb4d68ad534189713f8ec1 [2022-04-27 22:20:56,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:20:56,702 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:20:56,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:20:56,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:20:56,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:20:56,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:20:56" (1/1) ... [2022-04-27 22:20:56,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a84232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:56, skipping insertion in model container [2022-04-27 22:20:56,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:20:56" (1/1) ... [2022-04-27 22:20:56,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:20:56,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:20:56,857 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/sumt2.c[403,416] [2022-04-27 22:20:56,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:20:56,887 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:20:56,901 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/sumt2.c[403,416] [2022-04-27 22:20:56,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:20:56,920 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:20:56,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:56 WrapperNode [2022-04-27 22:20:56,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:20:56,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:20:56,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:20:56,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:20:56,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:56" (1/1) ... [2022-04-27 22:20:56,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:56" (1/1) ... [2022-04-27 22:20:56,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:56" (1/1) ... [2022-04-27 22:20:56,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:56" (1/1) ... [2022-04-27 22:20:56,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:56" (1/1) ... [2022-04-27 22:20:56,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:56" (1/1) ... [2022-04-27 22:20:56,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:56" (1/1) ... [2022-04-27 22:20:56,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:20:56,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:20:56,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:20:56,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:20:56,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:56" (1/1) ... [2022-04-27 22:20:56,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:20:56,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:20:56,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 22:20:57,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 22:20:57,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:20:57,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:20:57,027 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:20:57,027 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 22:20:57,027 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 22:20:57,027 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:20:57,027 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 22:20:57,027 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:20:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:20:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:20:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 22:20:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 22:20:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 22:20:57,030 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:20:57,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:20:57,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:20:57,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:20:57,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:20:57,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:20:57,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:20:57,083 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:20:57,084 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:20:57,171 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:20:57,177 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:20:57,177 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 22:20:57,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:20:57 BoogieIcfgContainer [2022-04-27 22:20:57,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:20:57,180 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:20:57,180 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:20:57,180 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:20:57,183 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:20:57" (1/1) ... [2022-04-27 22:20:57,185 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:20:57,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:20:57 BasicIcfg [2022-04-27 22:20:57,227 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:20:57,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:20:57,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:20:57,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:20:57,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:20:56" (1/4) ... [2022-04-27 22:20:57,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7e2361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:20:57, skipping insertion in model container [2022-04-27 22:20:57,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:20:56" (2/4) ... [2022-04-27 22:20:57,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7e2361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:20:57, skipping insertion in model container [2022-04-27 22:20:57,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:20:57" (3/4) ... [2022-04-27 22:20:57,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7e2361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:20:57, skipping insertion in model container [2022-04-27 22:20:57,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:20:57" (4/4) ... [2022-04-27 22:20:57,233 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt2.cqvasr [2022-04-27 22:20:57,258 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:20:57,258 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:20:57,328 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:20:57,333 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@49d07862, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@26b50394 [2022-04-27 22:20:57,333 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:20:57,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 22:20:57,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 22:20:57,345 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:20:57,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:20:57,346 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:20:57,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:20:57,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1859572864, now seen corresponding path program 1 times [2022-04-27 22:20:57,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:20:57,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449466622] [2022-04-27 22:20:57,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:20:57,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:20:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:20:57,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:20:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:20:57,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {25#true} is VALID [2022-04-27 22:20:57,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 22:20:57,494 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [82] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 22:20:57,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:20:57,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {25#true} is VALID [2022-04-27 22:20:57,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 22:20:57,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [82] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 22:20:57,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 22:20:57,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [63] mainENTRY-->L19: Formula: (and (= v_main_~l~0_4 0) (= v_main_~n~0_3 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4, main_~n~0=v_main_~n~0_3, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~j~0, main_~i~0, main_~n~0] {25#true} is VALID [2022-04-27 22:20:57,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [66] L19-->L23-2: Formula: (and (= v_main_~i~0_5 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~j~0_5 0) (= v_main_~l~0_7 0)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~l~0, main_~j~0, main_~i~0] {25#true} is VALID [2022-04-27 22:20:57,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} [68] L23-2-->L23-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 22:20:57,499 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} [71] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~i~0_6 v_main_~j~0_6) 4294967296) (mod v_main_~l~0_10 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_10, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {26#false} is VALID [2022-04-27 22:20:57,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [75] __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] {26#false} is VALID [2022-04-27 22:20:57,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [77] 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[] {26#false} is VALID [2022-04-27 22:20:57,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} [79] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 22:20:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:20:57,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:20:57,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449466622] [2022-04-27 22:20:57,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449466622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:20:57,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:20:57,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:20:57,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910987487] [2022-04-27 22:20:57,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:20:57,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:20:57,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:20:57,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:57,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:20:57,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:20:57,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:20:57,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:20:57,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:20:57,573 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:57,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:20:57,682 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-27 22:20:57,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:20:57,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:20:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:20:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-27 22:20:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:57,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-27 22:20:57,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-27 22:20:57,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:20:57,768 INFO L225 Difference]: With dead ends: 34 [2022-04-27 22:20:57,769 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 22:20:57,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:20:57,774 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:20:57,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:20:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 22:20:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 22:20:57,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:20:57,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:57,809 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:57,809 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:57,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:20:57,817 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 22:20:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 22:20:57,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:20:57,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:20:57,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 22:20:57,818 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 22:20:57,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:20:57,822 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 22:20:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 22:20:57,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:20:57,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:20:57,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:20:57,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:20:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 22:20:57,829 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-27 22:20:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:20:57,833 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 22:20:57,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 22:20:57,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 22:20:57,834 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:20:57,834 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:20:57,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 22:20:57,835 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:20:57,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:20:57,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1858649343, now seen corresponding path program 1 times [2022-04-27 22:20:57,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:20:57,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840061745] [2022-04-27 22:20:57,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:20:57,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:20:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:20:58,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:20:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:20:58,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {128#true} is VALID [2022-04-27 22:20:58,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 22:20:58,076 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128#true} {128#true} [82] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 22:20:58,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {128#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {136#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:20:58,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {128#true} is VALID [2022-04-27 22:20:58,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {128#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 22:20:58,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128#true} {128#true} [82] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 22:20:58,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {128#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 22:20:58,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#true} [63] mainENTRY-->L19: Formula: (and (= v_main_~l~0_4 0) (= v_main_~n~0_3 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4, main_~n~0=v_main_~n~0_3, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~j~0, main_~i~0, main_~n~0] {128#true} is VALID [2022-04-27 22:20:58,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#true} [66] L19-->L23-2: Formula: (and (= v_main_~i~0_5 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~j~0_5 0) (= v_main_~l~0_7 0)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~l~0, main_~j~0, main_~i~0] {133#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-27 22:20:58,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [69] L23-2-->L23-3: Formula: (not (< (mod v_main_~l~0_2 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~l~0=v_main_~l~0_2, main_~n~0=v_main_~n~0_1} OutVars{main_~l~0=v_main_~l~0_2, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {133#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-27 22:20:58,080 INFO L272 TraceCheckUtils]: 8: Hoare triple {133#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [71] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~i~0_6 v_main_~j~0_6) 4294967296) (mod v_main_~l~0_10 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_10, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {134#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:20:58,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {134#(not (= |__VERIFIER_assert_#in~cond| 0))} [75] __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] {135#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:20:58,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {135#(not (= __VERIFIER_assert_~cond 0))} [77] 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[] {129#false} is VALID [2022-04-27 22:20:58,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {129#false} [79] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#false} is VALID [2022-04-27 22:20:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:20:58,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:20:58,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840061745] [2022-04-27 22:20:58,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840061745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:20:58,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:20:58,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 22:20:58,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584719222] [2022-04-27 22:20:58,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:20:58,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:20:58,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:20:58,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:58,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:20:58,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:20:58,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:20:58,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:20:58,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 22:20:58,097 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:20:58,261 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 22:20:58,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:20:58,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:20:58,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:20:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-27 22:20:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-27 22:20:58,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-27 22:20:58,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:20:58,306 INFO L225 Difference]: With dead ends: 28 [2022-04-27 22:20:58,307 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 22:20:58,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 22:20:58,310 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:20:58,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 28 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:20:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 22:20:58,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 22:20:58,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:20:58,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-27 22:20:58,317 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-27 22:20:58,318 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-27 22:20:58,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:20:58,320 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 22:20:58,320 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 22:20:58,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:20:58,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:20:58,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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 17 states. [2022-04-27 22:20:58,322 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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 17 states. [2022-04-27 22:20:58,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:20:58,323 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 22:20:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 22:20:58,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:20:58,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:20:58,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:20:58,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:20:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-27 22:20:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-27 22:20:58,326 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2022-04-27 22:20:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:20:58,327 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-27 22:20:58,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 22:20:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 22:20:58,328 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:20:58,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:20:58,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 22:20:58,329 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:20:58,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:20:58,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1947773365, now seen corresponding path program 1 times [2022-04-27 22:20:58,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:20:58,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776421082] [2022-04-27 22:20:58,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:20:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:20:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:20:58,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:20:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:20:58,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {257#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {245#true} is VALID [2022-04-27 22:20:58,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 22:20:58,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {245#true} {245#true} [82] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 22:20:58,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {245#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:20:58,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {245#true} is VALID [2022-04-27 22:20:58,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {245#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 22:20:58,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {245#true} {245#true} [82] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 22:20:58,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {245#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 22:20:58,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {245#true} [63] mainENTRY-->L19: Formula: (and (= v_main_~l~0_4 0) (= v_main_~n~0_3 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4, main_~n~0=v_main_~n~0_3, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~j~0, main_~i~0, main_~n~0] {245#true} is VALID [2022-04-27 22:20:58,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {245#true} [66] L19-->L23-2: Formula: (and (= v_main_~i~0_5 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~j~0_5 0) (= v_main_~l~0_7 0)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~l~0, main_~j~0, main_~i~0] {250#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-27 22:20:58,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [70] L23-2-->L25: Formula: (< (mod v_main_~l~0_3 4294967296) (mod v_main_~n~0_2 4294967296)) InVars {main_~l~0=v_main_~l~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~l~0=v_main_~l~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {251#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} is VALID [2022-04-27 22:20:58,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {251#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} [72] L25-->L25-2: Formula: (and (= (mod v_main_~l~0_5 2) 0) (= v_main_~i~0_3 (+ v_main_~i~0_4 1))) InVars {main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_5} OutVars{main_~i~0=v_main_~i~0_3, main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[main_~i~0] {252#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0)) (<= main_~i~0 1) (= main_~j~0 0) (= main_~l~0 0) (<= 1 main_~i~0))} is VALID [2022-04-27 22:20:58,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {252#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0)) (<= main_~i~0 1) (= main_~j~0 0) (= main_~l~0 0) (<= 1 main_~i~0))} [76] L25-2-->L23-2: Formula: (= v_main_~l~0_8 (+ v_main_~l~0_9 1)) InVars {main_~l~0=v_main_~l~0_9} OutVars{main_~l~0=v_main_~l~0_8} AuxVars[] AssignedVars[main_~l~0] {253#(and (= main_~j~0 0) (<= main_~i~0 main_~l~0) (< (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (or (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0)) (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0))))} is VALID [2022-04-27 22:20:58,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {253#(and (= main_~j~0 0) (<= main_~i~0 main_~l~0) (< (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (or (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0)) (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0))))} [69] L23-2-->L23-3: Formula: (not (< (mod v_main_~l~0_2 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~l~0=v_main_~l~0_2, main_~n~0=v_main_~n~0_1} OutVars{main_~l~0=v_main_~l~0_2, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {254#(and (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~j~0) 4294967296))) (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0)) (< (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 22:20:58,743 INFO L272 TraceCheckUtils]: 11: Hoare triple {254#(and (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~j~0) 4294967296))) (<= (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0)) (< (+ (* (div (+ main_~i~0 main_~j~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)))} [71] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~i~0_6 v_main_~j~0_6) 4294967296) (mod v_main_~l~0_10 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_10, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {255#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:20:58,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {255#(not (= |__VERIFIER_assert_#in~cond| 0))} [75] __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] {256#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:20:58,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {256#(not (= __VERIFIER_assert_~cond 0))} [77] 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[] {246#false} is VALID [2022-04-27 22:20:58,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#false} [79] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#false} is VALID [2022-04-27 22:20:58,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:20:58,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:20:58,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776421082] [2022-04-27 22:20:58,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776421082] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:20:58,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458117033] [2022-04-27 22:20:58,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:20:58,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:20:58,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:20:58,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:20:58,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 22:20:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:20:58,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 22:20:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:20:58,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:20:59,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {245#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 22:20:59,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {245#true} is VALID [2022-04-27 22:20:59,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {245#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 22:20:59,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {245#true} {245#true} [82] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 22:20:59,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {245#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 22:20:59,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {245#true} [63] mainENTRY-->L19: Formula: (and (= v_main_~l~0_4 0) (= v_main_~n~0_3 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4, main_~n~0=v_main_~n~0_3, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~j~0, main_~i~0, main_~n~0] {245#true} is VALID [2022-04-27 22:20:59,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {245#true} [66] L19-->L23-2: Formula: (and (= v_main_~i~0_5 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~j~0_5 0) (= v_main_~l~0_7 0)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~l~0, main_~j~0, main_~i~0] {250#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-27 22:20:59,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [70] L23-2-->L25: Formula: (< (mod v_main_~l~0_3 4294967296) (mod v_main_~n~0_2 4294967296)) InVars {main_~l~0=v_main_~l~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~l~0=v_main_~l~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {250#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-27 22:20:59,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(and (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [72] L25-->L25-2: Formula: (and (= (mod v_main_~l~0_5 2) 0) (= v_main_~i~0_3 (+ v_main_~i~0_4 1))) InVars {main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_5} OutVars{main_~i~0=v_main_~i~0_3, main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[main_~i~0] {285#(and (= main_~j~0 0) (= main_~l~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:20:59,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {285#(and (= main_~j~0 0) (= main_~l~0 0) (= (+ (- 1) main_~i~0) 0))} [76] L25-2-->L23-2: Formula: (= v_main_~l~0_8 (+ v_main_~l~0_9 1)) InVars {main_~l~0=v_main_~l~0_9} OutVars{main_~l~0=v_main_~l~0_8} AuxVars[] AssignedVars[main_~l~0] {289#(and (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:20:59,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {289#(and (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0))} [69] L23-2-->L23-3: Formula: (not (< (mod v_main_~l~0_2 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~l~0=v_main_~l~0_2, main_~n~0=v_main_~n~0_1} OutVars{main_~l~0=v_main_~l~0_2, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {289#(and (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:20:59,046 INFO L272 TraceCheckUtils]: 11: Hoare triple {289#(and (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0))} [71] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~i~0_6 v_main_~j~0_6) 4294967296) (mod v_main_~l~0_10 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_10, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {296#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:20:59,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {296#(<= 1 |__VERIFIER_assert_#in~cond|)} [75] __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] {300#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:20:59,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {300#(<= 1 __VERIFIER_assert_~cond)} [77] 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[] {246#false} is VALID [2022-04-27 22:20:59,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#false} [79] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#false} is VALID [2022-04-27 22:20:59,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:20:59,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:20:59,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#false} [79] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {246#false} is VALID [2022-04-27 22:20:59,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {300#(<= 1 __VERIFIER_assert_~cond)} [77] 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[] {246#false} is VALID [2022-04-27 22:20:59,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {296#(<= 1 |__VERIFIER_assert_#in~cond|)} [75] __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] {300#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:20:59,343 INFO L272 TraceCheckUtils]: 11: Hoare triple {316#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [71] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~i~0_6 v_main_~j~0_6) 4294967296) (mod v_main_~l~0_10 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_10, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {296#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:20:59,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {316#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [69] L23-2-->L23-3: Formula: (not (< (mod v_main_~l~0_2 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~l~0=v_main_~l~0_2, main_~n~0=v_main_~n~0_1} OutVars{main_~l~0=v_main_~l~0_2, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {316#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:20:59,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {323#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [76] L25-2-->L23-2: Formula: (= v_main_~l~0_8 (+ v_main_~l~0_9 1)) InVars {main_~l~0=v_main_~l~0_9} OutVars{main_~l~0=v_main_~l~0_8} AuxVars[] AssignedVars[main_~l~0] {316#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:20:59,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {316#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [72] L25-->L25-2: Formula: (and (= (mod v_main_~l~0_5 2) 0) (= v_main_~i~0_3 (+ v_main_~i~0_4 1))) InVars {main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_5} OutVars{main_~i~0=v_main_~i~0_3, main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[main_~i~0] {323#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-27 22:20:59,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {316#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [70] L23-2-->L25: Formula: (< (mod v_main_~l~0_3 4294967296) (mod v_main_~n~0_2 4294967296)) InVars {main_~l~0=v_main_~l~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~l~0=v_main_~l~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {316#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:20:59,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {245#true} [66] L19-->L23-2: Formula: (and (= v_main_~i~0_5 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~j~0_5 0) (= v_main_~l~0_7 0)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~l~0, main_~j~0, main_~i~0] {316#(= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-27 22:20:59,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {245#true} [63] mainENTRY-->L19: Formula: (and (= v_main_~l~0_4 0) (= v_main_~n~0_3 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4, main_~n~0=v_main_~n~0_3, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~j~0, main_~i~0, main_~n~0] {245#true} is VALID [2022-04-27 22:20:59,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {245#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 22:20:59,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {245#true} {245#true} [82] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 22:20:59,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {245#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 22:20:59,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {245#true} is VALID [2022-04-27 22:20:59,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {245#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {245#true} is VALID [2022-04-27 22:20:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 22:20:59,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458117033] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:20:59,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:20:59,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-27 22:20:59,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591109981] [2022-04-27 22:20:59,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:20:59,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 22:20:59,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:20:59,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:59,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:20:59,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:20:59,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:20:59,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:20:59,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 22:20:59,414 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:59,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:20:59,602 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 22:20:59,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:20:59,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 22:20:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:20:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2022-04-27 22:20:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2022-04-27 22:20:59,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 16 transitions. [2022-04-27 22:20:59,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:20:59,669 INFO L225 Difference]: With dead ends: 17 [2022-04-27 22:20:59,669 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 22:20:59,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-27 22:20:59,670 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 22:20:59,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 22:20:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 22:20:59,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 22:20:59,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:20:59,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:20:59,671 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:20:59,672 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:20:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:20:59,672 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:20:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:20:59,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:20:59,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:20:59,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 22:20:59,672 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 22:20:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:20:59,672 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:20:59,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:20:59,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:20:59,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:20:59,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:20:59,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:20:59,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:20:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 22:20:59,673 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-04-27 22:20:59,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:20:59,673 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 22:20:59,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:20:59,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:20:59,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:20:59,676 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 22:20:59,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 22:20:59,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:20:59,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 22:20:59,922 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 22:20:59,922 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:20:59,922 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:20:59,923 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 22:20:59,923 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 22:20:59,923 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:20:59,923 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:20:59,923 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 16 33) the Hoare annotation is: true [2022-04-27 22:20:59,923 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 22:20:59,923 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 16 33) no Hoare annotation was computed. [2022-04-27 22:20:59,923 INFO L895 garLoopResultBuilder]: At program point L23-2(lines 23 30) the Hoare annotation is: (= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-27 22:20:59,923 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 16 33) no Hoare annotation was computed. [2022-04-27 22:20:59,923 INFO L895 garLoopResultBuilder]: At program point L23-3(lines 23 30) the Hoare annotation is: (= (mod (+ main_~i~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-27 22:20:59,923 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 28) no Hoare annotation was computed. [2022-04-27 22:20:59,923 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-04-27 22:20:59,924 INFO L899 garLoopResultBuilder]: For program point L25-2(lines 25 28) no Hoare annotation was computed. [2022-04-27 22:20:59,924 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-27 22:20:59,924 INFO L899 garLoopResultBuilder]: For program point L9(lines 9 11) no Hoare annotation was computed. [2022-04-27 22:20:59,924 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-27 22:20:59,924 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2022-04-27 22:20:59,924 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2022-04-27 22:20:59,924 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2022-04-27 22:20:59,927 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 22:20:59,928 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 22:20:59,932 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:20:59,932 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 22:20:59,932 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 22:20:59,932 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:20:59,932 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 22:20:59,932 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 22:20:59,932 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 22:20:59,932 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 22:20:59,932 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 22:20:59,933 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 22:20:59,933 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 22:20:59,933 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 22:20:59,933 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 22:20:59,933 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 22:20:59,933 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 22:20:59,933 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 22:20:59,934 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 22:20:59,934 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:20:59,934 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 22:20:59,934 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-04-27 22:20:59,934 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 22:20:59,934 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 22:20:59,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:20:59 BasicIcfg [2022-04-27 22:20:59,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 22:20:59,943 INFO L158 Benchmark]: Toolchain (without parser) took 3241.03ms. Allocated memory was 186.6MB in the beginning and 238.0MB in the end (delta: 51.4MB). Free memory was 129.7MB in the beginning and 127.8MB in the end (delta: 1.9MB). Peak memory consumption was 54.7MB. Max. memory is 8.0GB. [2022-04-27 22:20:59,943 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:20:59,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.52ms. Allocated memory was 186.6MB in the beginning and 238.0MB in the end (delta: 51.4MB). Free memory was 129.6MB in the beginning and 209.4MB in the end (delta: -79.8MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-04-27 22:20:59,944 INFO L158 Benchmark]: Boogie Preprocessor took 24.71ms. Allocated memory is still 238.0MB. Free memory was 209.4MB in the beginning and 207.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 22:20:59,944 INFO L158 Benchmark]: RCFGBuilder took 226.23ms. Allocated memory is still 238.0MB. Free memory was 207.8MB in the beginning and 197.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 22:20:59,944 INFO L158 Benchmark]: IcfgTransformer took 47.49ms. Allocated memory is still 238.0MB. Free memory was 197.3MB in the beginning and 195.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 22:20:59,944 INFO L158 Benchmark]: TraceAbstraction took 2713.50ms. Allocated memory is still 238.0MB. Free memory was 195.2MB in the beginning and 127.8MB in the end (delta: 67.4MB). Peak memory consumption was 68.5MB. Max. memory is 8.0GB. [2022-04-27 22:20:59,946 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.52ms. Allocated memory was 186.6MB in the beginning and 238.0MB in the end (delta: 51.4MB). Free memory was 129.6MB in the beginning and 209.4MB in the end (delta: -79.8MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.71ms. Allocated memory is still 238.0MB. Free memory was 209.4MB in the beginning and 207.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 226.23ms. Allocated memory is still 238.0MB. Free memory was 207.8MB in the beginning and 197.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 47.49ms. Allocated memory is still 238.0MB. Free memory was 197.3MB in the beginning and 195.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2713.50ms. Allocated memory is still 238.0MB. Free memory was 195.2MB in the beginning and 127.8MB in the end (delta: 67.4MB). Peak memory consumption was 68.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 40 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 32 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 31 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 380 SizeOfPredicates, 1 NumberOfNonLiveVariables, 73 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (i + j) % 4294967296 == l % 4294967296 RESULT: Ultimate proved your program to be correct! [2022-04-27 22:20:59,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...