./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0019-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3a877d22 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0019-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a1ab43e825ce385252e3e834bebdceddee5ecd9c5749af5b0b2355e44f90dcd --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 14:00:03,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 14:00:03,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 14:00:03,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 14:00:03,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 14:00:03,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 14:00:03,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 14:00:03,906 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 14:00:03,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 14:00:03,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 14:00:03,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 14:00:03,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 14:00:03,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 14:00:03,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 14:00:03,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 14:00:03,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 14:00:03,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 14:00:03,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 14:00:03,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 14:00:03,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 14:00:03,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 14:00:03,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 14:00:03,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 14:00:03,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 14:00:03,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 14:00:03,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 14:00:03,951 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 14:00:03,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 14:00:03,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 14:00:03,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 14:00:03,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 14:00:03,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 14:00:03,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 14:00:03,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 14:00:03,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 14:00:03,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 14:00:03,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 14:00:03,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 14:00:03,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 14:00:03,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 14:00:03,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 14:00:03,961 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-15 14:00:04,000 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 14:00:04,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 14:00:04,000 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 14:00:04,001 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 14:00:04,001 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 14:00:04,001 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 14:00:04,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 14:00:04,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 14:00:04,002 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 14:00:04,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 14:00:04,003 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 14:00:04,003 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 14:00:04,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 14:00:04,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 14:00:04,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 14:00:04,004 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 14:00:04,004 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 14:00:04,004 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 14:00:04,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 14:00:04,004 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 14:00:04,004 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 14:00:04,005 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 14:00:04,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 14:00:04,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 14:00:04,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 14:00:04,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:00:04,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 14:00:04,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 14:00:04,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 14:00:04,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 14:00:04,007 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 14:00:04,019 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 5a1ab43e825ce385252e3e834bebdceddee5ecd9c5749af5b0b2355e44f90dcd [2021-12-15 14:00:04,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 14:00:04,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 14:00:04,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 14:00:04,434 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 14:00:04,434 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 14:00:04,436 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-1.i [2021-12-15 14:00:04,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044cff0c6/37c006f79b2e4fb9a9bf0b2d1e4cc462/FLAGd600045ec [2021-12-15 14:00:05,059 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 14:00:05,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-1.i [2021-12-15 14:00:05,073 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044cff0c6/37c006f79b2e4fb9a9bf0b2d1e4cc462/FLAGd600045ec [2021-12-15 14:00:05,500 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044cff0c6/37c006f79b2e4fb9a9bf0b2d1e4cc462 [2021-12-15 14:00:05,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 14:00:05,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 14:00:05,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 14:00:05,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 14:00:05,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 14:00:05,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:00:05" (1/1) ... [2021-12-15 14:00:05,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7683bd72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:05, skipping insertion in model container [2021-12-15 14:00:05,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:00:05" (1/1) ... [2021-12-15 14:00:05,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 14:00:05,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 14:00:05,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:00:05,916 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 14:00:05,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:00:05,985 INFO L208 MainTranslator]: Completed translation [2021-12-15 14:00:05,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:05 WrapperNode [2021-12-15 14:00:05,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 14:00:05,987 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 14:00:05,987 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 14:00:05,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 14:00:05,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:05" (1/1) ... [2021-12-15 14:00:06,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:05" (1/1) ... [2021-12-15 14:00:06,041 INFO L137 Inliner]: procedures = 125, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2021-12-15 14:00:06,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 14:00:06,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 14:00:06,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 14:00:06,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 14:00:06,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:05" (1/1) ... [2021-12-15 14:00:06,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:05" (1/1) ... [2021-12-15 14:00:06,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:05" (1/1) ... [2021-12-15 14:00:06,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:05" (1/1) ... [2021-12-15 14:00:06,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:05" (1/1) ... [2021-12-15 14:00:06,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:05" (1/1) ... [2021-12-15 14:00:06,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:05" (1/1) ... [2021-12-15 14:00:06,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 14:00:06,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 14:00:06,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 14:00:06,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 14:00:06,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:05" (1/1) ... [2021-12-15 14:00:06,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:00:06,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:00:06,141 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-15 14:00:06,168 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-15 14:00:06,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 14:00:06,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 14:00:06,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 14:00:06,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 14:00:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 14:00:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 14:00:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 14:00:06,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 14:00:06,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 14:00:06,324 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 14:00:06,339 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 14:00:06,576 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 14:00:06,580 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 14:00:06,580 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-15 14:00:06,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:00:06 BoogieIcfgContainer [2021-12-15 14:00:06,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 14:00:06,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 14:00:06,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 14:00:06,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 14:00:06,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 02:00:05" (1/3) ... [2021-12-15 14:00:06,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c973549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:00:06, skipping insertion in model container [2021-12-15 14:00:06,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:00:05" (2/3) ... [2021-12-15 14:00:06,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c973549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:00:06, skipping insertion in model container [2021-12-15 14:00:06,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:00:06" (3/3) ... [2021-12-15 14:00:06,587 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0019-1.i [2021-12-15 14:00:06,591 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 14:00:06,591 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2021-12-15 14:00:06,628 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 14:00:06,636 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-15 14:00:06,637 INFO L340 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2021-12-15 14:00:06,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 49 states have internal predecessors, (50), 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-15 14:00:06,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:00:06,655 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:06,655 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:00:06,655 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 14:00:06,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:06,659 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-15 14:00:06,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:06,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161607075] [2021-12-15 14:00:06,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:06,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:06,820 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-15 14:00:06,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:06,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161607075] [2021-12-15 14:00:06,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161607075] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:06,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:06,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:00:06,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295783709] [2021-12-15 14:00:06,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:06,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:00:06,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:06,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:00:06,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:00:06,853 INFO L87 Difference]: Start difference. First operand has 50 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 49 states have internal predecessors, (50), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-15 14:00:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:06,910 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2021-12-15 14:00:06,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:00:06,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-15 14:00:06,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:06,918 INFO L225 Difference]: With dead ends: 48 [2021-12-15 14:00:06,919 INFO L226 Difference]: Without dead ends: 46 [2021-12-15 14:00:06,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 14:00:06,923 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 32 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:06,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 32 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:06,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-15 14:00:06,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-12-15 14:00:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.84) internal successors, (46), 45 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-15 14:00:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2021-12-15 14:00:06,952 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 3 [2021-12-15 14:00:06,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:06,955 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2021-12-15 14:00:06,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-15 14:00:06,956 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2021-12-15 14:00:06,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:00:06,956 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:06,956 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:00:06,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 14:00:06,956 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 14:00:06,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:06,959 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-15 14:00:06,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:06,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264296734] [2021-12-15 14:00:06,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:06,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:07,033 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-15 14:00:07,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:07,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264296734] [2021-12-15 14:00:07,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264296734] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:07,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:07,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:00:07,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481329967] [2021-12-15 14:00:07,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:07,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:00:07,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:07,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:00:07,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:00:07,038 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-15 14:00:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:07,073 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2021-12-15 14:00:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:00:07,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-15 14:00:07,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:07,074 INFO L225 Difference]: With dead ends: 45 [2021-12-15 14:00:07,074 INFO L226 Difference]: Without dead ends: 45 [2021-12-15 14:00:07,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 14:00:07,078 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:07,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:07,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-15 14:00:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-12-15 14:00:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.8) internal successors, (45), 44 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-15 14:00:07,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2021-12-15 14:00:07,087 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 3 [2021-12-15 14:00:07,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:07,088 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2021-12-15 14:00:07,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-15 14:00:07,088 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2021-12-15 14:00:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-15 14:00:07,089 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:07,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-15 14:00:07,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 14:00:07,092 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 14:00:07,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:07,093 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2021-12-15 14:00:07,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:07,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373383229] [2021-12-15 14:00:07,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:07,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:07,168 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-15 14:00:07,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:07,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373383229] [2021-12-15 14:00:07,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373383229] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:07,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:07,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:00:07,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979172489] [2021-12-15 14:00:07,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:07,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:00:07,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:07,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:00:07,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:00:07,172 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-15 14:00:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:07,234 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2021-12-15 14:00:07,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:00:07,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2021-12-15 14:00:07,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:07,236 INFO L225 Difference]: With dead ends: 44 [2021-12-15 14:00:07,236 INFO L226 Difference]: Without dead ends: 44 [2021-12-15 14:00:07,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:00:07,240 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 67 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:07,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 23 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-15 14:00:07,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-12-15 14:00:07,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.76) internal successors, (44), 43 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-15 14:00:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2021-12-15 14:00:07,248 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 5 [2021-12-15 14:00:07,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:07,248 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2021-12-15 14:00:07,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-15 14:00:07,249 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2021-12-15 14:00:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-15 14:00:07,249 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:07,249 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:07,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 14:00:07,250 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 14:00:07,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash 59200011, now seen corresponding path program 1 times [2021-12-15 14:00:07,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:07,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976458055] [2021-12-15 14:00:07,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:07,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:07,290 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-15 14:00:07,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:07,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976458055] [2021-12-15 14:00:07,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976458055] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:07,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:07,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:00:07,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507514277] [2021-12-15 14:00:07,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:07,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:00:07,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:07,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:00:07,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:00:07,291 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-15 14:00:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:07,332 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2021-12-15 14:00:07,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:00:07,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2021-12-15 14:00:07,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:07,333 INFO L225 Difference]: With dead ends: 42 [2021-12-15 14:00:07,333 INFO L226 Difference]: Without dead ends: 42 [2021-12-15 14:00:07,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-15 14:00:07,338 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 58 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:07,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 28 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-15 14:00:07,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-12-15 14:00:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.68) internal successors, (42), 41 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-15 14:00:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2021-12-15 14:00:07,356 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 8 [2021-12-15 14:00:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:07,356 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2021-12-15 14:00:07,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-15 14:00:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2021-12-15 14:00:07,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-15 14:00:07,357 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:07,357 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:07,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 14:00:07,357 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 14:00:07,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:07,358 INFO L85 PathProgramCache]: Analyzing trace with hash 59200012, now seen corresponding path program 1 times [2021-12-15 14:00:07,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:07,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388485314] [2021-12-15 14:00:07,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:07,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:07,481 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-15 14:00:07,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:07,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388485314] [2021-12-15 14:00:07,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388485314] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:07,482 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:07,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:00:07,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669739522] [2021-12-15 14:00:07,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:07,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:00:07,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:07,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:00:07,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:00:07,483 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-15 14:00:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:07,529 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2021-12-15 14:00:07,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:00:07,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2021-12-15 14:00:07,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:07,530 INFO L225 Difference]: With dead ends: 40 [2021-12-15 14:00:07,530 INFO L226 Difference]: Without dead ends: 40 [2021-12-15 14:00:07,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:00:07,531 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 65 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:07,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 29 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:07,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-15 14:00:07,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-12-15 14:00:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 39 states have internal predecessors, (40), 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-15 14:00:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2021-12-15 14:00:07,536 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 8 [2021-12-15 14:00:07,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:07,536 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2021-12-15 14:00:07,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-15 14:00:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2021-12-15 14:00:07,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 14:00:07,539 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:07,540 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:07,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 14:00:07,540 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 14:00:07,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:07,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1604044760, now seen corresponding path program 1 times [2021-12-15 14:00:07,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:07,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424903553] [2021-12-15 14:00:07,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:07,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:07,599 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-15 14:00:07,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:07,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424903553] [2021-12-15 14:00:07,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424903553] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:07,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:07,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:00:07,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512306253] [2021-12-15 14:00:07,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:07,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:00:07,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:07,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:00:07,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:00:07,601 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-15 14:00:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:07,627 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2021-12-15 14:00:07,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:00:07,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-15 14:00:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:07,628 INFO L225 Difference]: With dead ends: 36 [2021-12-15 14:00:07,629 INFO L226 Difference]: Without dead ends: 36 [2021-12-15 14:00:07,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 14:00:07,631 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:07,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 31 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:07,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-12-15 14:00:07,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-12-15 14:00:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.44) internal successors, (36), 35 states have internal predecessors, (36), 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-15 14:00:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2021-12-15 14:00:07,635 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 11 [2021-12-15 14:00:07,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:07,635 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2021-12-15 14:00:07,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-15 14:00:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2021-12-15 14:00:07,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 14:00:07,636 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:07,636 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:07,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 14:00:07,636 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 14:00:07,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:07,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1604044759, now seen corresponding path program 1 times [2021-12-15 14:00:07,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:07,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967034542] [2021-12-15 14:00:07,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:07,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:07,708 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-15 14:00:07,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:07,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967034542] [2021-12-15 14:00:07,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967034542] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:07,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:07,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:00:07,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370282097] [2021-12-15 14:00:07,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:07,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:00:07,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:07,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:00:07,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:00:07,713 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-15 14:00:07,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:07,736 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2021-12-15 14:00:07,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:00:07,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-15 14:00:07,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:07,737 INFO L225 Difference]: With dead ends: 32 [2021-12-15 14:00:07,739 INFO L226 Difference]: Without dead ends: 32 [2021-12-15 14:00:07,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 14:00:07,740 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:07,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 30 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:07,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-15 14:00:07,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-15 14:00:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 31 states have internal predecessors, (32), 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-15 14:00:07,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2021-12-15 14:00:07,745 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 11 [2021-12-15 14:00:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:07,745 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2021-12-15 14:00:07,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-15 14:00:07,746 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2021-12-15 14:00:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 14:00:07,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:07,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:07,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 14:00:07,747 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 14:00:07,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:07,749 INFO L85 PathProgramCache]: Analyzing trace with hash -353452457, now seen corresponding path program 1 times [2021-12-15 14:00:07,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:07,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951772510] [2021-12-15 14:00:07,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:07,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:07,872 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-15 14:00:07,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:07,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951772510] [2021-12-15 14:00:07,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951772510] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:07,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:07,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:00:07,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552232193] [2021-12-15 14:00:07,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:07,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:00:07,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:07,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:00:07,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:00:07,880 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 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-15 14:00:08,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:08,023 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2021-12-15 14:00:08,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 14:00:08,024 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 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 18 [2021-12-15 14:00:08,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:08,024 INFO L225 Difference]: With dead ends: 31 [2021-12-15 14:00:08,024 INFO L226 Difference]: Without dead ends: 31 [2021-12-15 14:00:08,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2021-12-15 14:00:08,026 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:08,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 94 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:08,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-15 14:00:08,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-12-15 14:00:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 30 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-15 14:00:08,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2021-12-15 14:00:08,033 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 18 [2021-12-15 14:00:08,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:08,033 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2021-12-15 14:00:08,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 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-15 14:00:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2021-12-15 14:00:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 14:00:08,034 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:08,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:08,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 14:00:08,034 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 14:00:08,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:08,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1927874256, now seen corresponding path program 1 times [2021-12-15 14:00:08,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:08,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428407678] [2021-12-15 14:00:08,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:08,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:08,373 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-15 14:00:08,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:08,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428407678] [2021-12-15 14:00:08,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428407678] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:08,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:08,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-15 14:00:08,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778215884] [2021-12-15 14:00:08,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:08,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-15 14:00:08,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:08,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-15 14:00:08,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-12-15 14:00:08,376 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-15 14:00:08,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:08,683 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2021-12-15 14:00:08,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 14:00:08,683 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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 19 [2021-12-15 14:00:08,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:08,684 INFO L225 Difference]: With dead ends: 31 [2021-12-15 14:00:08,684 INFO L226 Difference]: Without dead ends: 31 [2021-12-15 14:00:08,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2021-12-15 14:00:08,685 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 87 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:08,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 83 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:00:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-15 14:00:08,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-12-15 14:00:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 30 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-15 14:00:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 30 transitions. [2021-12-15 14:00:08,688 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 30 transitions. Word has length 19 [2021-12-15 14:00:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:08,688 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 30 transitions. [2021-12-15 14:00:08,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-15 14:00:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2021-12-15 14:00:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 14:00:08,689 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:08,689 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:08,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 14:00:08,689 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 14:00:08,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:08,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1927875793, now seen corresponding path program 1 times [2021-12-15 14:00:08,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:08,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059022595] [2021-12-15 14:00:08,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:08,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:08,829 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-15 14:00:08,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:08,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059022595] [2021-12-15 14:00:08,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059022595] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:08,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:08,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:00:08,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541250002] [2021-12-15 14:00:08,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:08,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:00:08,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:08,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:00:08,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:00:08,832 INFO L87 Difference]: Start difference. First operand 31 states and 30 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 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-15 14:00:08,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:08,978 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2021-12-15 14:00:08,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 14:00:08,978 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 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 19 [2021-12-15 14:00:08,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:08,978 INFO L225 Difference]: With dead ends: 30 [2021-12-15 14:00:08,978 INFO L226 Difference]: Without dead ends: 30 [2021-12-15 14:00:08,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2021-12-15 14:00:08,979 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:08,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 51 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:00:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-15 14:00:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-15 14:00:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 29 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-15 14:00:08,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 29 transitions. [2021-12-15 14:00:08,981 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 29 transitions. Word has length 19 [2021-12-15 14:00:08,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:08,981 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 29 transitions. [2021-12-15 14:00:08,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 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-15 14:00:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2021-12-15 14:00:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 14:00:08,985 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:08,985 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:08,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 14:00:08,986 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 14:00:08,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:08,986 INFO L85 PathProgramCache]: Analyzing trace with hash -365392487, now seen corresponding path program 1 times [2021-12-15 14:00:08,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:08,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930433821] [2021-12-15 14:00:08,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:08,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:09,112 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-15 14:00:09,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:09,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930433821] [2021-12-15 14:00:09,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930433821] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:09,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:09,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:00:09,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662394220] [2021-12-15 14:00:09,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:09,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:00:09,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:09,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:00:09,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:00:09,114 INFO L87 Difference]: Start difference. First operand 30 states and 29 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 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-15 14:00:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:09,235 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2021-12-15 14:00:09,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:00:09,235 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 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-15 14:00:09,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:09,237 INFO L225 Difference]: With dead ends: 29 [2021-12-15 14:00:09,237 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 14:00:09,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2021-12-15 14:00:09,237 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:09,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 66 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 14:00:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-15 14:00:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.12) internal successors, (28), 28 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-15 14:00:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 28 transitions. [2021-12-15 14:00:09,249 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 28 transitions. Word has length 20 [2021-12-15 14:00:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:09,249 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 28 transitions. [2021-12-15 14:00:09,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 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-15 14:00:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2021-12-15 14:00:09,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 14:00:09,251 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:09,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:09,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 14:00:09,251 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 14:00:09,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1557734867, now seen corresponding path program 1 times [2021-12-15 14:00:09,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:09,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151180889] [2021-12-15 14:00:09,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:09,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:09,355 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-15 14:00:09,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:09,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151180889] [2021-12-15 14:00:09,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151180889] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:09,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:09,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:00:09,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24942487] [2021-12-15 14:00:09,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:09,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:00:09,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:09,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:00:09,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:00:09,356 INFO L87 Difference]: Start difference. First operand 29 states and 28 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 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-15 14:00:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:09,484 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2021-12-15 14:00:09,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 14:00:09,484 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 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) Word has length 21 [2021-12-15 14:00:09,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:09,486 INFO L225 Difference]: With dead ends: 28 [2021-12-15 14:00:09,486 INFO L226 Difference]: Without dead ends: 28 [2021-12-15 14:00:09,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-12-15 14:00:09,487 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:09,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 70 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:09,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-15 14:00:09,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-15 14:00:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.08) internal successors, (27), 27 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-15 14:00:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2021-12-15 14:00:09,490 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 21 [2021-12-15 14:00:09,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:09,490 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2021-12-15 14:00:09,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 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-15 14:00:09,490 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2021-12-15 14:00:09,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 14:00:09,491 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:09,491 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:09,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 14:00:09,492 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 14:00:09,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:09,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1045140699, now seen corresponding path program 1 times [2021-12-15 14:00:09,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:09,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359216755] [2021-12-15 14:00:09,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:09,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:09,600 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-15 14:00:09,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:09,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359216755] [2021-12-15 14:00:09,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359216755] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:09,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:09,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:00:09,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987036913] [2021-12-15 14:00:09,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:09,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:00:09,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:09,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:00:09,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:00:09,601 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 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-15 14:00:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:09,747 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2021-12-15 14:00:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 14:00:09,747 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 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) Word has length 22 [2021-12-15 14:00:09,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:09,747 INFO L225 Difference]: With dead ends: 27 [2021-12-15 14:00:09,747 INFO L226 Difference]: Without dead ends: 27 [2021-12-15 14:00:09,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-12-15 14:00:09,748 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 55 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:09,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 41 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:00:09,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-15 14:00:09,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-15 14:00:09,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 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-15 14:00:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2021-12-15 14:00:09,752 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 22 [2021-12-15 14:00:09,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:09,752 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2021-12-15 14:00:09,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 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-15 14:00:09,752 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2021-12-15 14:00:09,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:00:09,752 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:09,752 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:09,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 14:00:09,753 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 14:00:09,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1960376619, now seen corresponding path program 1 times [2021-12-15 14:00:09,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:09,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238667826] [2021-12-15 14:00:09,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:09,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:10,117 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-15 14:00:10,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:10,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238667826] [2021-12-15 14:00:10,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238667826] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:10,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:10,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-15 14:00:10,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101187327] [2021-12-15 14:00:10,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:10,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-15 14:00:10,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:10,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-15 14:00:10,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-12-15 14:00:10,119 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 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-15 14:00:10,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:10,380 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2021-12-15 14:00:10,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 14:00:10,380 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 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 23 [2021-12-15 14:00:10,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:10,380 INFO L225 Difference]: With dead ends: 26 [2021-12-15 14:00:10,380 INFO L226 Difference]: Without dead ends: 26 [2021-12-15 14:00:10,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2021-12-15 14:00:10,381 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:10,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 48 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:00:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-15 14:00:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-15 14:00:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 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-15 14:00:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2021-12-15 14:00:10,382 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 23 [2021-12-15 14:00:10,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:10,382 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2021-12-15 14:00:10,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 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-15 14:00:10,383 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2021-12-15 14:00:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 14:00:10,383 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:00:10,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:10,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 14:00:10,383 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-15 14:00:10,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:00:10,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1568714712, now seen corresponding path program 1 times [2021-12-15 14:00:10,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:00:10,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149992923] [2021-12-15 14:00:10,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:00:10,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:00:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:00:11,685 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-15 14:00:11,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:00:11,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149992923] [2021-12-15 14:00:11,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149992923] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:00:11,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:00:11,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-12-15 14:00:11,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694085312] [2021-12-15 14:00:11,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:00:11,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-15 14:00:11,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:00:11,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-15 14:00:11,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2021-12-15 14:00:11,686 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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-15 14:00:14,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:00:14,317 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2021-12-15 14:00:14,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-15 14:00:14,318 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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 25 [2021-12-15 14:00:14,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:00:14,318 INFO L225 Difference]: With dead ends: 25 [2021-12-15 14:00:14,318 INFO L226 Difference]: Without dead ends: 0 [2021-12-15 14:00:14,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=184, Invalid=1298, Unknown=0, NotChecked=0, Total=1482 [2021-12-15 14:00:14,319 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 54 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:00:14,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 36 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 14:00:14,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-15 14:00:14,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-15 14:00:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:00:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-15 14:00:14,319 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2021-12-15 14:00:14,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:00:14,319 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 14:00:14,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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-15 14:00:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-15 14:00:14,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-15 14:00:14,321 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATION (22 of 23 remaining) [2021-12-15 14:00:14,322 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION (21 of 23 remaining) [2021-12-15 14:00:14,322 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION (20 of 23 remaining) [2021-12-15 14:00:14,322 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATION (19 of 23 remaining) [2021-12-15 14:00:14,322 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATION (18 of 23 remaining) [2021-12-15 14:00:14,322 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION (17 of 23 remaining) [2021-12-15 14:00:14,322 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATION (16 of 23 remaining) [2021-12-15 14:00:14,322 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATION (15 of 23 remaining) [2021-12-15 14:00:14,322 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATION (14 of 23 remaining) [2021-12-15 14:00:14,322 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATION (13 of 23 remaining) [2021-12-15 14:00:14,322 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATION (12 of 23 remaining) [2021-12-15 14:00:14,323 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATION (11 of 23 remaining) [2021-12-15 14:00:14,323 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATION (10 of 23 remaining) [2021-12-15 14:00:14,323 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATION (9 of 23 remaining) [2021-12-15 14:00:14,323 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATION (8 of 23 remaining) [2021-12-15 14:00:14,323 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATION (7 of 23 remaining) [2021-12-15 14:00:14,323 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (6 of 23 remaining) [2021-12-15 14:00:14,323 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (5 of 23 remaining) [2021-12-15 14:00:14,323 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (4 of 23 remaining) [2021-12-15 14:00:14,323 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (3 of 23 remaining) [2021-12-15 14:00:14,323 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (2 of 23 remaining) [2021-12-15 14:00:14,324 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (1 of 23 remaining) [2021-12-15 14:00:14,324 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2021-12-15 14:00:14,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 14:00:14,326 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:00:14,331 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 14:00:14,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 02:00:14 BoogieIcfgContainer [2021-12-15 14:00:14,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 14:00:14,340 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 14:00:14,340 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 14:00:14,340 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 14:00:14,341 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:00:06" (3/4) ... [2021-12-15 14:00:14,344 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-15 14:00:14,352 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2021-12-15 14:00:14,353 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-12-15 14:00:14,353 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-15 14:00:14,353 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-15 14:00:14,372 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-15 14:00:14,372 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 14:00:14,372 INFO L158 Benchmark]: Toolchain (without parser) took 8867.72ms. Allocated memory was 77.6MB in the beginning and 136.3MB in the end (delta: 58.7MB). Free memory was 44.0MB in the beginning and 82.7MB in the end (delta: -38.7MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2021-12-15 14:00:14,373 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 77.6MB. Free memory was 48.2MB in the beginning and 48.1MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 14:00:14,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.73ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 43.8MB in the beginning and 62.8MB in the end (delta: -19.0MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2021-12-15 14:00:14,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.65ms. Allocated memory is still 94.4MB. Free memory was 62.8MB in the beginning and 61.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 14:00:14,373 INFO L158 Benchmark]: Boogie Preprocessor took 39.23ms. Allocated memory is still 94.4MB. Free memory was 61.0MB in the beginning and 59.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 14:00:14,374 INFO L158 Benchmark]: RCFGBuilder took 499.91ms. Allocated memory is still 94.4MB. Free memory was 59.5MB in the beginning and 70.5MB in the end (delta: -11.0MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2021-12-15 14:00:14,374 INFO L158 Benchmark]: TraceAbstraction took 7752.97ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 70.2MB in the beginning and 85.8MB in the end (delta: -15.6MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2021-12-15 14:00:14,374 INFO L158 Benchmark]: Witness Printer took 32.37ms. Allocated memory is still 136.3MB. Free memory was 85.8MB in the beginning and 82.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 14:00:14,375 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.15ms. Allocated memory is still 77.6MB. Free memory was 48.2MB in the beginning and 48.1MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.73ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 43.8MB in the beginning and 62.8MB in the end (delta: -19.0MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.65ms. Allocated memory is still 94.4MB. Free memory was 62.8MB in the beginning and 61.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.23ms. Allocated memory is still 94.4MB. Free memory was 61.0MB in the beginning and 59.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 499.91ms. Allocated memory is still 94.4MB. Free memory was 59.5MB in the beginning and 70.5MB in the end (delta: -11.0MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7752.97ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 70.2MB in the beginning and 85.8MB in the end (delta: -15.6MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Witness Printer took 32.37ms. Allocated memory is still 136.3MB. Free memory was 85.8MB in the beginning and 82.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 529]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 541]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 700 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 700 mSDsluCounter, 731 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 459 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1468 IncrementalHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 272 mSDtfsCounter, 1468 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 3176 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-12-15 14:00:14,432 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 Writing output log to file Ultimate.log Result: TRUE