./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/cart.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/cart.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:43:57,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:43:57,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:43:57,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:43:57,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:43:57,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:43:57,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:43:57,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:43:57,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:43:57,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:43:57,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:43:57,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:43:57,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:43:57,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:43:57,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:43:57,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:43:57,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:43:57,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:43:57,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:43:57,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:43:57,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:43:57,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:43:57,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:43:57,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:43:57,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:43:57,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:43:57,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:43:57,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:43:57,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:43:57,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:43:57,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:43:57,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:43:57,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:43:57,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:43:57,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:43:57,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:43:57,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:43:57,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:43:57,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:43:57,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:43:57,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:43:57,894 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:43:57,932 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:43:57,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:43:57,933 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:43:57,933 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:43:57,934 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:43:57,934 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:43:57,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:43:57,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:43:57,935 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:43:57,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:43:57,936 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:43:57,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:43:57,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:43:57,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:43:57,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:43:57,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:43:57,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:43:57,937 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:43:57,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:43:57,937 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:43:57,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:43:57,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:43:57,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:43:57,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:43:57,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:43:57,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:43:57,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:43:57,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:43:57,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:43:57,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:43:57,939 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:43:57,939 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:43:57,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:43:57,940 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:43:57,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af [2021-12-14 13:43:58,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:43:58,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:43:58,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:43:58,226 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:43:58,227 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:43:58,227 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2021-12-14 13:43:58,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49358551/5462ff9bfcb443f3893e39bde3a50a1f/FLAGed7c8fa81 [2021-12-14 13:43:58,729 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:43:58,730 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2021-12-14 13:43:58,740 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49358551/5462ff9bfcb443f3893e39bde3a50a1f/FLAGed7c8fa81 [2021-12-14 13:43:58,752 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49358551/5462ff9bfcb443f3893e39bde3a50a1f [2021-12-14 13:43:58,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:43:58,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:43:58,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:43:58,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:43:58,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:43:58,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:43:58" (1/1) ... [2021-12-14 13:43:58,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405da6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:58, skipping insertion in model container [2021-12-14 13:43:58,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:43:58" (1/1) ... [2021-12-14 13:43:58,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:43:58,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:43:59,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i[23713,23726] [2021-12-14 13:43:59,051 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:43:59,056 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:43:59,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i[23713,23726] [2021-12-14 13:43:59,086 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:43:59,108 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:43:59,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:59 WrapperNode [2021-12-14 13:43:59,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:43:59,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:43:59,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:43:59,110 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:43:59,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:59" (1/1) ... [2021-12-14 13:43:59,135 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:59" (1/1) ... [2021-12-14 13:43:59,161 INFO L137 Inliner]: procedures = 121, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2021-12-14 13:43:59,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:43:59,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:43:59,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:43:59,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:43:59,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:59" (1/1) ... [2021-12-14 13:43:59,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:59" (1/1) ... [2021-12-14 13:43:59,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:59" (1/1) ... [2021-12-14 13:43:59,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:59" (1/1) ... [2021-12-14 13:43:59,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:59" (1/1) ... [2021-12-14 13:43:59,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:59" (1/1) ... [2021-12-14 13:43:59,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:59" (1/1) ... [2021-12-14 13:43:59,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:43:59,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:43:59,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:43:59,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:43:59,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:59" (1/1) ... [2021-12-14 13:43:59,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:43:59,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:43:59,245 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) [2021-12-14 13:43:59,248 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 [2021-12-14 13:43:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 13:43:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 13:43:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 13:43:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:43:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 13:43:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 13:43:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:43:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:43:59,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:43:59,449 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:43:59,451 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:43:59,680 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:43:59,687 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:43:59,688 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-14 13:43:59,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:43:59 BoogieIcfgContainer [2021-12-14 13:43:59,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:43:59,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:43:59,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:43:59,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:43:59,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:43:58" (1/3) ... [2021-12-14 13:43:59,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3427b4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:43:59, skipping insertion in model container [2021-12-14 13:43:59,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:43:59" (2/3) ... [2021-12-14 13:43:59,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3427b4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:43:59, skipping insertion in model container [2021-12-14 13:43:59,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:43:59" (3/3) ... [2021-12-14 13:43:59,697 INFO L111 eAbstractionObserver]: Analyzing ICFG cart.i [2021-12-14 13:43:59,701 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:43:59,701 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 13:43:59,748 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:43:59,755 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 13:43:59,755 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 13:43:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:43:59,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 13:43:59,780 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:59,781 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:43:59,781 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:59,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:59,787 INFO L85 PathProgramCache]: Analyzing trace with hash -680841488, now seen corresponding path program 1 times [2021-12-14 13:43:59,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:59,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192222986] [2021-12-14 13:43:59,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:59,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:43:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:43:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:43:59,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:43:59,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192222986] [2021-12-14 13:43:59,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192222986] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:43:59,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:43:59,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 13:43:59,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656265769] [2021-12-14 13:43:59,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:43:59,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 13:43:59,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:43:59,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 13:43:59,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:43:59,943 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:43:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:43:59,956 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2021-12-14 13:43:59,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 13:43:59,958 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-14 13:43:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:43:59,964 INFO L225 Difference]: With dead ends: 34 [2021-12-14 13:43:59,964 INFO L226 Difference]: Without dead ends: 17 [2021-12-14 13:43:59,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:43:59,970 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:43:59,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:43:59,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-12-14 13:43:59,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-14 13:43:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:43:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2021-12-14 13:43:59,993 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2021-12-14 13:43:59,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:43:59,993 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2021-12-14 13:43:59,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:43:59,993 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2021-12-14 13:43:59,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 13:43:59,994 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:43:59,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:43:59,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 13:43:59,994 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:43:59,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:43:59,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1910225148, now seen corresponding path program 1 times [2021-12-14 13:43:59,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:43:59,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906156280] [2021-12-14 13:43:59,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:43:59,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:00,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:00,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906156280] [2021-12-14 13:44:00,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906156280] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:00,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:00,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:44:00,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247376836] [2021-12-14 13:44:00,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:00,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:44:00,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:00,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:44:00,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:44:00,109 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:00,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:00,170 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2021-12-14 13:44:00,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:44:00,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-14 13:44:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:00,173 INFO L225 Difference]: With dead ends: 36 [2021-12-14 13:44:00,173 INFO L226 Difference]: Without dead ends: 21 [2021-12-14 13:44:00,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:44:00,177 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:00,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:44:00,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-14 13:44:00,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-14 13:44:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2021-12-14 13:44:00,186 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2021-12-14 13:44:00,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:00,188 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-12-14 13:44:00,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2021-12-14 13:44:00,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 13:44:00,191 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:00,192 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:00,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 13:44:00,192 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:00,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:00,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1849394690, now seen corresponding path program 1 times [2021-12-14 13:44:00,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:00,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554037782] [2021-12-14 13:44:00,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:00,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:00,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:00,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554037782] [2021-12-14 13:44:00,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554037782] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:00,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:00,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:44:00,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772671882] [2021-12-14 13:44:00,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:00,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:44:00,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:00,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:44:00,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:44:00,315 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:00,371 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2021-12-14 13:44:00,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:44:00,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 13:44:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:00,373 INFO L225 Difference]: With dead ends: 36 [2021-12-14 13:44:00,373 INFO L226 Difference]: Without dead ends: 30 [2021-12-14 13:44:00,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:44:00,379 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:00,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 41 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:44:00,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-14 13:44:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2021-12-14 13:44:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2021-12-14 13:44:00,389 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2021-12-14 13:44:00,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:00,390 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2021-12-14 13:44:00,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2021-12-14 13:44:00,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 13:44:00,391 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:00,392 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:00,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 13:44:00,392 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:00,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:00,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1690179633, now seen corresponding path program 1 times [2021-12-14 13:44:00,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:00,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586485202] [2021-12-14 13:44:00,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:00,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 13:44:00,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:00,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586485202] [2021-12-14 13:44:00,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586485202] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:00,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:00,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:44:00,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295689911] [2021-12-14 13:44:00,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:00,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:44:00,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:00,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:44:00,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:44:00,473 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:00,493 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2021-12-14 13:44:00,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:44:00,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-14 13:44:00,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:00,494 INFO L225 Difference]: With dead ends: 37 [2021-12-14 13:44:00,495 INFO L226 Difference]: Without dead ends: 27 [2021-12-14 13:44:00,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:44:00,496 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:00,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:44:00,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-14 13:44:00,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-14 13:44:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2021-12-14 13:44:00,503 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2021-12-14 13:44:00,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:00,504 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2021-12-14 13:44:00,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2021-12-14 13:44:00,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 13:44:00,506 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:00,506 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:00,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 13:44:00,506 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:00,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1795441037, now seen corresponding path program 1 times [2021-12-14 13:44:00,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:00,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994783573] [2021-12-14 13:44:00,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:00,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:00,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:00,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994783573] [2021-12-14 13:44:00,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994783573] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:00,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313087827] [2021-12-14 13:44:00,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:00,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:00,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:00,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:44:00,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 13:44:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:00,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-14 13:44:00,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:01,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2021-12-14 13:44:01,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:01,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:01,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2021-12-14 13:44:01,113 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:01,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2021-12-14 13:44:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:01,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:01,231 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:01,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 935 treesize of output 907 [2021-12-14 13:44:01,321 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:01,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 13:44:01,389 INFO L354 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2021-12-14 13:44:01,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 569 treesize of output 515 [2021-12-14 13:44:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 13:44:02,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313087827] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:02,052 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:02,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2021-12-14 13:44:02,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561042789] [2021-12-14 13:44:02,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:02,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 13:44:02,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:02,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 13:44:02,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:44:02,054 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:02,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:02,238 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2021-12-14 13:44:02,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 13:44:02,238 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-14 13:44:02,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:02,239 INFO L225 Difference]: With dead ends: 48 [2021-12-14 13:44:02,239 INFO L226 Difference]: Without dead ends: 46 [2021-12-14 13:44:02,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-12-14 13:44:02,240 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 67 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:02,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 125 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 78 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2021-12-14 13:44:02,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-14 13:44:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2021-12-14 13:44:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2021-12-14 13:44:02,245 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 20 [2021-12-14 13:44:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:02,245 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2021-12-14 13:44:02,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2021-12-14 13:44:02,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 13:44:02,246 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:02,246 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:02,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:02,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:02,447 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:02,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:02,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1534874359, now seen corresponding path program 1 times [2021-12-14 13:44:02,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:02,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130331024] [2021-12-14 13:44:02,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:02,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 13:44:02,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:02,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130331024] [2021-12-14 13:44:02,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130331024] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:02,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75648825] [2021-12-14 13:44:02,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:02,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:02,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:02,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:44:02,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 13:44:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:02,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-14 13:44:02,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:02,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 13:44:02,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 13:44:02,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 13:44:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:02,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:02,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2021-12-14 13:44:02,850 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:02,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2021-12-14 13:44:02,861 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-14 13:44:02,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2021-12-14 13:44:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 13:44:02,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75648825] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:02,909 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:02,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2021-12-14 13:44:02,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139991423] [2021-12-14 13:44:02,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:02,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 13:44:02,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:02,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 13:44:02,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:44:02,911 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:03,114 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2021-12-14 13:44:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 13:44:03,115 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 13:44:03,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:03,115 INFO L225 Difference]: With dead ends: 59 [2021-12-14 13:44:03,115 INFO L226 Difference]: Without dead ends: 49 [2021-12-14 13:44:03,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2021-12-14 13:44:03,116 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 84 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:03,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 141 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:44:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-14 13:44:03,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2021-12-14 13:44:03,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:03,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2021-12-14 13:44:03,123 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2021-12-14 13:44:03,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:03,124 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2021-12-14 13:44:03,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:03,124 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2021-12-14 13:44:03,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 13:44:03,125 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:03,125 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:03,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:03,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-14 13:44:03,343 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:03,344 INFO L85 PathProgramCache]: Analyzing trace with hash 379469720, now seen corresponding path program 2 times [2021-12-14 13:44:03,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:03,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802462913] [2021-12-14 13:44:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:03,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:03,413 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:03,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:03,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802462913] [2021-12-14 13:44:03,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802462913] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:03,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790583839] [2021-12-14 13:44:03,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:44:03,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:03,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:03,415 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:44:03,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 13:44:03,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:44:03,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:44:03,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-14 13:44:03,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:03,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 13:44:03,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 13:44:03,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-12-14 13:44:03,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 13:44:03,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-12-14 13:44:03,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 13:44:03,631 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:03,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:03,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790583839] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:03,707 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:03,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2021-12-14 13:44:03,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674222563] [2021-12-14 13:44:03,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:03,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 13:44:03,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:03,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 13:44:03,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:44:03,711 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:03,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:03,816 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2021-12-14 13:44:03,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:44:03,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-14 13:44:03,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:03,818 INFO L225 Difference]: With dead ends: 67 [2021-12-14 13:44:03,818 INFO L226 Difference]: Without dead ends: 40 [2021-12-14 13:44:03,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-14 13:44:03,819 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:03,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 118 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:44:03,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-14 13:44:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-12-14 13:44:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:03,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2021-12-14 13:44:03,824 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 24 [2021-12-14 13:44:03,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:03,824 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2021-12-14 13:44:03,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:03,824 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2021-12-14 13:44:03,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 13:44:03,825 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:03,825 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:03,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:04,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:04,036 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:04,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:04,036 INFO L85 PathProgramCache]: Analyzing trace with hash -3886178, now seen corresponding path program 3 times [2021-12-14 13:44:04,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:04,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047364968] [2021-12-14 13:44:04,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:04,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:04,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:04,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047364968] [2021-12-14 13:44:04,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047364968] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:04,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418932159] [2021-12-14 13:44:04,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 13:44:04,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:04,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:04,305 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:44:04,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 13:44:04,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-14 13:44:04,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:44:04,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-14 13:44:04,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:04,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 13:44:04,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 13:44:04,512 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-14 13:44:04,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-14 13:44:04,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2021-12-14 13:44:04,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:04,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:04,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2021-12-14 13:44:04,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2021-12-14 13:44:04,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:04,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:04,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-12-14 13:44:04,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-12-14 13:44:04,764 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:04,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2021-12-14 13:44:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:04,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:04,815 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_401) |c_ULTIMATE.start_main_~l~0#1.base|))) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))))) is different from false [2021-12-14 13:44:04,929 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:04,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 85 [2021-12-14 13:44:04,945 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:04,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 82 [2021-12-14 13:44:04,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:04,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-12-14 13:44:04,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:04,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:04,966 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:04,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2021-12-14 13:44:04,996 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-14 13:44:04,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 3 [2021-12-14 13:44:05,047 INFO L354 Elim1Store]: treesize reduction 36, result has 50.7 percent of original size [2021-12-14 13:44:05,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 65 [2021-12-14 13:44:05,273 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Complicated and unsupported kind of self-update: (select |v_#memory_$Pointer$.base_58| (select (store (store v_ArrVal_391 8 v_ArrVal_398) 4 v_ArrVal_400) 0)) [2021-12-14 13:44:05,274 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-14 13:44:05,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-12-14 13:44:05,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676347621] [2021-12-14 13:44:05,274 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:05,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 13:44:05,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:05,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 13:44:05,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=391, Unknown=1, NotChecked=40, Total=506 [2021-12-14 13:44:05,276 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:05,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 13:44:05,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=391, Unknown=1, NotChecked=40, Total=506 [2021-12-14 13:44:05,277 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:05,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:44:05,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:05,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:05,492 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@4e7fa4b0 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-14 13:44:05,495 INFO L158 Benchmark]: Toolchain (without parser) took 6739.44ms. Allocated memory was 100.7MB in the beginning and 123.7MB in the end (delta: 23.1MB). Free memory was 58.9MB in the beginning and 52.1MB in the end (delta: 6.8MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2021-12-14 13:44:05,495 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 13:44:05,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.12ms. Allocated memory is still 100.7MB. Free memory was 58.8MB in the beginning and 68.8MB in the end (delta: -10.1MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2021-12-14 13:44:05,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.30ms. Allocated memory is still 100.7MB. Free memory was 68.8MB in the beginning and 66.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:44:05,495 INFO L158 Benchmark]: Boogie Preprocessor took 46.07ms. Allocated memory is still 100.7MB. Free memory was 66.9MB in the beginning and 65.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:44:05,496 INFO L158 Benchmark]: RCFGBuilder took 481.47ms. Allocated memory is still 100.7MB. Free memory was 65.5MB in the beginning and 71.9MB in the end (delta: -6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 13:44:05,496 INFO L158 Benchmark]: TraceAbstraction took 5803.00ms. Allocated memory was 100.7MB in the beginning and 123.7MB in the end (delta: 23.1MB). Free memory was 71.5MB in the beginning and 52.1MB in the end (delta: 19.4MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2021-12-14 13:44:05,499 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.12ms. Allocated memory is still 100.7MB. Free memory was 58.8MB in the beginning and 68.8MB in the end (delta: -10.1MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.30ms. Allocated memory is still 100.7MB. Free memory was 68.8MB in the beginning and 66.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.07ms. Allocated memory is still 100.7MB. Free memory was 66.9MB in the beginning and 65.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 481.47ms. Allocated memory is still 100.7MB. Free memory was 65.5MB in the beginning and 71.9MB in the end (delta: -6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5803.00ms. Allocated memory was 100.7MB in the beginning and 123.7MB in the end (delta: 23.1MB). Free memory was 71.5MB in the beginning and 52.1MB in the end (delta: 19.4MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@4e7fa4b0 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@4e7fa4b0: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-14 13:44:05,530 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/cart.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:44:07,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:44:07,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:44:07,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:44:07,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:44:07,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:44:07,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:44:07,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:44:07,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:44:07,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:44:07,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:44:07,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:44:07,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:44:07,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:44:07,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:44:07,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:44:07,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:44:07,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:44:07,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:44:07,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:44:07,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:44:07,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:44:07,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:44:07,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:44:07,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:44:07,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:44:07,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:44:07,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:44:07,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:44:07,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:44:07,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:44:07,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:44:07,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:44:07,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:44:07,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:44:07,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:44:07,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:44:07,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:44:07,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:44:07,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:44:07,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:44:07,587 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-14 13:44:07,616 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:44:07,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:44:07,617 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:44:07,618 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:44:07,619 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:44:07,619 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:44:07,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:44:07,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:44:07,620 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:44:07,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:44:07,621 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:44:07,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:44:07,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:44:07,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:44:07,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:44:07,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:44:07,622 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 13:44:07,623 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 13:44:07,623 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 13:44:07,623 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:44:07,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:44:07,623 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:44:07,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:44:07,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:44:07,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:44:07,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:44:07,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:44:07,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:44:07,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:44:07,625 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:44:07,625 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 13:44:07,625 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 13:44:07,626 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:44:07,626 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:44:07,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:44:07,626 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:44:07,626 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 13:44:07,627 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af [2021-12-14 13:44:07,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:44:07,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:44:07,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:44:07,936 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:44:07,936 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:44:07,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2021-12-14 13:44:07,986 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49c336137/6b982bc548754df184221ba4883f0e30/FLAG94eb1ef86 [2021-12-14 13:44:08,426 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:44:08,427 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2021-12-14 13:44:08,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49c336137/6b982bc548754df184221ba4883f0e30/FLAG94eb1ef86 [2021-12-14 13:44:08,765 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49c336137/6b982bc548754df184221ba4883f0e30 [2021-12-14 13:44:08,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:44:08,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:44:08,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:44:08,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:44:08,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:44:08,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:44:08" (1/1) ... [2021-12-14 13:44:08,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4a1b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:08, skipping insertion in model container [2021-12-14 13:44:08,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:44:08" (1/1) ... [2021-12-14 13:44:08,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:44:08,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:44:09,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i[23713,23726] [2021-12-14 13:44:09,113 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:44:09,126 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:44:09,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i[23713,23726] [2021-12-14 13:44:09,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:44:09,212 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:44:09,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09 WrapperNode [2021-12-14 13:44:09,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:44:09,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:44:09,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:44:09,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:44:09,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,276 INFO L137 Inliner]: procedures = 124, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 75 [2021-12-14 13:44:09,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:44:09,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:44:09,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:44:09,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:44:09,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:44:09,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:44:09,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:44:09,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:44:09,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:44:09,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:09,356 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) [2021-12-14 13:44:09,378 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 [2021-12-14 13:44:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-14 13:44:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 13:44:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:44:09,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 13:44:09,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 13:44:09,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-14 13:44:09,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 13:44:09,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:44:09,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:44:09,509 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:44:09,510 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:44:09,716 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:44:09,720 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:44:09,721 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-14 13:44:09,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:44:09 BoogieIcfgContainer [2021-12-14 13:44:09,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:44:09,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:44:09,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:44:09,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:44:09,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:44:08" (1/3) ... [2021-12-14 13:44:09,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d3db68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:44:09, skipping insertion in model container [2021-12-14 13:44:09,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (2/3) ... [2021-12-14 13:44:09,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d3db68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:44:09, skipping insertion in model container [2021-12-14 13:44:09,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:44:09" (3/3) ... [2021-12-14 13:44:09,729 INFO L111 eAbstractionObserver]: Analyzing ICFG cart.i [2021-12-14 13:44:09,732 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:44:09,733 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 13:44:09,767 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:44:09,772 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 13:44:09,772 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 13:44:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:09,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 13:44:09,794 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:09,799 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:09,799 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:09,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:09,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1597928625, now seen corresponding path program 1 times [2021-12-14 13:44:09,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:44:09,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362971339] [2021-12-14 13:44:09,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:09,820 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:44:09,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:44:09,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:44:09,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-14 13:44:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:09,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-14 13:44:09,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:09,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:44:09,953 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:44:09,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362971339] [2021-12-14 13:44:09,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362971339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:09,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:09,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 13:44:09,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914926729] [2021-12-14 13:44:09,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:09,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 13:44:09,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:44:09,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 13:44:09,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:44:09,995 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:10,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:10,007 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2021-12-14 13:44:10,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 13:44:10,008 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-14 13:44:10,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:10,014 INFO L225 Difference]: With dead ends: 33 [2021-12-14 13:44:10,014 INFO L226 Difference]: Without dead ends: 16 [2021-12-14 13:44:10,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:44:10,020 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:10,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:44:10,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-12-14 13:44:10,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-12-14 13:44:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2021-12-14 13:44:10,044 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 9 [2021-12-14 13:44:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:10,045 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2021-12-14 13:44:10,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2021-12-14 13:44:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 13:44:10,046 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:10,046 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:10,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:10,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:44:10,260 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:10,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:10,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1565257307, now seen corresponding path program 1 times [2021-12-14 13:44:10,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:44:10,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784270764] [2021-12-14 13:44:10,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:10,262 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:44:10,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:44:10,263 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:44:10,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-14 13:44:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:10,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 13:44:10,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:10,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:44:10,398 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:44:10,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784270764] [2021-12-14 13:44:10,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784270764] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:10,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:10,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:44:10,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302762651] [2021-12-14 13:44:10,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:10,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:44:10,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:44:10,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:44:10,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:44:10,402 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:10,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:10,572 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2021-12-14 13:44:10,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:44:10,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-14 13:44:10,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:10,573 INFO L225 Difference]: With dead ends: 34 [2021-12-14 13:44:10,573 INFO L226 Difference]: Without dead ends: 19 [2021-12-14 13:44:10,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:44:10,575 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:10,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 45 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:44:10,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-12-14 13:44:10,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-14 13:44:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2021-12-14 13:44:10,579 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2021-12-14 13:44:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:10,580 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-12-14 13:44:10,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2021-12-14 13:44:10,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 13:44:10,592 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:10,592 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:10,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:10,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:44:10,793 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:10,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:10,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2088599158, now seen corresponding path program 1 times [2021-12-14 13:44:10,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:44:10,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532333883] [2021-12-14 13:44:10,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:10,795 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:44:10,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:44:10,796 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:44:10,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-14 13:44:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:10,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 13:44:10,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:10,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:44:10,922 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:44:10,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532333883] [2021-12-14 13:44:10,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532333883] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:10,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:10,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:44:10,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792266730] [2021-12-14 13:44:10,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:10,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:44:10,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:44:10,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:44:10,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:44:10,925 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:11,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:11,060 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2021-12-14 13:44:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:44:11,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-14 13:44:11,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:11,062 INFO L225 Difference]: With dead ends: 34 [2021-12-14 13:44:11,062 INFO L226 Difference]: Without dead ends: 28 [2021-12-14 13:44:11,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:44:11,063 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:11,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 36 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:44:11,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-14 13:44:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2021-12-14 13:44:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2021-12-14 13:44:11,069 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2021-12-14 13:44:11,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:11,070 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2021-12-14 13:44:11,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2021-12-14 13:44:11,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 13:44:11,071 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:11,071 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:11,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-14 13:44:11,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:44:11,281 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:11,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:11,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1311378947, now seen corresponding path program 1 times [2021-12-14 13:44:11,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:44:11,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827574694] [2021-12-14 13:44:11,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:11,282 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:44:11,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:44:11,284 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:44:11,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-14 13:44:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:11,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 13:44:11,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:44:11,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:44:11,390 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:44:11,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827574694] [2021-12-14 13:44:11,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827574694] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:11,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:11,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:44:11,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896811758] [2021-12-14 13:44:11,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:11,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:44:11,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:44:11,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:44:11,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:44:11,395 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:11,419 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2021-12-14 13:44:11,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:44:11,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-14 13:44:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:11,421 INFO L225 Difference]: With dead ends: 35 [2021-12-14 13:44:11,422 INFO L226 Difference]: Without dead ends: 25 [2021-12-14 13:44:11,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:44:11,423 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:11,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:44:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-14 13:44:11,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-14 13:44:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2021-12-14 13:44:11,432 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 18 [2021-12-14 13:44:11,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:11,433 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2021-12-14 13:44:11,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2021-12-14 13:44:11,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 13:44:11,434 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:11,434 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:11,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:11,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:44:11,648 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:11,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:11,649 INFO L85 PathProgramCache]: Analyzing trace with hash 502032321, now seen corresponding path program 1 times [2021-12-14 13:44:11,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:44:11,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617994911] [2021-12-14 13:44:11,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:11,650 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:44:11,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:44:11,651 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:44:11,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-14 13:44:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:11,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 13:44:11,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:11,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2021-12-14 13:44:12,023 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-12-14 13:44:12,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 61 [2021-12-14 13:44:12,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 13:44:12,159 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-14 13:44:12,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 15 [2021-12-14 13:44:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:44:12,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:12,386 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:12,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1392 treesize of output 1302 [2021-12-14 13:44:12,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:12,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2021-12-14 13:44:12,763 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:12,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:12,793 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:12,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 71 [2021-12-14 13:44:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:44:13,160 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:44:13,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617994911] [2021-12-14 13:44:13,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617994911] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:13,161 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:44:13,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-12-14 13:44:13,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305037167] [2021-12-14 13:44:13,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:13,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 13:44:13,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:44:13,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 13:44:13,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:44:13,163 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:15,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-14 13:44:21,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-14 13:44:23,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-14 13:44:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:24,091 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2021-12-14 13:44:24,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 13:44:24,093 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-14 13:44:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:24,093 INFO L225 Difference]: With dead ends: 50 [2021-12-14 13:44:24,094 INFO L226 Difference]: Without dead ends: 48 [2021-12-14 13:44:24,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2021-12-14 13:44:24,095 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 54 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 30 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:24,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 115 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 106 Invalid, 3 Unknown, 38 Unchecked, 6.6s Time] [2021-12-14 13:44:24,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-12-14 13:44:24,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2021-12-14 13:44:24,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:24,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2021-12-14 13:44:24,104 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 18 [2021-12-14 13:44:24,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:24,104 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2021-12-14 13:44:24,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:24,104 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2021-12-14 13:44:24,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-14 13:44:24,105 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:24,106 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:24,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:24,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:44:24,316 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:24,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:24,317 INFO L85 PathProgramCache]: Analyzing trace with hash 972646004, now seen corresponding path program 1 times [2021-12-14 13:44:24,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:44:24,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105218346] [2021-12-14 13:44:24,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:24,318 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:44:24,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:44:24,320 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:44:24,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-14 13:44:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:24,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 13:44:24,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:24,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 13:44:24,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 13:44:24,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:44:24,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:24,682 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-14 13:44:24,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2021-12-14 13:44:24,693 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-14 13:44:24,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2021-12-14 13:44:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:44:24,726 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:44:24,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105218346] [2021-12-14 13:44:24,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105218346] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:24,726 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:44:24,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-12-14 13:44:24,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807468914] [2021-12-14 13:44:24,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:24,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 13:44:24,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:44:24,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 13:44:24,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:44:24,728 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:25,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:25,163 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2021-12-14 13:44:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 13:44:25,164 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-14 13:44:25,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:25,164 INFO L225 Difference]: With dead ends: 57 [2021-12-14 13:44:25,164 INFO L226 Difference]: Without dead ends: 47 [2021-12-14 13:44:25,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:44:25,165 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 35 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:25,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 107 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 13:44:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-14 13:44:25,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2021-12-14 13:44:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2021-12-14 13:44:25,171 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 21 [2021-12-14 13:44:25,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:25,172 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2021-12-14 13:44:25,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2021-12-14 13:44:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 13:44:25,173 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:25,173 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:25,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:25,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:44:25,393 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:25,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:25,394 INFO L85 PathProgramCache]: Analyzing trace with hash 803189644, now seen corresponding path program 2 times [2021-12-14 13:44:25,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:44:25,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767739515] [2021-12-14 13:44:25,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:44:25,395 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:44:25,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:44:25,396 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:44:25,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-14 13:44:25,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:44:25,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:44:25,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-14 13:44:25,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:25,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 13:44:25,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 13:44:25,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-12-14 13:44:25,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-12-14 13:44:25,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 13:44:25,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 13:44:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:25,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:25,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-12-14 13:44:25,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-12-14 13:44:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:25,874 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:44:25,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767739515] [2021-12-14 13:44:25,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767739515] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:25,874 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:44:25,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-12-14 13:44:25,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087774952] [2021-12-14 13:44:25,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:25,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 13:44:25,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:44:25,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 13:44:25,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:44:25,876 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:26,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:26,268 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2021-12-14 13:44:26,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:44:26,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-14 13:44:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:26,269 INFO L225 Difference]: With dead ends: 64 [2021-12-14 13:44:26,269 INFO L226 Difference]: Without dead ends: 37 [2021-12-14 13:44:26,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-14 13:44:26,270 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:26,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 109 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 18 Unchecked, 0.4s Time] [2021-12-14 13:44:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-14 13:44:26,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-12-14 13:44:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2021-12-14 13:44:26,284 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 22 [2021-12-14 13:44:26,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:26,284 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2021-12-14 13:44:26,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:26,284 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2021-12-14 13:44:26,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:44:26,286 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:26,286 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:26,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:26,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:44:26,498 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:26,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:26,499 INFO L85 PathProgramCache]: Analyzing trace with hash 349213841, now seen corresponding path program 3 times [2021-12-14 13:44:26,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:44:26,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15935326] [2021-12-14 13:44:26,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 13:44:26,500 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:44:26,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:44:26,501 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:44:26,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-14 13:44:26,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-14 13:44:26,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:44:26,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-14 13:44:26,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:26,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 13:44:26,820 INFO L354 Elim1Store]: treesize reduction 74, result has 20.4 percent of original size [2021-12-14 13:44:26,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2021-12-14 13:44:26,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 13:44:26,842 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-14 13:44:26,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2021-12-14 13:44:27,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2021-12-14 13:44:27,107 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-12-14 13:44:27,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 65 [2021-12-14 13:44:27,114 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-14 13:44:27,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-14 13:44:27,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2021-12-14 13:44:27,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:27,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:27,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-12-14 13:44:27,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2021-12-14 13:44:27,311 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-14 13:44:27,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 15 [2021-12-14 13:44:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:27,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:27,452 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_242 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_242) |c_ULTIMATE.start_main_~l~0#1.base|))) (bvsgt (select .cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~l~0#1.offset|)))))) is different from false [2021-12-14 13:44:27,491 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_238 (_ BitVec 32)) (v_ArrVal_242 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_237 (_ BitVec 32)) (v_ArrVal_240 (_ BitVec 32))) (not (let ((.cse0 (select (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (store (store .cse1 .cse2 |c_ULTIMATE.start_main_~order~0#1|) .cse3 (select (store .cse1 .cse2 v_ArrVal_240) .cse3)))) (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) .cse2 v_ArrVal_238) .cse3 v_ArrVal_237) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_242)) |c_ULTIMATE.start_main_~l~0#1.base|))) (bvsgt (select .cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~l~0#1.offset|)))))) |c_ULTIMATE.start_main_#t~short8#1|) is different from false [2021-12-14 13:44:27,620 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (_ BitVec 32)) (v_ArrVal_242 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_237 (_ BitVec 32)) (|v_ULTIMATE.start_main_~order~0#1_11| (_ BitVec 32)) (v_ArrVal_240 (_ BitVec 32))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (let ((.cse0 (select (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse1 .cse2 |v_ULTIMATE.start_main_~order~0#1_11|) .cse3 (select (store .cse1 .cse2 v_ArrVal_240) .cse3))) (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) .cse2 v_ArrVal_238) .cse3 v_ArrVal_237) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_242)) |c_ULTIMATE.start_main_~l~0#1.base|))) (bvsgt (select .cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~l~0#1.offset|))))) (bvslt (select .cse1 .cse3) |v_ULTIMATE.start_main_~order~0#1_11|) (bvslt |v_ULTIMATE.start_main_~order~0#1_11| (_ bv0 32))))) is different from false [2021-12-14 13:44:27,683 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (_ BitVec 32)) (v_ArrVal_242 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_237 (_ BitVec 32)) (|v_ULTIMATE.start_main_~order~0#1_11| (_ BitVec 32)) (v_ArrVal_240 (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (bvslt (select .cse0 .cse1) |v_ULTIMATE.start_main_~order~0#1_11|) (not (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse0 .cse3 |v_ULTIMATE.start_main_~order~0#1_11|) .cse1 (select (store .cse0 .cse3 v_ArrVal_240) .cse1))) (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|) .cse3 v_ArrVal_238) .cse1 v_ArrVal_237) |c_ULTIMATE.start_main_~l~0#1.offset|) v_ArrVal_242) |c_ULTIMATE.start_main_~l~0#1.base|))) (bvsgt (select .cse2 .cse3) (select .cse2 .cse1))))) (bvslt |v_ULTIMATE.start_main_~order~0#1_11| (_ bv0 32))))) is different from false [2021-12-14 13:44:27,775 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:27,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 128 [2021-12-14 13:44:27,781 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:27,782 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:27,785 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:27,786 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:27,786 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:27,816 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:27,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 32 [2021-12-14 13:44:27,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2021-12-14 13:44:27,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:27,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:27,835 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-14 13:44:27,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 36 [2021-12-14 13:44:27,844 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-14 13:44:27,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2021-12-14 13:44:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-14 13:44:27,876 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:44:27,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15935326] [2021-12-14 13:44:27,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15935326] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:27,876 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:44:27,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-12-14 13:44:27,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856949181] [2021-12-14 13:44:27,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:27,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-14 13:44:27,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:44:27,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-14 13:44:27,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=174, Unknown=4, NotChecked=116, Total=342 [2021-12-14 13:44:27,878 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:30,825 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-14 13:44:44,972 WARN L227 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 69 DAG size of output: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-14 13:44:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:45,304 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2021-12-14 13:44:45,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 13:44:45,305 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-14 13:44:45,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:45,305 INFO L225 Difference]: With dead ends: 70 [2021-12-14 13:44:45,305 INFO L226 Difference]: Without dead ends: 65 [2021-12-14 13:44:45,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=130, Invalid=388, Unknown=4, NotChecked=180, Total=702 [2021-12-14 13:44:45,307 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 59 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:45,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 203 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 115 Invalid, 1 Unknown, 166 Unchecked, 2.8s Time] [2021-12-14 13:44:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-14 13:44:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2021-12-14 13:44:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2021-12-14 13:44:45,316 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 25 [2021-12-14 13:44:45,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:45,316 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2021-12-14 13:44:45,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2021-12-14 13:44:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 13:44:45,318 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:45,318 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:45,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:45,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:44:45,520 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:45,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:45,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2099375710, now seen corresponding path program 1 times [2021-12-14 13:44:45,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:44:45,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940987132] [2021-12-14 13:44:45,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:45,521 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:44:45,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:44:45,522 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:44:45,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-14 13:44:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:45,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-14 13:44:45,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:45,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 13:44:45,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 13:44:45,822 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-14 13:44:45,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2021-12-14 13:44:45,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-12-14 13:44:46,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2021-12-14 13:44:46,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:46,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2021-12-14 13:44:46,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2021-12-14 13:44:46,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-12-14 13:44:46,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2021-12-14 13:44:46,337 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:46,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2021-12-14 13:44:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:44:46,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:46,461 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_318 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~l~0#1.base|))) (bvsgt (select .cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~l~0#1.offset|)))))) is different from false [2021-12-14 13:44:46,498 WARN L838 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (forall ((v_ArrVal_316 (_ BitVec 32)) (v_ArrVal_314 (_ BitVec 32)) (v_ArrVal_318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_310 (_ BitVec 32))) (not (let ((.cse0 (select (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (store (store .cse1 .cse2 |c_ULTIMATE.start_main_~order~0#1|) .cse3 (select (store .cse1 .cse2 v_ArrVal_314) .cse3)))) (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) .cse2 v_ArrVal_310) .cse3 v_ArrVal_316) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_318)) |c_ULTIMATE.start_main_~l~0#1.base|))) (bvsgt (select .cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~l~0#1.offset|))))))) is different from false [2021-12-14 13:44:46,636 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_316 (_ BitVec 32)) (v_ArrVal_314 (_ BitVec 32)) (v_ArrVal_318 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~order~0#1_13| (_ BitVec 32)) (v_ArrVal_310 (_ BitVec 32))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (bvslt |v_ULTIMATE.start_main_~order~0#1_13| (_ bv0 32)) (not (let ((.cse0 (select (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse1 .cse2 |v_ULTIMATE.start_main_~order~0#1_13|) .cse3 (select (store .cse1 .cse2 v_ArrVal_314) .cse3))) (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) .cse2 v_ArrVal_310) .cse3 v_ArrVal_316) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_318)) |c_ULTIMATE.start_main_~l~0#1.base|))) (bvsgt (select .cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~l~0#1.offset|))))) (bvslt (select .cse1 .cse3) |v_ULTIMATE.start_main_~order~0#1_13|)))) is different from false [2021-12-14 13:44:46,835 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_316 (_ BitVec 32)) (v_ArrVal_314 (_ BitVec 32)) (v_ArrVal_318 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~order~0#1_13| (_ BitVec 32)) (v_ArrVal_310 (_ BitVec 32))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (not (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse3 .cse1 |v_ULTIMATE.start_main_~order~0#1_13|) .cse2 (select (store .cse3 .cse1 v_ArrVal_314) .cse2))) (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|) .cse1 v_ArrVal_310) .cse2 v_ArrVal_316) |c_ULTIMATE.start_main_~l~0#1.offset|) v_ArrVal_318) |c_ULTIMATE.start_main_~l~0#1.base|))) (bvsgt (select .cse0 .cse1) (select .cse0 .cse2))))) (bvslt (select .cse3 .cse2) |v_ULTIMATE.start_main_~order~0#1_13|) (bvslt |v_ULTIMATE.start_main_~order~0#1_13| (_ bv0 32))))) is different from false [2021-12-14 13:44:46,914 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:46,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 94 [2021-12-14 13:44:46,936 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:46,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 28 [2021-12-14 13:44:46,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2021-12-14 13:44:46,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2021-12-14 13:44:46,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-12-14 13:44:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 16 not checked. [2021-12-14 13:44:46,993 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 13:44:46,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940987132] [2021-12-14 13:44:46,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940987132] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:46,994 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:44:46,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-12-14 13:44:46,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998456079] [2021-12-14 13:44:46,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:46,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-14 13:44:46,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 13:44:46,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-14 13:44:46,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=174, Unknown=4, NotChecked=116, Total=342 [2021-12-14 13:44:46,996 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:48,495 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2021-12-14 13:44:48,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 13:44:48,496 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-14 13:44:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:48,500 INFO L225 Difference]: With dead ends: 76 [2021-12-14 13:44:48,500 INFO L226 Difference]: Without dead ends: 71 [2021-12-14 13:44:48,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=127, Invalid=391, Unknown=4, NotChecked=180, Total=702 [2021-12-14 13:44:48,501 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 41 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:48,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 183 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 119 Invalid, 0 Unknown, 192 Unchecked, 0.9s Time] [2021-12-14 13:44:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-14 13:44:48,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2021-12-14 13:44:48,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:48,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2021-12-14 13:44:48,508 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 28 [2021-12-14 13:44:48,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:48,509 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2021-12-14 13:44:48,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:48,509 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2021-12-14 13:44:48,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 13:44:48,510 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:48,510 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:48,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:48,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 13:44:48,716 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:48,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1022642084, now seen corresponding path program 2 times [2021-12-14 13:44:48,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 13:44:48,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719920739] [2021-12-14 13:44:48,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:44:48,716 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 13:44:48,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 13:44:48,717 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 13:44:48,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-14 13:44:48,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:44:48,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:44:48,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-14 13:44:48,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:48,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 13:44:48,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 13:44:48,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 13:44:48,971 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-14 13:44:48,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-14 13:44:49,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:49,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:49,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:49,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2021-12-14 13:44:49,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:49,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:49,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:49,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2021-12-14 13:44:49,361 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:44:49,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 97 [2021-12-14 13:44:49,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 57 [2021-12-14 13:44:49,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:49,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2021-12-14 13:44:49,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:49,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:49,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2021-12-14 13:44:49,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2021-12-14 13:44:49,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2021-12-14 13:44:49,653 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:49,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2021-12-14 13:44:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:49,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:49,872 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_398 (_ BitVec 32)) (v_ArrVal_393 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store .cse2 .cse3 |c_ULTIMATE.start_main_~order~0#1|) .cse4 (select (store .cse2 .cse3 v_ArrVal_398) .cse4)))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_393) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (bvsgt (select .cse0 (bvadd (_ bv8 32) .cse1)) (select .cse0 (bvadd (_ bv4 32) .cse1)))))) |c_ULTIMATE.start_main_#t~short8#1|) is different from false [2021-12-14 13:44:49,907 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:49,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1220 treesize of output 1129 [2021-12-14 13:44:50,939 INFO L354 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2021-12-14 13:44:50,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 201 [2021-12-14 13:44:52,157 INFO L354 Elim1Store]: treesize reduction 40, result has 70.6 percent of original size [2021-12-14 13:44:52,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 282 treesize of output 314