/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/nec20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:04:32,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:04:32,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:04:32,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:04:32,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:04:32,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:04:32,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:04:32,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:04:32,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:04:32,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:04:32,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:04:32,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:04:32,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:04:32,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:04:32,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:04:32,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:04:32,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:04:32,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:04:32,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:04:32,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:04:32,902 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:04:32,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:04:32,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:04:32,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:04:32,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:04:32,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:04:32,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:04:32,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:04:32,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:04:32,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:04:32,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:04:32,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:04:32,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:04:32,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:04:32,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:04:32,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:04:32,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:04:32,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:04:32,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:04:32,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:04:32,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:04:32,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:04:32,918 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:04:32,939 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:04:32,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:04:32,940 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:04:32,940 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:04:32,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:04:32,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:04:32,941 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:04:32,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:04:32,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:04:32,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:04:32,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:04:32,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:04:32,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:04:32,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:04:32,942 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:04:32,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:04:32,942 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:04:32,942 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:04:32,942 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:04:32,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:04:32,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:04:32,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:04:32,943 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:04:32,943 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:04:32,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:04:32,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:04:32,943 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:04:32,943 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:04:32,944 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:04:32,944 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-15 00:04:33,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:04:33,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:04:33,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:04:33,158 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:04:33,158 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:04:33,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/nec20.c [2022-04-15 00:04:33,227 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2fc2063/d7dcaa6c1f2f42d2a91f60d3ad6fe9e6/FLAGc23b864b7 [2022-04-15 00:04:33,582 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:04:33,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/nec20.c [2022-04-15 00:04:33,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2fc2063/d7dcaa6c1f2f42d2a91f60d3ad6fe9e6/FLAGc23b864b7 [2022-04-15 00:04:33,595 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2fc2063/d7dcaa6c1f2f42d2a91f60d3ad6fe9e6 [2022-04-15 00:04:33,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:04:33,597 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:04:33,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:04:33,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:04:33,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:04:33,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:04:33" (1/1) ... [2022-04-15 00:04:33,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad6052f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:33, skipping insertion in model container [2022-04-15 00:04:33,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:04:33" (1/1) ... [2022-04-15 00:04:33,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:04:33,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:04:33,756 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/nec20.c[356,369] [2022-04-15 00:04:33,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:04:33,786 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:04:33,794 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/nec20.c[356,369] [2022-04-15 00:04:33,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:04:33,805 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:04:33,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:33 WrapperNode [2022-04-15 00:04:33,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:04:33,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:04:33,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:04:33,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:04:33,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:33" (1/1) ... [2022-04-15 00:04:33,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:33" (1/1) ... [2022-04-15 00:04:33,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:33" (1/1) ... [2022-04-15 00:04:33,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:33" (1/1) ... [2022-04-15 00:04:33,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:33" (1/1) ... [2022-04-15 00:04:33,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:33" (1/1) ... [2022-04-15 00:04:33,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:33" (1/1) ... [2022-04-15 00:04:33,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:04:33,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:04:33,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:04:33,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:04:33,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:33" (1/1) ... [2022-04-15 00:04:33,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:04:33,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:04:33,876 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-15 00:04:33,892 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-15 00:04:33,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:04:33,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:04:33,903 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:04:33,903 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:04:33,903 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:04:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:04:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:04:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:04:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:04:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 00:04:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:04:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 00:04:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:04:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:04:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:04:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:04:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:04:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:04:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:04:33,950 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:04:33,951 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:04:34,089 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:04:34,100 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:04:34,101 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:04:34,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:04:34 BoogieIcfgContainer [2022-04-15 00:04:34,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:04:34,103 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:04:34,103 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:04:34,104 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:04:34,106 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:04:34" (1/1) ... [2022-04-15 00:04:34,107 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:04:34,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:04:34 BasicIcfg [2022-04-15 00:04:34,125 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:04:34,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:04:34,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:04:34,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:04:34,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:04:33" (1/4) ... [2022-04-15 00:04:34,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef3fbb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:04:34, skipping insertion in model container [2022-04-15 00:04:34,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:33" (2/4) ... [2022-04-15 00:04:34,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef3fbb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:04:34, skipping insertion in model container [2022-04-15 00:04:34,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:04:34" (3/4) ... [2022-04-15 00:04:34,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef3fbb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:04:34, skipping insertion in model container [2022-04-15 00:04:34,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:04:34" (4/4) ... [2022-04-15 00:04:34,130 INFO L111 eAbstractionObserver]: Analyzing ICFG nec20.cqvasr [2022-04-15 00:04:34,133 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:04:34,134 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:04:34,163 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:04:34,167 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 00:04:34,167 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:04:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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-15 00:04:34,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 00:04:34,185 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:04:34,186 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:04:34,186 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:04:34,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:04:34,190 INFO L85 PathProgramCache]: Analyzing trace with hash 936597551, now seen corresponding path program 1 times [2022-04-15 00:04:34,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:04:34,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480349134] [2022-04-15 00:04:34,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:04:34,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:04:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:34,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:04:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:34,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= ~b~0 |old(~b~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) (= (select |v_#valid_1| 0) 0) (= v_~b~0_4 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~b~0=v_~b~0_4, #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[~b~0, #NULL.offset, #NULL.base] {28#true} is VALID [2022-04-15 00:04:34,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-15 00:04:34,370 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-15 00:04:34,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#(and (= ~b~0 |old(~b~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:04:34,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= ~b~0 |old(~b~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) (= (select |v_#valid_1| 0) 0) (= v_~b~0_4 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~b~0=v_~b~0_4, #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[~b~0, #NULL.offset, #NULL.base] {28#true} is VALID [2022-04-15 00:04:34,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-15 00:04:34,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-15 00:04:34,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-15 00:04:34,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} [63] mainENTRY-->L19: Formula: (= v_main_~k~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~a~0] {28#true} is VALID [2022-04-15 00:04:34,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} [65] L19-->L19-2: Formula: (and (not (= (mod v_main_~k~0_2 256) 0)) (= v_main_~n~0_2 0)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~n~0] {28#true} is VALID [2022-04-15 00:04:34,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} [67] L19-2-->L27: Formula: (and (= v_main_~i~0_2 0) (= v_main_~j~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~j~0, main_~i~0] {28#true} is VALID [2022-04-15 00:04:34,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} [69] L27-->L30-2: Formula: (not (< 10000 (mod v_main_~j~0_4 4294967296))) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-15 00:04:34,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} [71] L30-2-->L30-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-15 00:04:34,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} [74] L30-3-->L36: Formula: (= (store v_main_~a~0_5 (mod v_main_~i~0_6 4294967296) 0) v_main_~a~0_4) InVars {main_~i~0=v_main_~i~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~a~0] {29#false} is VALID [2022-04-15 00:04:34,375 INFO L272 TraceCheckUtils]: 11: Hoare triple {29#false} [75] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (mod v_main_~j~0_9 4294967296) 1025) 1 0)) InVars {main_~j~0=v_main_~j~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {29#false} is VALID [2022-04-15 00:04:34,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} [77] __VERIFIER_assertENTRY-->L7: 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] {29#false} is VALID [2022-04-15 00:04:34,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#false} [80] L7-->L8: 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[] {29#false} is VALID [2022-04-15 00:04:34,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} [83] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-15 00:04:34,376 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-15 00:04:34,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:04:34,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480349134] [2022-04-15 00:04:34,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480349134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:04:34,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:04:34,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:04:34,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646179315] [2022-04-15 00:04:34,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:04:34,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 15 [2022-04-15 00:04:34,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:04:34,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-15 00:04:34,431 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-15 00:04:34,432 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:04:34,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:04:34,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:04:34,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:04:34,462 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-15 00:04:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:34,564 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-15 00:04:34,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:04:34,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 15 [2022-04-15 00:04:34,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:04:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-15 00:04:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 00:04:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-15 00:04:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 00:04:34,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-15 00:04:34,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:34,644 INFO L225 Difference]: With dead ends: 40 [2022-04-15 00:04:34,645 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 00:04:34,647 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:04:34,651 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:04:34,652 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 27 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:04:34,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 00:04:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 00:04:34,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:04:34,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-15 00:04:34,675 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-15 00:04:34,675 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-15 00:04:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:34,677 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-15 00:04:34,677 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 00:04:34,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:34,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:34,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 16 states. [2022-04-15 00:04:34,678 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 16 states. [2022-04-15 00:04:34,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:34,679 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-15 00:04:34,679 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 00:04:34,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:34,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:34,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:04:34,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:04:34,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-15 00:04:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 00:04:34,682 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 15 [2022-04-15 00:04:34,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:04:34,682 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 00:04:34,683 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-15 00:04:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 00:04:34,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 00:04:34,684 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:04:34,684 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:04:34,684 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:04:34,685 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:04:34,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:04:34,688 INFO L85 PathProgramCache]: Analyzing trace with hash 965226702, now seen corresponding path program 1 times [2022-04-15 00:04:34,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:04:34,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42585151] [2022-04-15 00:04:34,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:04:34,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:04:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:34,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:04:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:34,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#(and (= ~b~0 |old(~b~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) (= (select |v_#valid_1| 0) 0) (= v_~b~0_4 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~b~0=v_~b~0_4, #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[~b~0, #NULL.offset, #NULL.base] {140#true} is VALID [2022-04-15 00:04:34,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#true} is VALID [2022-04-15 00:04:34,799 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {140#true} {140#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#true} is VALID [2022-04-15 00:04:34,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {140#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {147#(and (= ~b~0 |old(~b~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:04:34,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#(and (= ~b~0 |old(~b~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) (= (select |v_#valid_1| 0) 0) (= v_~b~0_4 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~b~0=v_~b~0_4, #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[~b~0, #NULL.offset, #NULL.base] {140#true} is VALID [2022-04-15 00:04:34,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {140#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#true} is VALID [2022-04-15 00:04:34,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140#true} {140#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#true} is VALID [2022-04-15 00:04:34,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {140#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#true} is VALID [2022-04-15 00:04:34,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {140#true} [63] mainENTRY-->L19: Formula: (= v_main_~k~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~a~0] {140#true} is VALID [2022-04-15 00:04:34,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#true} [65] L19-->L19-2: Formula: (and (not (= (mod v_main_~k~0_2 256) 0)) (= v_main_~n~0_2 0)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~n~0] {145#(= main_~n~0 0)} is VALID [2022-04-15 00:04:34,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {145#(= main_~n~0 0)} [67] L19-2-->L27: Formula: (and (= v_main_~i~0_2 0) (= v_main_~j~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~j~0, main_~i~0] {146#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-15 00:04:34,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(and (= main_~n~0 0) (= main_~i~0 0))} [69] L27-->L30-2: Formula: (not (< 10000 (mod v_main_~j~0_4 4294967296))) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[] {146#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-15 00:04:34,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#(and (= main_~n~0 0) (= main_~i~0 0))} [72] L30-2-->L30-3: Formula: (not (<= (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {141#false} is VALID [2022-04-15 00:04:34,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {141#false} [74] L30-3-->L36: Formula: (= (store v_main_~a~0_5 (mod v_main_~i~0_6 4294967296) 0) v_main_~a~0_4) InVars {main_~i~0=v_main_~i~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~a~0] {141#false} is VALID [2022-04-15 00:04:34,806 INFO L272 TraceCheckUtils]: 11: Hoare triple {141#false} [75] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (mod v_main_~j~0_9 4294967296) 1025) 1 0)) InVars {main_~j~0=v_main_~j~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {141#false} is VALID [2022-04-15 00:04:34,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {141#false} [77] __VERIFIER_assertENTRY-->L7: 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] {141#false} is VALID [2022-04-15 00:04:34,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {141#false} [80] L7-->L8: 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[] {141#false} is VALID [2022-04-15 00:04:34,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {141#false} [83] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141#false} is VALID [2022-04-15 00:04:34,807 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-15 00:04:34,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:04:34,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42585151] [2022-04-15 00:04:34,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42585151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:04:34,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:04:34,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 00:04:34,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973049226] [2022-04-15 00:04:34,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:04:34,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-15 00:04:34,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:04:34,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 00:04:34,821 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-15 00:04:34,822 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 00:04:34,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:04:34,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 00:04:34,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 00:04:34,824 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 00:04:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:34,960 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-15 00:04:34,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 00:04:34,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-15 00:04:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:04:34,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 00:04:34,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-15 00:04:34,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 00:04:34,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-15 00:04:34,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-15 00:04:34,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:34,996 INFO L225 Difference]: With dead ends: 28 [2022-04-15 00:04:34,996 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 00:04:34,998 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:04:35,000 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:04:35,001 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 30 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:04:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 00:04:35,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-04-15 00:04:35,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:04:35,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-15 00:04:35,009 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-15 00:04:35,009 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-15 00:04:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:35,011 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 00:04:35,011 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 00:04:35,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:35,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:35,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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 22 states. [2022-04-15 00:04:35,012 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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 22 states. [2022-04-15 00:04:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:35,014 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 00:04:35,014 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 00:04:35,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:35,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:35,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:04:35,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:04:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-15 00:04:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-15 00:04:35,017 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2022-04-15 00:04:35,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:04:35,017 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-15 00:04:35,018 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 00:04:35,018 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-15 00:04:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 00:04:35,018 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:04:35,019 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:04:35,019 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:04:35,019 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:04:35,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:04:35,020 INFO L85 PathProgramCache]: Analyzing trace with hash -842227761, now seen corresponding path program 1 times [2022-04-15 00:04:35,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:04:35,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336768467] [2022-04-15 00:04:35,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:04:35,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:04:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:35,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:04:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:35,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {272#(and (= ~b~0 |old(~b~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) (= (select |v_#valid_1| 0) 0) (= v_~b~0_4 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~b~0=v_~b~0_4, #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[~b~0, #NULL.offset, #NULL.base] {265#true} is VALID [2022-04-15 00:04:35,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {265#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-15 00:04:35,209 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {265#true} {265#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-15 00:04:35,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {265#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {272#(and (= ~b~0 |old(~b~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:04:35,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {272#(and (= ~b~0 |old(~b~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) (= (select |v_#valid_1| 0) 0) (= v_~b~0_4 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~b~0=v_~b~0_4, #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[~b~0, #NULL.offset, #NULL.base] {265#true} is VALID [2022-04-15 00:04:35,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {265#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-15 00:04:35,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {265#true} {265#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-15 00:04:35,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {265#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-15 00:04:35,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {265#true} [63] mainENTRY-->L19: Formula: (= v_main_~k~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~a~0] {265#true} is VALID [2022-04-15 00:04:35,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {265#true} [66] L19-->L19-2: Formula: (and (= (mod v_main_~k~0_3 256) 0) (= 1023 v_main_~n~0_3)) InVars {main_~k~0=v_main_~k~0_3} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~n~0] {270#(and (<= main_~n~0 1023) (<= 1023 main_~n~0))} is VALID [2022-04-15 00:04:35,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {270#(and (<= main_~n~0 1023) (<= 1023 main_~n~0))} [67] L19-2-->L27: Formula: (and (= v_main_~i~0_2 0) (= v_main_~j~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~j~0, main_~i~0] {271#(and (not (<= (+ (div main_~i~0 4294967296) 1) (div main_~n~0 4294967296))) (<= 1023 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-15 00:04:35,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {271#(and (not (<= (+ (div main_~i~0 4294967296) 1) (div main_~n~0 4294967296))) (<= 1023 main_~n~0) (= main_~i~0 0))} [69] L27-->L30-2: Formula: (not (< 10000 (mod v_main_~j~0_4 4294967296))) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[] {271#(and (not (<= (+ (div main_~i~0 4294967296) 1) (div main_~n~0 4294967296))) (<= 1023 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-15 00:04:35,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#(and (not (<= (+ (div main_~i~0 4294967296) 1) (div main_~n~0 4294967296))) (<= 1023 main_~n~0) (= main_~i~0 0))} [72] L30-2-->L30-3: Formula: (not (<= (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {266#false} is VALID [2022-04-15 00:04:35,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {266#false} [74] L30-3-->L36: Formula: (= (store v_main_~a~0_5 (mod v_main_~i~0_6 4294967296) 0) v_main_~a~0_4) InVars {main_~i~0=v_main_~i~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~a~0] {266#false} is VALID [2022-04-15 00:04:35,217 INFO L272 TraceCheckUtils]: 11: Hoare triple {266#false} [75] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (mod v_main_~j~0_9 4294967296) 1025) 1 0)) InVars {main_~j~0=v_main_~j~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {266#false} is VALID [2022-04-15 00:04:35,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {266#false} [77] __VERIFIER_assertENTRY-->L7: 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] {266#false} is VALID [2022-04-15 00:04:35,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {266#false} [80] L7-->L8: 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[] {266#false} is VALID [2022-04-15 00:04:35,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {266#false} [83] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {266#false} is VALID [2022-04-15 00:04:35,217 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-15 00:04:35,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:04:35,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336768467] [2022-04-15 00:04:35,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336768467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:04:35,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:04:35,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 00:04:35,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700569471] [2022-04-15 00:04:35,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:04:35,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-15 00:04:35,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:04:35,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 00:04:35,238 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-15 00:04:35,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 00:04:35,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:04:35,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 00:04:35,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 00:04:35,239 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 00:04:35,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:35,378 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 00:04:35,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 00:04:35,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-15 00:04:35,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:04:35,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 00:04:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-15 00:04:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 00:04:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-15 00:04:35,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-15 00:04:35,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:35,414 INFO L225 Difference]: With dead ends: 29 [2022-04-15 00:04:35,414 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 00:04:35,417 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:04:35,421 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:04:35,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:04:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 00:04:35,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2022-04-15 00:04:35,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:04:35,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 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-15 00:04:35,432 INFO L74 IsIncluded]: Start isIncluded. First operand 23 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-15 00:04:35,432 INFO L87 Difference]: Start difference. First operand 23 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-15 00:04:35,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:35,437 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 00:04:35,437 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 00:04:35,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:35,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:35,438 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 23 states. [2022-04-15 00:04:35,438 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 23 states. [2022-04-15 00:04:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:35,440 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 00:04:35,440 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 00:04:35,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:35,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:35,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:04:35,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:04:35,447 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-15 00:04:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-15 00:04:35,448 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2022-04-15 00:04:35,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:04:35,448 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-15 00:04:35,448 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 00:04:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 00:04:35,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 00:04:35,449 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:04:35,449 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:04:35,450 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 00:04:35,450 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:04:35,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:04:35,450 INFO L85 PathProgramCache]: Analyzing trace with hash 686516073, now seen corresponding path program 1 times [2022-04-15 00:04:35,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:04:35,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101116076] [2022-04-15 00:04:35,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:04:35,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:04:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 00:04:35,480 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 00:04:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 00:04:35,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 00:04:35,525 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 00:04:35,526 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:04:35,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 00:04:35,529 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-15 00:04:35,531 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:04:35,545 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 00:04:35,545 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 00:04:35,545 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 00:04:35,545 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 00:04:35,545 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:04:35,545 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:04:35,545 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:04:35,545 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 00:04:35,545 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 00:04:35,545 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:04:35,545 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-15 00:04:35,545 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 00:04:35,545 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 00:04:35,545 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-15 00:04:35,546 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 00:04:35,546 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 00:04:35,546 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 00:04:35,546 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:04:35,546 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:04:35,546 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2022-04-15 00:04:35,546 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2022-04-15 00:04:35,546 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2022-04-15 00:04:35,546 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-15 00:04:35,546 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:04:35,546 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2022-04-15 00:04:35,546 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-15 00:04:35,546 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-15 00:04:35,546 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:04:35,546 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-15 00:04:35,546 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-15 00:04:35,546 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:04:35,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:04:35 BasicIcfg [2022-04-15 00:04:35,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:04:35,548 INFO L158 Benchmark]: Toolchain (without parser) took 1950.31ms. Allocated memory was 183.5MB in the beginning and 245.4MB in the end (delta: 61.9MB). Free memory was 124.7MB in the beginning and 212.7MB in the end (delta: -88.0MB). Peak memory consumption was 78.2MB. Max. memory is 8.0GB. [2022-04-15 00:04:35,548 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory was 141.0MB in the beginning and 140.9MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:04:35,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.68ms. Allocated memory was 183.5MB in the beginning and 245.4MB in the end (delta: 61.9MB). Free memory was 124.5MB in the beginning and 215.0MB in the end (delta: -90.5MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-04-15 00:04:35,548 INFO L158 Benchmark]: Boogie Preprocessor took 19.30ms. Allocated memory is still 245.4MB. Free memory was 215.0MB in the beginning and 214.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:04:35,549 INFO L158 Benchmark]: RCFGBuilder took 276.44ms. Allocated memory is still 245.4MB. Free memory was 213.5MB in the beginning and 201.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 00:04:35,549 INFO L158 Benchmark]: IcfgTransformer took 21.67ms. Allocated memory is still 245.4MB. Free memory was 201.9MB in the beginning and 200.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:04:35,549 INFO L158 Benchmark]: TraceAbstraction took 1420.78ms. Allocated memory is still 245.4MB. Free memory was 199.8MB in the beginning and 212.7MB in the end (delta: -12.9MB). Peak memory consumption was 91.5MB. Max. memory is 8.0GB. [2022-04-15 00:04:35,550 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.09ms. Allocated memory is still 183.5MB. Free memory was 141.0MB in the beginning and 140.9MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.68ms. Allocated memory was 183.5MB in the beginning and 245.4MB in the end (delta: 61.9MB). Free memory was 124.5MB in the beginning and 215.0MB in the end (delta: -90.5MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.30ms. Allocated memory is still 245.4MB. Free memory was 215.0MB in the beginning and 214.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 276.44ms. Allocated memory is still 245.4MB. Free memory was 213.5MB in the beginning and 201.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 21.67ms. Allocated memory is still 245.4MB. Free memory was 201.9MB in the beginning and 200.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1420.78ms. Allocated memory is still 245.4MB. Free memory was 199.8MB in the beginning and 212.7MB in the end (delta: -12.9MB). Peak memory consumption was 91.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 - CounterExampleResult [Line: 8]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int b; VAL [\old(b)=260, b=0] [L15] _Bool k=__VERIFIER_nondet_bool(); [L16] unsigned int i,n,j; [L17] int a[1025]; VAL [b=0, k=1] [L19] COND TRUE \read(k) [L20] n=0 VAL [b=0, k=1, n=0] [L25] i=0 [L26] j=__VERIFIER_nondet_uint() [L27] COND FALSE !(j > 10000) VAL [b=0, i=0, j=-4294966273, k=1, n=0] [L30] COND TRUE i <= n [L31] i++ [L32] j= j +2 VAL [b=0, i=1, j=-4294966271, k=1, n=0] [L30] COND FALSE !(i <= n) VAL [b=0, i=1, j=-4294966271, k=1, n=0] [L35] a[i]=0 VAL [b=0, i=1, j=-4294966271, k=1, n=0] [L36] CALL __VERIFIER_assert(j<1025) VAL [\old(cond)=0, b=0] [L7] COND TRUE !(cond) VAL [\old(cond)=0, b=0, cond=0] [L8] reach_error() VAL [\old(cond)=0, b=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 63 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 13, 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, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-15 00:04:35,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...